On the solution of bounded and unbounded mixed complementarity problems
- 1 January 2001
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 50 (3-4), 265-278
- https://doi.org/10.1080/02331930108844563
Abstract
A reformulation of the bounded mixed complementarity problem is introduced. It is proved that the level sets of the objective function are bounded and, under reasonableassumptions, stationary points coincide with solutions of the original variationalinequality problem. Therefore, standard minimization algorithms applied to the new reformulation must succeed. This result is applied to the compactification of unboundedmixed complementarity problemsKeywords
This publication has 17 references indexed in Scilit:
- The reformulation of nonlinear complementarity problems using the Fischer-burmeister functionApplied Mathematics Letters, 1999
- On the solution of the extended linear complementarity problemLinear Algebra and its Applications, 1998
- A new approach to continuation methods for complementarity problems with uniform P-functionsOperations Research Letters, 1997
- Solution of linear complementarity problems using minimization with simple boundsJournal of Global Optimization, 1995
- The Extended Linear Complementarity ProblemSIAM Journal on Matrix Analysis and Applications, 1995
- Mcplib: a collection of nonlinear mixed complementarity problemsOptimization Methods and Software, 1995
- A new strategy for solving variational inequalities in bounded polytopes∗Numerical Functional Analysis and Optimization, 1995
- A new trust region algorithm for bound constrained minimizationApplied Mathematics & Optimization, 1994
- On the Resolution of Linearly Constrained Convex Minimization ProblemsSIAM Journal on Optimization, 1994
- Algorithms for Linear Complementarity ProblemsPublished by Springer Nature ,1994