A globally convergent descent method for nonsmooth variational inequalities

DOI10.1007/s10589-007-9132-yzbMath1170.90458OpenAlexW2035876122WikidataQ58097329 ScholiaQ58097329MaRDI QIDQ839486

Barbara Panicucci, Mauro Passacantando, Massimo Pappalardo

Publication date: 2 September 2009

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-007-9132-y

zbMATH Keywords

descent methodgap functionmonotone mapnonsmooth variational inequality

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (3)

On solving generalized Nash equilibrium problems via optimization ⋮ Merit functions: a bridge between optimization and equilibria ⋮ Merit functions: a bridge between optimization and equilibria

Cites Work

• Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
• Modified descent methods for solving the monotone variational inequality problem
• Equivalence of variational inequality problems to unconstrained minimization
• Some methods based on the D-gap function for solving monotone variational inequalities
• Local uniqueness and convergence of iterative methods for nonsmooth variational inequalities
• Optimization and nonsmooth analysis
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Unnamed Item
• Unnamed Item

This page was built for publication: A globally convergent descent method for nonsmooth variational inequalities