A Linearly Convergent Derivative-Free Descent Method for Strongly Monotone Complementarity Problems
Authors:
- 1 July 1999
- journal article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 14 (1) , 5-16
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Unconstrained minimization approaches to nonlinear complementarity problemsJournal of Global Optimization, 1996
- On the resolution of monotone complementarity problemsComputational Optimization and Applications, 1996
- Inexact Newton Methods for Semismooth Equations with Applications to Variational Inequality Problems1996
- Merit Functions for Variational Inequality and Complementarity Problems1996
- Solution of linear complementarity problems using minimization with simple boundsJournal of Global Optimization, 1995
- Complementarity Problems1995
- NE/SQP: A robust algorithm for the nonlinear complementarity problemMathematical Programming, 1993
- Gauss-Newton methods for the complementarity problemJournal of Optimization Theory and Applications, 1993
- Nonlinear complementarity as unconstrained and constrained minimizationMathematical Programming, 1993
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problemsMathematical Programming, 1992