Polynomial affine algorithms for linear programming
From MaRDI portal
Publication:1814590
DOI10.1007/BF01588776zbMath0777.90027OpenAlexW2070244796MaRDI QIDQ1814590
Publication date: 25 June 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01588776
Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Mathematical programming (90C99)
Related Items
Interior-point algorithms for semi-infinite programming, Convergence property of the Iri-Imai algorithm for some smooth convex programming problems, Combining phase I and phase II in a potential reduction algorithm for linear programming, Potential-reduction methods in mathematical programming, Nonlinear coordinate representations of smooth optimization problems, An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming, Large step volumetric potential reduction algorithms for linear programming, New complexity results for the Iri-Imai method, Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis, Interior point algorithms for linear programming with inequality constraints, Comparative analysis of affine scaling algorithms based on simplifying assumptions, On lower bound updates in primal potential reduction methods for linear programming, A combined phase I-phase II scaled potential algorithm for linear programming, A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start, A survey of search directions in interior point methods for linear programming, Pure adaptive search in global optimization, A combinatorial interior point method for network flow problems, Long steps in an \(O(n^ 3L)\) algorithm for linear programming, An interior point potential reduction algorithm for the linear complementarity problem, A polynomial method of approximate centers for linear programming, On the convergence of primal-dual interior-point methods with wide neighborhoods, A class of polynomial variable metric algorithms for linear optimization, Degeneracy in interior point methods for linear programming: A survey, An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs, An \(O(n^ 3L)\) potential reduction algorithm for linear programming
Cites Work
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- An extension of Karmarkar's algorithm for linear programming using dual variables
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Conical projection algorithms for linear programming
- A Centered Projective Algorithm for Linear Programming
- Boundary Behavior of Interior Point Algorithms in Linear Programming
