Constant potential primal-dual algorithms: A framework
From MaRDI portal
Publication:1340053
DOI10.1007/BF01581142zbMath0823.90087MaRDI QIDQ1340053
Publication date: 11 December 1994
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
90C05: Linear programming
Related Items
A self-adjusting interior point algorithm for linear complementarity problems, Potential-reduction methods in mathematical programming, An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming
Cites Work
- Unnamed Item
- Unnamed Item
- Convergence behavior of interior-point algorithms
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- A primal-dual affine-scaling potential-reduction algorithm for linear programming
- Superlinear primal-dual affine scaling algorithms for LCP
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- A Centered Projective Algorithm for Linear Programming
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming