A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
From MaRDI portal
Publication:4340809
DOI10.1137/S1052623495279359zbMath0872.90100MaRDI QIDQ4340809
Rongqin Sheng, Florian A. Potra
Publication date: 12 June 1997
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
linear complementarity problemssuperlinear convergencepolynomialityinfeasible-interior-point algorithm\(P_ *\)-matrices
Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (29)
An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity ⋮ Hessian distances and their applications in the complexity analysis of interior-point methods ⋮ Full Nesterov–Todd step feasible interior-point method for the CartesianP*(κ)-SCLCP ⋮ A new path-following algorithm for nonlinear \(P_*\) complementarity problems ⋮ Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path ⋮ A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization ⋮ A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems ⋮ A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem ⋮ Complexity analysis of a full-{N}ewton step interior-point method for linear optimization ⋮ A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems ⋮ An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones ⋮ A New Search Direction for Full-Newton Step Interior-Point Method in P*(κ)-HLCP ⋮ Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones ⋮ Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path ⋮ A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems ⋮ A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions ⋮ Improved full-Newton step \(O(nL)\) infeasible interior-point method for linear optimization ⋮ Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path ⋮ New method for determining search directions for interior-point algorithms in linear optimization ⋮ Interior-point methods for CartesianP*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions ⋮ Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems. ⋮ Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction ⋮ Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP ⋮ An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step ⋮ Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique ⋮ Quasi-P\(_*\)-maps, P(\(\tau,\alpha,\beta\))-maps, exceptional family of elements, and complementarity problems ⋮ Interior-point methods ⋮ Global convergence enhancement of classical linesearch interior point methods for MCPs ⋮ A new second-order corrector interior-point algorithm for P*(k)-LCP
This page was built for publication: A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
