A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points

DOI10.1007/BF01582228zbMATH Open0832.90077OpenAlexW2005037958MaRDI QIDQ1804652FDOQ1804652

Authors: Florian A. Potra 

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

Recommendations

• An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
• A predictor-corrector infeasible-interior-point algorithm for linear programming
• An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
• Two Infeasible Interior-Point Predictor-Corrector Algorithms for Linear Programming
• scientific article

zbMATH Keywords

polynomial complexitypredictor-corrector methodinfeasible starting points

Mathematics Subject Classification ID

Linear programming (90C05) Abstract computational complexity for mathematical programming problems (90C60)

Cites Work

• A new polynomial-time algorithm for linear programming
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• Title not available (Why is that?)
• A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
• An Infeasible-Interior-Point Predictor-Corrector Algorithm 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 primal-dual interior point method for linear programming
• Quadratic Convergence in a Primal-Dual Method
• Probabilistic analysis of an infeasible-interior-point algorithm for linear programming
• Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming

Cited In (22)

• An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
• A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
• On the convergence analysis of arc search interior point methods for LCPs
• An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization
• Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions
• Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs
• A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
• A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization
• An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
• LOQO:an interior point code for quadratic programming
• An infeasible-interior-point algorithm for linear complementarity problems
• On homogeneous and self-dual algorithms for LCP
• The complexity of self-regular proximity based infeasible IPMs
• An adaptive infeasible interior-point algorithm for linear complementarity problems
• Infeasible constraint-reduced interior-point methods for linear optimization
• Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
• A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy
• A predictor-corrector infeasible-interior-point algorithm for linear programming
• A polynomial interior-point algorithm with improved iteration bounds for linear optimization
• Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
• New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
• A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems

This page was built for publication: A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804652)