An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming

DOI10.1137/0806002zbMATH Open0846.90071OpenAlexW2144868677MaRDI QIDQ4877503FDOQ4877503

Authors: Florian A. Potra 

Publication date: 30 September 1996

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0806002

Recommendations

• A predictor-corrector infeasible-interior-point algorithm for linear programming
• Two Infeasible Interior-Point Predictor-Corrector Algorithms for Linear Programming
• A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
• scientific article; zbMATH DE number 1047678
• scientific article; zbMATH DE number 1300325

zbMATH Keywords

interior-point methodspolynomial complexitypredictor-corrector methodinfeasible starting point

Mathematics Subject Classification ID

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

Cited In (45)

• Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming
• An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem
• An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
• Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems
• Equivaence between different formulations of the linear complementarity promblem
• Validated infeasible interior-point predictor-corrector methods for linear programming
• A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
• A Polynomial Predictor-Corrector Trust-Region Algorithm for Linear Programming
• On the convergence analysis of arc search interior point methods for LCPs
• A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
• An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization
• Local convergence of interior-point algorithms for degenerate monotone LCP
• An infeasible-interior-point predictor-corrector algorithm for the \(P_ *\)-geometric LCP
• Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
• A wide neighborhood infeasible-interior-point method with arc-search for linear programming
• Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions
• Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming
• Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions
• An infeasible-interior-point algorithm using projections onto a convex set
• 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
• A new infeasible interior-point algorithm for linear complementarity problem
• Following a “Balanced” Trajectory from an Infeasible Point to an Optimal Linear Programming Solution with a Polynomial-Time Algorithm
• An adaptive infeasible interior-point algorithm for linear complementarity problems
• Infeasible constraint-reduced interior-point methods for linear optimization
• An infeasible interior-point algorithm with full-Newton step for linear optimization
• Convergence of the homotopy path for a full-Newton step infeasible interior-point method
• Improved full-Newton step \(O(nL)\) infeasible interior-point method for linear optimization
• Polynomiality of infeasible-interior-point algorithms for linear programming
• Superlinear convergence of infeasible-interior-point methods for linear programming
• Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
• A predictor-corrector infeasible-interior-point algorithm for linear programming
• SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
• A generalized homogeneous and self-dual algorithm for linear programming
• Entering into the domain of feasible solutions using interior point method
• A modified infeasible-interior-point algorithm for linear optimization problems
• A polynomial interior-point algorithm with improved iteration bounds for linear optimization
• Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
• A path-following interior-point algorithm for linear and quadratic problems
• Two Infeasible Interior-Point Predictor-Corrector Algorithms for Linear Programming
• An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization
• New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
• Global convergence in infeasible-interior-point algorithms
• An interior point potential reduction method for constrained equations

This page was built for publication: An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming

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