On the solution of the extended linear complementarity problem

DOI10.1016/S0024-3795(98)10041-1zbMath0932.90044OpenAlexW1979736213MaRDI QIDQ1808956

José Mario Martínez, Roberto Andreani

Publication date: 7 February 2000

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0024-3795(98)10041-1

zbMATH Keywords

box constrained minimization

Mathematics Subject Classification ID

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

Related Items

On the regularization of mixed complementarity problems, A globally convergent sequential linear programming algorithm for mathematical programs with linear complementarity constraints, A smoothing Levenberg-Marquardt method for the extended linear complementarity problem, On the solution of bounded and unbounded mixed complementarity problems, A proximal gradient descent method for the extended second-order cone linear complementarity problem, A self-adaptive trust region method for the extended linear complementarity problems

Cites Work

• Unnamed Item
• Some optimization reformulations of the extended linear complementarity problem
• Solution of finite-dimensional variational inequalities using smooth optimization with simple bounds
• Solution of linear complementarity problems using minimization with simple bounds
• On the extended linear complementarity problem
• On the Resolution of Linearly Constrained Convex Minimization Problems
• The Extended Linear Complementarity Problem
• A new strategy for solving variational inequalities in bounded polytopes^∗
• Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem
• A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem