Two simple proofs for analyticity of the central path in linear programming.
From MaRDI portal
Recommendations
- Analytical properties of the central path at boundary point in linear programming
- A note on the structure of the central path in linear programming
- Analyticity of the central path at the boundary point in semidefinite programming
- On the complexity of following the central path of linear programs by linear extrapolation. II
- A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming
- The analyticity of interior-point-paths at strictly complementary solutions of linear programs
- On the curvature of the central path of linear programming theory
- scientific article; zbMATH DE number 4199964
- scientific article; zbMATH DE number 2010093
- Analyticity of weighted central paths and error bounds for semidefinite programming
Cites work
- A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming
- An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
- Analytical properties of the central path at boundary point in linear programming
- Degeneracy in interior point methods for linear programming: A survey
- High order infeasible-interior-point methods for solving sufficient linear complementarity problems
- scientific article; zbMATH DE number 3121284 (Why is no real title available?)
- scientific article; zbMATH DE number 1017028 (Why is no real title available?)
- scientific article; zbMATH DE number 1064582 (Why is no real title available?)
- scientific article; zbMATH DE number 776096 (Why is no real title available?)
- scientific article; zbMATH DE number 4197741 (Why is no real title available?)
- Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity
- Limiting behavior of the affine scaling continuous trajectories for linear programming problems
- Limiting behavior of weighted central paths in linear programming
- On the analyticity properties of infeasible-interior point paths for monotone linear complementarity problems
- Path-Following Methods for Linear Programming
- The analyticity of interior-point-paths at strictly complementary solutions of linear programs
Cited in
(14)- Analytical properties of the central path at boundary point in linear programming
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- On well definedness of the central path
- Analytic centers and repelling inequalities
- 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
- A note on the structure of the central path in linear programming
- scientific article; zbMATH DE number 434731 (Why is no real title available?)
- A high-order path-following method for projection onto the primal-dual optimal solution set of linear programs
- The analyticity of interior-point-paths at strictly complementary solutions of linear programs
- scientific article; zbMATH DE number 776096 (Why is no real title available?)
- Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming
- On a special class of regularized central paths for semidefinite programs
- Analyticity of weighted central paths and error bounds for semidefinite programming
This page was built for publication: Two simple proofs for analyticity of the central path in linear programming.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5937499)
