Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence

DOI10.1007/BF02192304MaRDI QIDQ1893347zbMATH OpenFDO

Authors Yanyan Li

Publication date 3 July 1995

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02192304

zbMATH Keywords

monotone linear complementarity problemspredictor-corrector algorithmsuperlinear convergence

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• Predictor-corrector method for nonlinear complementarity problems
• A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity
• Corrector-predictor methods for sufficient linear complementarity problems
• Predictor-corrector Methods for a Class of Linear Complementarity Problems
• A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem

Cites work

• A new polynomial time method for a linear complementarity problem
• A polynomial-time algorithm for a class of linear complementarity problems
• A Polynomial-Time Predictor-Corrector Algorithm for a Class of Linear Complementarity Problems
• A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
• A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming
• An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
• An interior point potential reduction algorithm for the linear complementarity problem
• AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEM
• Convergence behavior of interior-point algorithms
• Large-Step Interior Point Algorithms for Linear Complementarity Problems
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
• On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems

Cited in

(25)

• On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
• Interior point methods for optimal control of discrete time systems
• Local convergence of interior-point algorithms for degenerate monotone LCP
• An infeasible-interior-point algorithm for linear complementarity problems
• Predictor-corrector method for nonlinear complementarity problems
• A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy
• Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem
• The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path
• The curvature integral and the complexity of linear complementarity problems
• A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
• An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
• A superquadratic infeasible-interior-point method for linear complementarity problems
• A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization
• Trajectory-following methods for large-scale degenerate convex quadratic programming
• Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
• A Polynomial-Time Predictor-Corrector Algorithm for a Class of Linear Complementarity Problems
• An improved predictor-corrector interior-point algorithm for linear complementarity problems with \(O(\sqrt{n}L)\)-iteration complexity
• Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems
• Predictor-corrector Methods for a Class of Linear Complementarity Problems
• Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
• Corrector-predictor methods for sufficient linear complementarity problems
• Une procédure de purification pour les problèmes de complémentarité linéaire, monotones
• A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
• Predictor-corrector smoothing methods for monotone LCP
• Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization

This page was built for publication: Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence

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