Proximal point algorithms for general variational inequalities

DOI10.1007/s10957-009-9532-5zbMath1198.90374OpenAlexW2034885217MaRDI QIDQ1035903

Xiao-Ming Yuan, Li-Zhi Liao, Min Li

Publication date: 4 November 2009

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

Full work available at URL: https://doi.org/10.1007/s10957-009-9532-5

zbMATH Keywords

proximal point algorithmsgeneral variational inequalityexact and inexact versions

Mathematics Subject Classification ID

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

Related Items

Some proximal algorithms for linearly constrained general variational inequalities ⋮ A nonmonotone smoothing Newton algorithm for solving general box constrained variational inequalities ⋮ Some Goldstein's type methods for co-coercive variant variational inequalities ⋮ An approximate proximal point algorithm for maximal monotone inclusion problems ⋮ A continuous method model for solving general variational inequality ⋮ The PPA-based numerical algorithm with the \(O(1/t)\) convergence rate for variant variational inequalities ⋮ Projection iterative method for solving general variational inequalities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An approximate proximal-extragradient type method for monotone variational inequalities
• The prediction-correction approach to nonlinear complementarity problems
• General variational inequalities
• Approximate iterations in Bregman-function-based proximal algorithms
• A logarithmic-quadratic proximal method for variational inequalities
• A proximal-based deomposition method for compositions method for convex minimization problems
• A new hybrid generalized proximal point algorithm for variational inequality problems
• Comparison of two kinds of prediction-correction methods for monotone variational inequalities
• Inexact implicit methods for monotone general variational inequalities
• An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
• An improved Goldstein's type method for a class of variant variational inequalities
• Variational analysis and applications. Proceedings of the 38th conference of the School of Mathematics ``G. Stampacchia in memory of G. Stampacchia and J.-L. Lions, Erice, Italy, June 20--July 1, 2003.
• A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS^*
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• 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
• 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

This page was built for publication: Proximal point algorithms for general variational inequalities