A class of rank-two ellipsoid algorithms for convex programming
From MaRDI portal
Recommendations
- A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming
- scientific article; zbMATH DE number 4131965
- Using two successive subgradients in the ellipsoid method for nonlinear programming
- An ellipsoid algorithm for equality-constrained nonlinear programs
- An objective-function ellipsoid-algorithm for convex quadraical programming
Cites work
- An ellipsoid algorithm for nonlinear programming
- Family of algorithms for solving convex programming problems
- Feature Article—The Ellipsoid Method: A Survey
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 5968600 (Why is no real title available?)
- Modifications and implementation of the ellipsoid algorithm for linear programming
- Non-Linear Programming Via Penalty Functions
- On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid
Cited in
(7)- A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming
- Using two successive subgradients in the ellipsoid method for nonlinear programming
- An efficient solution method for rank two quasiconcave minimization problems
- Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
- A parametric solution algorithm for a class of rank-two nonconvex programs
- Stochastic ellipsoid methods for robust control: Multiple updates and multiple cuts
- Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope
This page was built for publication: A class of rank-two ellipsoid algorithms for convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3325476)
