The analyticity of interior-point-paths at strictly complementary solutions of linear programs
From MaRDI portal
Publication:4391295
DOI10.1080/10556789808805693zbMath0904.90120OpenAlexW1963924267MaRDI QIDQ4391295
Publication date: 19 January 1999
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556789808805693
Related Items (4)
Asymptotic behavior of the central path for a special class of degenerate SDP problems ⋮ Two simple proofs for analyticity of the central path in linear programming. ⋮ Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming ⋮ Analyticity of the central path at the boundary point in semidefinite programming
Cites Work
- 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
- A primal-dual infeasible-interior-point algorithm for linear programming
- Limiting behavior of weighted central paths in linear programming
- On the Implementation of a Primal-Dual Interior Point Method
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Unnamed Item
This page was built for publication: The analyticity of interior-point-paths at strictly complementary solutions of linear programs
