A class of rank-two ellipsoid algorithms for convex programming
From MaRDI portal
Publication:3325476
DOI10.1007/BF02592220zbMath0538.90072MaRDI QIDQ3325476
Publication date: 1984
Published in: Mathematical Programming (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55)
Related Items
Using two successive subgradients in the ellipsoid method for nonlinear programming, A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming, Stochastic ellipsoid methods for robust control: Multiple updates and multiple cuts
Cites Work
- Unnamed Item
- Unnamed Item
- An ellipsoid algorithm for nonlinear programming
- Family of algorithms for solving convex programming problems
- Feature Article—The Ellipsoid Method: A Survey
- Modifications and implementation of the ellipsoid algorithm for linear programming
- On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid
- Non-Linear Programming Via Penalty Functions