Equivaence between different formulations of the linear complementarity promblem

DOI10.1080/10556789708805657zbMath0871.90095OpenAlexW2035735077MaRDI QIDQ4345240

Goran Lešaja, Florian A. Potra, Mihai Anitescu

Publication date: 23 July 1997

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556789708805657

zbMATH Keywords

interior-point algorithmslinear complementarityquadratic convergencepolynomiality

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation ⋮ Sufficient weighted complementarity problems ⋮ Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems ⋮ Generalized System Identification with Stable Spline Kernels ⋮ Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path ⋮ Trajectory-following methods for large-scale degenerate convex quadratic programming ⋮ Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem ⋮ Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations ⋮ Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones ⋮ A homogeneous model for monotone mixed horizontal linear complementarity problems ⋮ A long-step interior-point algorithm for symmetric cone Cartesian P_*(κ)-HLCP ⋮ Corrector-predictor methods for sufficient linear complementarity problems ⋮ A full Nesterov–Todd step infeasible-interior-point algorithm for CartesianP_*(κ) horizontal linear complementarity problems over symmetric cones ⋮ 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 ⋮ Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem ⋮ On theP_*(κ)horizontal linear complementarity problems over Cartesian product of symmetric cones ⋮ Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction

Cites Work

• Sufficient matrices and the linear complementarity problem
• A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems
• A path-following interior-point algorithm for linear and quadratic problems
• Generalized Linear Complementarity Problems
• An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
• Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem