A Quadratically Convergent Infeasible-Interior-Point Algorithm for LCP with Polynomial Complexity
From MaRDI portal
infeasible starting pointsinfeasible-interior-point algorithmlinear complementarity problemspolynomialitypredictor--correctorsuperlinear convergence
Numerical mathematical programming methods (65K05) Linear programming (90C05) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Abstract computational complexity for mathematical programming problems (90C60)
Recommendations
- An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
- scientific article; zbMATH DE number 2195332
- An infeasible-interior-point algorithm for linear complementarity problems
Cited in
(7)- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- Infeasible predictor-corrector interior-point method applied to image restoration in the presence of noise
- Global convergence enhancement of classical linesearch interior point methods for MCPs
- On the equivalence of linear complementarity problems
- An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
- An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity
- An inexact interior point method for monotone NCP
This page was built for publication: A Quadratically Convergent Infeasible-Interior-Point Algorithm for LCP with Polynomial Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4340802)
