A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming

DOI10.1007/BF01582280zbMath0677.90061MaRDI QIDQ1123811

Michael Kupferschmid, A. Ech-Cherif, J. G. Ecker

Publication date: 1989

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

Numerical experimentsrank-two ellipsoid algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (1)

Using two successive subgradients in the ellipsoid method for nonlinear programming

Cites Work

• Unnamed Item
• Unnamed Item
• An ellipsoid algorithm for nonlinear programming
• A class of rank-two ellipsoid algorithms for convex programming
• A Computational Comparison of the Ellipsoid Algorithm with Several Nonlinear Programming Algorithms
• Feature Article—The Ellipsoid Method: A Survey
• A set of geometric programming test problems and their solutions

This page was built for publication: A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming