Proximal-like contraction methods for monotone variational inequalities in a unified framework. II: General methods and numerical experiments
From MaRDI portal
(Redirected from Publication:429466)
Recommendations
- Proximal-like contraction methods for monotone variational inequalities in a unified framework. I: Effective quadruplet and primary methods
- Comparison of two kinds of approximate proximal point algorithms for monotone variational inequalities
- An approximate proximal-extragradient type method for monotone variational inequalities
- A uniform framework of contraction methods for convex optimization and monotone variational inequality
- PPA-like contraction methods for convex optimization: a framework using variational inequality approach
Cites work
- scientific article; zbMATH DE number 4147426 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 3494173 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A globally convergent Newton method for solving strongly monotone variational inequalities
- A new inexact alternating directions method for monotone variational inequalities
- A simple proof for some important properties of the projection mapping
- An approximate proximal-extragradient type method for monotone variational inequalities
- Approximate iterations in Bregman-function-based proximal algorithms
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Calibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints
- Comparison of two kinds of prediction-correction methods for monotone variational inequalities
- Error bounds for proximal point subproblems and associated inexact proximal point algorithms
- Improvements of some projection methods for monotone nonlinear variational inequalities
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Proximal-like contraction methods for monotone variational inequalities in a unified framework. I: Effective quadruplet and primary methods
Cited in
(11)- A forward accelerated contraction method for a class of monotone nonlinear variational inequalities
- A uniform framework of contraction methods for convex optimization and monotone variational inequality
- scientific article; zbMATH DE number 6135093 (Why is no real title available?)
- Proximal-like contraction methods for monotone variational inequalities in a unified framework. I: Effective quadruplet and primary methods
- Distributionally robust Weber problem with uncertain demand
- Sensitivity analysis of the proximal-based parallel decomposition methods
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- On the \(O(1/t)\) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators
- PPA-like contraction methods for convex optimization: a framework using variational inequality approach
- A self-adaptive three-term conjugate gradient method for monotone nonlinear equations with convex constraints
- A new implementable prediction-correction method for monotone variational inequalities with separable structure
This page was built for publication: Proximal-like contraction methods for monotone variational inequalities in a unified framework. II: General methods and numerical experiments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429466)
