Global convergence of the affine scaling methods for degenerate linear programming problems
From MaRDI portal
Publication:1181905
DOI10.1007/BF01582896zbMath0749.90051MaRDI QIDQ1181905
Publication date: 27 June 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Related Items
Analysis of some interior point continuous trajectories for convex programming, Superlinear convergence of the affine scaling algorithm, Convergence of the dual variables for the primal affine scaling method with unit steps in the homogeneous case, A simple proof of a primal affine scaling method, An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption, The primal power affine scaling method, An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming, An affine scaling method using a class of differential barrier functions: primal approach, Trust region affine scaling algorithms for linearly constrained convex and concave programs, Improving the rate of convergence of interior point methods for linear programming, Affine scaling with degenerate linear programming problems, An affine scaling method for solving network flow problems, The \(\ell_1\) solution of linear inequalities, A first-order interior-point method for linearly constrained smooth optimization, Loss and retention of accuracy in affine scaling methods, Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization, Generalized affine scaling algorithms for linear programming problems, Degeneracy in interior point methods for linear programming: A survey, A simplified global convergence proof of the affine scaling algorithm, Global convergence of the affine scaling algorithm for primal degenerate strictly convex quadratic programming problems, On the symmetric affiine scaling algorithm for line programming*, On the big \({\mathcal M}\) in the affine scaling algorithm, Interior-point methods for linear programming: a review
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modification of Karmarkar's linear programming algorithm
- A new polynomial-time algorithm for linear programming
- Computational experience with a dual affine variant of Karmarkar's method for linear programming
- Conical projection algorithms for linear programming
- An implementation of Karmarkar's algorithm for linear programming
- Limiting behavior of the affine scaling continuous trajectories for linear programming problems
- A variation on Karmarkar’s algorithm for solving linear programming problems
- Local Convergence Properties of New Methods in Linear Programming
- The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
- Boundary Behavior of Interior Point Algorithms in Linear Programming
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
- Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems
