An infeasible-interior-point predictor-corrector algorithm for the \(P_ *\)-geometric LCP
From MaRDI portal
Publication:1365467
zbMath0884.90140MaRDI QIDQ1365467
Mihai Anitescu, Goran Lešaja, Florian A. Potra
Publication date: 5 April 1998
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
linear complementarityquadratic convergencepredictor-correctorpolynomialityinfeasible-interior-point algorithm\(P_ *\)-matrix
Numerical mathematical programming methods (65K05) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (10)
An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function ⋮ A new path-following algorithm for nonlinear \(P_*\) complementarity problems ⋮ A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem ⋮ A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems ⋮ Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones ⋮ Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path ⋮ A long-step interior-point algorithm for symmetric cone Cartesian P*(κ)-HLCP ⋮ The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path ⋮ An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function ⋮ A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems
This page was built for publication: An infeasible-interior-point predictor-corrector algorithm for the \(P_ *\)-geometric LCP
