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

DOI10.1137/0323042zbMath0581.90078OpenAlexW2044197565MaRDI QIDQ3705225

J. G. Ecker, Michael Kupferschmid

Publication date: 1985

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0323042

zbMATH Keywords

ellipsoid algorithmcomparison of algorithmsnumerical studyaugmented Lagrangian algorithmreduced gradient algorithmHan-Powell iterative quadratic programming algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Mathematical programming (90C99)

Related Items (9)

Using two successive subgradients in the ellipsoid method for nonlinear programming ⋮ A class of algorithms for computing the minimal value of a convex functionfover[0 1^kwithin accuracy ∊, when the evaluations offare made within accuracy ∊] ⋮ Simplices by point-sliding and the Yamnitsky-Levin algorithm ⋮ A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming ⋮ Active set strategies in an ellipsoid algorithm for nonlinear programming ⋮ A derivative-based bracketing scheme for univariate minimization and the conjugate gradient method ⋮ An application of nonlinear optimization in molecular biology ⋮ A deep cut ellipsoid algorithm for convex programming: Theory and applications ⋮ Solving nonlinear principal-agent problems using bilevel programming

This page was built for publication: A Computational Comparison of the Ellipsoid Algorithm with Several Nonlinear Programming Algorithms