Some proximal algorithms for linearly constrained general variational inequalities

DOI10.1080/02331934.2010.522714zbMath1246.90119OpenAlexW1996932642MaRDI QIDQ2903137

Min Li, Xiao-Ming Yuan

Publication date: 23 August 2012

Published in: Optimization (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)

Cites Work

• A new approximate proximal point algorithm for maximal monotone operator
• The system of generalized vector equilibrium problems with applications
• An approximate proximal-extragradient type method for monotone variational inequalities
• The prediction-correction approach to nonlinear complementarity problems
• Proximal point algorithms for general variational inequalities
• General variational inequalities
• A logarithmic-quadratic proximal method for variational inequalities
• Inexact implicit methods for monotone general variational inequalities
• A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS^*
• Monotone Operators and the Proximal Point Algorithm
• Convergence of Proximal-Like Algorithms
• Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
• A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
• Lagrangian Duality and Related Multiplier Methods for Variational Inequality Problems
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• On a Generalization of a Normal Map and Equation
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• On the basic theorem of complementarity
• A new accuracy criterion for approximate proximal point algorithms
• Global projection-type error bounds for general variational inequalities
• Unnamed Item