Proximal-like contraction methods for monotone variational inequalities in a unified framework. I: Effective quadruplet and primary methods

DOI10.1007/s10589-010-9372-0zbMath1268.90100OpenAlexW2047839295MaRDI QIDQ429465

Li-Zhi Liao, Xiang Wang, Bing-sheng He

Publication date: 19 June 2012

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

Full work available at URL: https://doi.org/10.1007/s10589-010-9372-0

zbMATH Keywords

monotonevariational inequalitycontraction methods

Mathematics Subject Classification ID

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

Related Items (5)

Distributionally robust Weber problem with uncertain demand ⋮ Proximal-like contraction methods for monotone variational inequalities in a unified framework. II: General methods and numerical experiments ⋮ Relaxed augmented Lagrangian-based proximal point algorithms for convex optimization with linear constraints ⋮ Sensitivity analysis of the proximal-based parallel decomposition methods ⋮ On the \(O(1/t)\) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proximal-like contraction methods for monotone variational inequalities in a unified framework. II: General methods and numerical experiments
• Approximate iterations in Bregman-function-based proximal algorithms
• Error bounds for proximal point subproblems and associated inexact proximal point algorithms
• A new inexact alternating directions method for monotone variational inequalities
• Modification of the extra-gradient method for solving variational inequalities and certain optimization problems
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Alternate minimization gradient method
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
• Improvements of some projection methods for monotone nonlinear variational inequalities

This page was built for publication: Proximal-like contraction methods for monotone variational inequalities in a unified framework. I: Effective quadruplet and primary methods