Weakly sharp solutions and finite convergence of algorithms for a variational inequality problem

DOI10.1080/02331934.2017.1397146zbMath1398.90180OpenAlexW2766059599MaRDI QIDQ4639132

Yina Liu

Publication date: 3 May 2018

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2017.1397146

zbMATH Keywords

variational inequalityerror boundgap functionsweakly sharp solutionconvergence of an algorithmlocally Lipschitz propertygâteaux differentiable

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (2)

Linear conditioning, weak sharpness and finite convergence for equilibrium problems ⋮ Weak sharpness and finite termination for variational inequalities on Hadamard manifolds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterization of weakly sharp solutions of a variational inequality by its primal gap function
• Finite termination of the proximal point algorithm
• Finite convergence analysis and weak sharp solutions for variational inequalities
• Gâteaux differentiability of the dual gap function of a variational inequality
• A note on finite termination of iterative algorithms in mathematical programming
• On finite convergence of proximal point algorithms for variational inequalities
• Weak Sharp Minima in Mathematical Programming
• Functional Analysis, Calculus of Variations and Optimal Control
• Optimization and nonsmooth analysis
• Weak Sharp Solutions of Variational Inequalities
• Weak Sharp Solutions of Variational Inequalities in Hilbert Spaces
• Merit functions: a bridge between optimization and equilibria

This page was built for publication: Weakly sharp solutions and finite convergence of algorithms for a variational inequality problem