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

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 DE number 5606390

Cites work

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

Cited in

(22)

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

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)