scientific article
From MaRDI portal
Publication:3342208
zbMath0549.90061MaRDI QIDQ3342208
No author found.
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
relaxationrates of convergencesubgradient methodstotally unimodular matrixellipsoid methodsepsilon optimalitynonsimplex algorithms
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Convex programming (90C25) Linear programming (90C05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (9)
Unnamed Item ⋮ Simplices by point-sliding and the Yamnitsky-Levin algorithm ⋮ Ellipsoid projection method in matrix games ⋮ Specialized fast algorithms for IQC feasibility and optimization problems. ⋮ 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 ⋮ Unnamed Item
This page was built for publication:
