Finite Algorithms for Solving Quasiconvex Quadratic Programs

Finite Algorithms for Solving Quasiconvex Quadratic Programs

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Operations research 1972-01, Vol.20 (1), p.167-173
1. Verfasser: Mylander, W. Charles
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Linear equations
Logical theorems
Mathematical functions
Nonlinear programming
Objective functions
Quadratic functions
Quadratic programming
Simplex method
Technical Notes
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0030-364X
1526-5463
DOI:10.1287/opre.20.1.167