A Computational Comparison of the Ellipsoid Algorithm with Several Nonlinear Programming Algorithms

A computational comparison of several general purpose nonlinear programming algorithms is presented. This study was motivated by the preliminary results in [12] which show that the recently developed ellipsoid algorithm is competitive with a widely used augmented Lagrangian algorithm. To provide a b...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:SIAM journal on control and optimization Ročník 23; číslo 5; s. 657 - 674
Hlavní autori: Ecker, J. G., Kupferschmid, M.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Philadelphia, PA Society for Industrial and Applied Mathematics 01.09.1985
Predmet:
Algorithms
Applied mathematics
Applied sciences
Exact sciences and technology
Libraries
Mathematical programming
Operational research and scientific management
Operational research. Management science
Quadratic programming
Algorithm
Non linear programming
Mathematical programming
ISSN:0363-0129, 1095-7138
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:A computational comparison of several general purpose nonlinear programming algorithms is presented. This study was motivated by the preliminary results in [12] which show that the recently developed ellipsoid algorithm is competitive with a widely used augmented Lagrangian algorithm. To provide a better perspective on the value of ellipsoid algorithms in nonlinear programming, the present study includes some of the most highly regarded nonlinear programming algorithms and is a much more comprehensive study than [12]. The algorithms considered here are chosen from four distinct classes and 50 well-known test problems are used. The algorithms used represent augmented Lagrangian, ellipsoid, generalized reduced gradient, and iterative quadratic programming methods. Results regarding robustness and relative efficiency are presented.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0363-0129
1095-7138
DOI:10.1137/0323042