Une procédure de purification pour les problèmes de complémentarité linéaire, monotones

DOI10.1051/ro:2004012zbMath1092.90051OpenAlexW2047943496MaRDI QIDQ5479841

Abderrahim Kadiri, Adnan Yassine

Publication date: 11 July 2006

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2004__38_1_63_0

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Related Items

A fast algorithm for solving a class of the linear complementarity problem in a finite number of steps

Cites Work

• On the finite convergence of interior-point algorithms for linear programming
• Sufficient matrices and the linear complementarity problem
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• A polynomial-time algorithm for a class of linear complementarity problems
• Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP
• On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
• Local convergence of interior-point algorithms for degenerate monotone LCP
• Numerical optimization. Theoretical and practice aspects
• Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
• A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems
• Path-Following Methods for Linear Programming
• New purification algorithms for linear programming
• Superlinearly Convergent $O ( \sqrt{n} L )$-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem
• On the Identification of Zero Variables in an Interior-Point Framework
• Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem
• Large-Step Interior Point Algorithms for Linear Complementarity Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item