A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
From MaRDI portal
Publication:1804652
DOI10.1007/BF01582228zbMath0832.90077OpenAlexW2005037958MaRDI QIDQ1804652
Publication date: 15 May 1995
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01582228
Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)
Related Items
An infeasible-interior-point algorithm for linear complementarity problems, Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems, On homogeneous and self-dual algorithms for LCP, A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems, Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs, An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution, A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization, A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems, A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy, An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization, New complexity analysis of IIPMs for linear optimization based on a specific self-regular function, The complexity of self-regular proximity based infeasible IPMs, Infeasible constraint-reduced interior-point methods for linear optimization, Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions, A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization, An adaptive infeasible interior-point algorithm for linear complementarity problems, An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step, Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming, On the convergence analysis of arc search interior point methods for LCPs, LOQO:an interior point code for quadratic programming
Cites Work
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- Computational experience with a primal-dual interior point method for linear programming
- Interior path following primal-dual algorithms. I: Linear programming
- A primal-dual infeasible-interior-point algorithm for linear programming
- Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- Probabilistic Analysis of an Infeasible-Interior-Point Algorithm for Linear Programming
- Quadratic Convergence in a Primal-Dual Method
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
