Two simple proofs for analyticity of the central path in linear programming.
From MaRDI portal
Publication:5937499
DOI10.1016/S0167-6377(00)00065-1zbMath1108.90323WikidataQ128100534 ScholiaQ128100534MaRDI QIDQ5937499
Publication date: 12 July 2001
Published in: Operations Research Letters (Search for Journal in Brave)
Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items (7)
On a special class of regularized central paths for semidefinite programs ⋮ Complexity analysis of a full-{N}ewton step interior-point method for linear optimization ⋮ Analyticity of weighted central paths and error bounds for 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 ⋮ A high-order path-following method for projection onto the primal-dual optimal solution set of linear programs ⋮ Analyticity of the central path at the boundary point in semidefinite programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
- 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
- Degeneracy in interior point methods for linear programming: A survey
- Limiting behavior of weighted central paths in linear programming
- Analytical properties of the central path at boundary point in linear programming
- Limiting behavior of the affine scaling continuous trajectories for linear programming problems
- High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems
- Path-Following Methods for Linear Programming
- The analyticity of interior-point-paths at strictly complementary solutions of linear programs
- A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming
This page was built for publication: Two simple proofs for analyticity of the central path in linear programming.