Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

article · Defense Technical Information Center (DTIC) · 1971

General Quadratic Programming

Claude‐Alain Burdet

Cited by 1Abstract and details only

Abstract

An algorithm is presented for the general (not necessarily convex or concave) quadratic programming problem over a linearly constrained set. The algorithm is finitely convergent and makes use of a convex quadratic programming method as a subroutine (like the quadratic simplex for instance). The basic tool for this method is a facial decomposition for polyhedral sets.

Cite this paper

APA 7

Burdet, C. (1971). General Quadratic Programming. Defense Technical Information Center (DTIC).

MLA 9

Burdet, Claude‐Alain. “General Quadratic Programming.” Defense Technical Information Center (DTIC), 1971.

Chicago

Burdet, Claude‐Alain. 1971. “General Quadratic Programming.” Defense Technical Information Center (DTIC).

Harvard

Burdet, C. (1971) ‘General Quadratic Programming’, Defense Technical Information Center (DTIC).

BibTeX
@article{burdet1971general,
  title = {{General Quadratic Programming}},
  author = {Burdet, Claude‐Alain},
  journal = {Defense Technical Information Center (DTIC)},
  year = {1971}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers