Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem
From MaRDI portal
Publication:1760104
DOI10.1016/j.apnum.2012.05.009zbMath1262.65067OpenAlexW1964764811MaRDI QIDQ1760104
Xinze Liu, Chang-He Liu, Hong-Wei Liu
Publication date: 12 November 2012
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apnum.2012.05.009
interior-point methodlinear complementarity problempolynomial complexitypredictor-corrector algorithmmehrotra-type algorithm
Related Items
A Mehrotra Type Predictor-Corrector Interior-Point Method for P∗(κ)-HLCP, A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming, A step-truncated method in a wide neighborhood interior-point algorithm for linear programming, A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems, A Predictor–Corrector Algorithm for Monotone Linear Complementarity Problems in a Wide Neighborhood, On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems, Polynomial convergence of Mehrotra-type predictor–corrector algorithm for the CartesianP∗(κ)-LCP over symmetric cones, On the convergence analysis of arc search interior point methods for LCPs, Infeasible path-following interior point algorithm for Cartesian P*(κ) nonlinear complementarity problems over symmetric cones
Cites Work
- Unnamed Item
- Unnamed Item
- Corrector-predictor methods for sufficient linear complementarity problems
- An infeasible-start path-following method for monotone LCPs
- A new polynomial-time algorithm for linear programming
- Polynomial time second order mehrotra-type predictor--corrector algorithms
- Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms
- Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming
- Further development of multiple centrality correctors for interior point methods
- 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
- Asymptotic convergence in a generalized predictor-corrector method
- Predictor-corrector method for nonlinear complementarity problems
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
- \(P_ *\)-matrices are just sufficient
- A Mehrotra-type predictor-corrector algorithm with polynomiality and \(Q\)-subquadratic convergence
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
- On Mehrotra-Type Predictor-Corrector Algorithms
- On the Implementation of a Primal-Dual Interior Point Method
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method 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
- Global Convergence Properties of Some Iterative Methods for Linear Complementarity Problems
