A linearly convergent derivative-free descent method for strongly monotone complementarity problems
From MaRDI portal
Publication:1303775
DOI10.1023/A:1008752626695zbMath1017.90115MaRDI QIDQ1303775
Mikhail V. Solodov, Olvi L. Mangasarian
Publication date: 26 August 2003
Published in: Computational Optimization and Applications (Search for Journal in Brave)
linear convergencecomplementarity problemsdescent algorithmsderivative-free methodsimplicit Lagrangian
Derivative-free methods and methods using generalized derivatives (90C56) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (9)
The linear convergence of a derivative-free descent method for nonlinear complementarity problems ⋮ A new method for solving monotone generalized variational inequalities ⋮ A modified multivariate spectral gradient projection method for nonlinear complementarity problems ⋮ Merit functions and error bounds for generalized variational inequalities. ⋮ A nonmonotone derivative-free algorithm for nonlinear complementarity problems based on the new generalized penalized Fischer-Burmeister merit function ⋮ A linearly convergent derivative-free descent method for the second-order cone complementarity problem ⋮ Derivative-free methods for monotone variational inequality and complementarity problems ⋮ Some results on the filter method for nonlinear complementary problems ⋮ Regularization algorithms for solving monotone Ky Fan inequalities with application to a Nash-Cournot equilibrium model
This page was built for publication: A linearly convergent derivative-free descent method for strongly monotone complementarity problems
