Proximal-like contraction methods for monotone variational inequalities in a unified framework. I: Effective quadruplet and primary methods
From MaRDI portal
Publication:429465
DOI10.1007/S10589-010-9372-0zbMATH Open1268.90100OpenAlexW2047839295MaRDI QIDQ429465FDOQ429465
Authors: Li-Zhi Liao, Xiang Wang, Bingsheng 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
Recommendations
- Proximal-like contraction methods for monotone variational inequalities in a unified framework. II: General methods and numerical experiments
- Comparison of two kinds of approximate proximal point algorithms for monotone variational inequalities
- Proximal point algorithms for general variational inequalities
- An approximate proximal-extragradient type method for monotone variational inequalities
- Comparison of two proximal point algorithms for monotone variational inequalities
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Title not available (Why is that?)
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Improvements of some projection methods for monotone nonlinear variational inequalities
- Approximate iterations in Bregman-function-based proximal algorithms
- A new inexact alternating directions method for monotone variational inequalities
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- Alternate minimization gradient method
- Modification of the extra-gradient method for solving variational inequalities and certain optimization problems
- Proximal-like contraction methods for monotone variational inequalities in a unified framework. II: General methods and numerical experiments
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- A general framework of contraction methods for monotone variational inequalities
- Error bounds for proximal point subproblems and associated inexact proximal point algorithms
- Title not available (Why is that?)
- Alternating projection based prediction-correction methods for structured variational inequalities
Cited In (6)
- Proximal-like contraction methods for monotone variational inequalities in a unified framework. II: General methods and numerical experiments
- Distributionally robust Weber problem with uncertain demand
- On the \(O(1/t)\) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators
- A uniform framework of contraction methods for convex optimization and monotone variational inequality
- Relaxed augmented Lagrangian-based proximal point algorithms for convex optimization with linear constraints
- Sensitivity analysis of the proximal-based parallel decomposition methods
This page was built for publication: Proximal-like contraction methods for monotone variational inequalities in a unified framework. I: Effective quadruplet and primary methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429465)
