Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
From MaRDI portal
Publication:5757354
DOI10.1137/050623723zbMath1128.90058MaRDI QIDQ5757354
Publication date: 6 September 2007
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/050623723
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
90C51: Interior-point methods
Related Items
Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction, A new second-order corrector interior-point algorithm for P*(k)-LCP, Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function, Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP, Interior-point methods for CartesianP*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions, Sufficient weighted complementarity problems, A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones, Corrector-predictor methods for sufficient linear complementarity problems, Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems, Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones, Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path, Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique, A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems, A corrector-predictor path-following method for convex quadratic symmetric cone optimization, Trajectory-following methods for large-scale degenerate convex quadratic programming, A homotopy method for solving the horizontal linear complementarity problem, On theP*(κ)horizontal linear complementarity problems over Cartesian product of symmetric cones, Nondegenerate Piecewise Linear Systems: A Finite Newton Algorithm and Applications in Machine Learning, An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones
