Technical Note—Finite Algorithms for Solving Quasiconvex Quadratic Programs

W. Charles Mylander
Additional contact information
W. Charles Mylander: Research Analysis Corporation, McLean, Virginia

Operations Research, 1972, vol. 20, issue 1, 167-173

Abstract: This note considers the question of why some convex quadratic programming algorithms fail and others succeed when applied to nonconvex quasiconvex quadratic programs. Several algorithms are identified as being capable of solving quasiconvex quadratic programs using only a finite number of arithmetic and logical operations. These algorithms are all primal feasible, pivot algorithms.

Date: 1972
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.20.1.167 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:20:y:1972:i:1:p:167-173

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().