The analyticity of interior-point-paths at strictly complementary solutions of linear programs
From MaRDI portal
Recommendations
Cites work
- A new polynomial-time algorithm for linear programming
- A primal-dual infeasible-interior-point 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 O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- scientific article; zbMATH DE number 778139 (Why is no real title available?)
- Limiting behavior of weighted central paths in linear programming
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- On the Implementation of a Primal-Dual Interior Point Method
Cited in
(6)- On the analyticity properties of infeasible-interior point paths for monotone linear complementarity problems
- Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity
- Analyticity of the central path at the boundary point in semidefinite programming
- Asymptotic behavior of the central path for a special class of degenerate SDP problems
- Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming
- Two simple proofs for analyticity of the central path in linear programming.
This page was built for publication: The analyticity of interior-point-paths at strictly complementary solutions of linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4391295)
