A Quadratically Convergent Infeasible-Interior-Point Algorithm for LCP with Polynomial Complexity
DOI10.1137/S1052623494267826zbMATH Open0878.90094MaRDI QIDQ4340802FDOQ4340802
linear complementarity problemssuperlinear convergencepolynomialityinfeasible-interior-point algorithminfeasible starting pointspredictor--corrector
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Linear programming (90C05) Abstract computational complexity for mathematical programming problems (90C60) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
- 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
- Global convergence enhancement of classical linesearch interior point methods for MCPs
- An inexact interior point method for monotone NCP
- On the equivalence of linear complementarity problems
- Infeasible predictor-corrector interior-point method applied to image restoration in the presence of noise
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity
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)
