An improved predictor-corrector interior-point algorithm for linear complementarity problems with \(O(\sqrt{n}L)\)-iteration complexity

DOI10.1155/2011/340192zbMath1334.90203OpenAlexW1997853977WikidataQ58690320 ScholiaQ58690320MaRDI QIDQ410785

Qian Yu, Debin Fang

Publication date: 4 April 2012

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2011/340192

zbMATH Keywords

Mizuno-Todd-Ye algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Related Items (2)

Solving the logit-based stochastic user equilibrium problem with elastic demand based on the extended traffic network model ⋮ A New Iteration-Complexity Bound for the MTY Predictor-Corrector Algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• A polynomial path-following interior point algorithm for general linear complementarity problems
• A unified approach to interior point algorithms for linear complementary problems
• On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
• The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path
• A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity
• Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
• An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
• A path-following interior-point algorithm for linear and quadratic problems
• A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
• High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP

This page was built for publication: An improved predictor-corrector interior-point algorithm for linear complementarity problems with \(O(\sqrt{n}L)\)-iteration complexity