The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path

DOI10.1016/S0377-2217(02)00388-0zbMath1058.90076OpenAlexW2120088630MaRDI QIDQ1848380

Florian A. Potra

Publication date: 20 November 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00388-0

zbMATH Keywords

Linear programmingPath-followingInterior-point algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Related Items

A Mehrotra Type Predictor-Corrector Interior-Point Method for P∗(κ)-HLCP ⋮ A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems ⋮ Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms ⋮ Complexity analysis of a full-{N}ewton step interior-point method for linear optimization ⋮ The accuracy of interior-point methods based on kernel functions ⋮ An improved predictor-corrector interior-point algorithm for linear complementarity problems with \(O(\sqrt{n}L)\)-iteration complexity ⋮ A corrector-predictor interior-point method with new search direction for linear optimization ⋮ A Corrector-Predictor Interior-Point Algorithm for P_∗(κ)-HLCPs Over Cartesian Product of Symmetric Cones ⋮ A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization ⋮ A polynomial path-following interior point algorithm for general linear complementarity problems ⋮ Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood ⋮ Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions

Uses Software

• RODAS
• PITCON

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the monotone convergence of Newton's method
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
• Local convergence of interior-point algorithms for degenerate monotone LCP
• Efficient hybrid algorithms for finding zeros of convex functions
• Primal-dual algorithms for linear programming based on the logarithmic barrier method
• An infeasible-interior-point predictor-corrector algorithm for the \(P_ *\)-geometric LCP
• Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
• Primal-dual target-following algorithms for linear programming
• A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem