scientific article; zbMATH DE number 4199964
From MaRDI portal
Publication:3348700
Recommendations
- On the complexity of following the central path of linear programs by linear extrapolation. II
- Path-Following Methods for Linear Programming
- scientific article; zbMATH DE number 409894
- A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms
- Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals
Cited in
(10)- A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization
- Two simple proofs for analyticity of the central path in linear programming.
- A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
- On the -exponential trajectory of linear programming
- On the complexity of following the central path of linear programs by linear extrapolation. II
- A note on the structure of the central path in linear programming
- A corrector-predictor interior-point method with new search direction for linear optimization
- Comparative analysis of affine scaling algorithms based on simplifying assumptions
- Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem
- scientific article; zbMATH DE number 3870497 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3348700)
