A predictor-corrector algorithm for \(P_{\ast}(\kappa)\)-linear complementarity problems based on a specific self-regular proximity function

DOI10.1007/s40306-014-0100-1zbMath1332.90301OpenAlexW1974047843MaRDI QIDQ255679

F. Blanchet-Sadri, M. Dambrine

Publication date: 9 March 2016

Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40306-014-0100-1

zbMATH Keywords

linear complementarity problemspolynomial complexitypredictor-corrector algorithmself-regular functions

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• 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
• Improved complexity using higher-order correctors for primal-dual Dikin affine scaling
• Self-regular functions and new search directions for linear and semidefinite optimization
• \(P_ *\)-matrices are just sufficient
• An infeasible interior-point algorithm with full-Newton step for linear optimization
• Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
• The complexity of high-order predictor-corrector methods for solving sufficient linear complementarity problems
• A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function