Publication:3342208
From MaRDI portal
zbMath0549.90061MaRDI QIDQ3342208
No author found.
Publication date: 1984
relaxation; rates of convergence; subgradient methods; totally unimodular matrix; ellipsoid methods; epsilon optimality; nonsimplex algorithms
68Q25: Analysis of algorithms and problem complexity
65K05: Numerical mathematical programming methods
90C25: Convex programming
90C05: Linear programming
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
Related Items
Ellipsoid projection method in matrix games, A genuinely polynomial primal simplex algorithm for the assignment problem, Projection algorithms for linear programming, A quadratically convergent local algorithm on minimizing the largest eigenvalue of a symmetric matrix, A quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrix, Simplices by point-sliding and the Yamnitsky-Levin algorithm, Specialized fast algorithms for IQC feasibility and optimization problems., Unnamed Item, Unnamed Item