Solution of linear complementarity problems using minimization with simple bounds
- 1 April 1995
- journal article
- research article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 6 (3), 253-267
- https://doi.org/10.1007/bf01099464
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Global Convergence Properties of Some Iterative Methods for Linear Complementarity ProblemsSIAM Journal on Optimization, 1996
- Convergence of Interior Point Algorithms for the Monotone Linear Complementarity ProblemMathematics of Operations Research, 1996
- Nonlinear complementarity as unconstrained optimizationJournal of Optimization Theory and Applications, 1996
- 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
- Nonlinear complementarity as unconstrained and constrained minimizationMathematical Programming, 1993
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problemsMathematical Programming, 1992
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple BoundsSIAM Journal on Numerical Analysis, 1988
- Global Optimization Approach to the Linear Complementarity ProblemSIAM Journal on Scientific and Statistical Computing, 1988