A predictor-corrector infeasible-interior-point algorithm for linear programming
From MaRDI portal
Publication:1342276
DOI10.1016/0167-6377(94)90061-2zbMATH Open0820.90070OpenAlexW2065878167MaRDI QIDQ1342276FDOQ1342276
Authors: Shinji Mizuno 
Publication date: 11 January 1995
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(94)90061-2
Recommendations
- An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
- Two Infeasible Interior-Point Predictor-Corrector Algorithms for Linear Programming
- Polynomiality of infeasible-interior-point algorithms for linear programming
- A primal-dual infeasible-interior-point algorithm for linear programming
- A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
Cites Work
- On the Implementation of a Primal-Dual Interior Point Method
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
- Polynomiality of infeasible-interior-point algorithms for linear programming
- An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
- A primal-dual infeasible-interior-point algorithm for linear programming
- Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
- Computational experience with a primal-dual interior point method for linear programming
- Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs
Cited In (13)
- Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming
- Title not available (Why is that?)
- A Polynomial Predictor-Corrector Trust-Region Algorithm for Linear Programming
- An infeasible-interior-point predictor-corrector algorithm for the \(P_ *\)-geometric LCP
- Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming
- Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming
- Title not available (Why is that?)
- A predictor-corrector algorithm combined conjugate gradient with homotopy interior point for general nonlinear programming
- A numerical study of an infeasible primal-dual path-following algorithm for linear programming
- A corrector-predictor interior-point method with new search direction for linear optimization
- Title not available (Why is that?)
- A new predictor-collector algorithm for linear programming
- Two Infeasible Interior-Point Predictor-Corrector Algorithms for Linear Programming
This page was built for publication: A predictor-corrector infeasible-interior-point algorithm for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1342276)
