A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework
From MaRDI portal
Publication:4657707
Recommendations
- A class of variable metric decomposition methods for monotone variational inclusions
- An improved proximal-based decomposition method for structured monotone variational inequalities
- scientific article; zbMATH DE number 6135093
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- Nonlinear proximal decomposition method for convex programming
Cites work
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- A SPLITTING METHOD FOR COMPOSITE MAPPINGS
- A Truly Globally Convergent Newton-Type Method for the Monotone Nonlinear Complementarity Problem
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- A new proximal-based globalization strategy for the Josephy‐Newton method for variational inequalities
- A proximal-based deomposition method for compositions method for convex minimization problems
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Applications of the method of partial inverses to convex programming: Decomposition
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Convergence Rates in Forward--Backward Splitting
- Enlargement of monotone operators with applications to variational inequalities
- Epsilon-proximal decomposition method
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- Modification of the extra-gradient method for solving variational inequalities and certain optimization problems
- Modified Projection-Type Methods for Monotone Variational Inequalities
- Monotone Operators and the Proximal Point Algorithm
- On linear convergence of iterative methods for the variational inequality problem
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Proximal Decomposition Via Alternating Linearization
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Two general methods for computing saddle points with applications for decomposing convex programming problems
Cited in
(17)- A unified convergence framework for nonmonotone inexact decomposition methods
- A revisit of Chen-Teboulle's proximal-based decomposition method
- Rate of convergence for proximal point algorithms on Hadamard manifolds
- A bundle method using two polyhedral approximations of the \(\epsilon \)-enlargement of a maximal monotone operator
- A class of variable metric decomposition methods for monotone variational inclusions
- scientific article; zbMATH DE number 6135093 (Why is no real title available?)
- Pointwise and ergodic convergence rates of a variable metric proximal alternating direction method of multipliers
- The geometry of monotone operator splitting methods
- Convergence rates with inexact non-expansive operators
- Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization
- A class of Dantzig-Wolfe type decomposition methods for variational inequality problems
- A survey on operator splitting and decomposition of convex programs
- Strong Convergence of an Inexact Proximal Point Algorithm for Equilibrium Problems in Banach Spaces
- Low complexity regularization of linear inverse problems
- A new extragradient-type method for mixed variational inequalities
- The hybrid proximal decomposition method applied to the computation of a Nash equilibrium for hydrothermal electricity markets
- Accelerating block-decomposition first-order methods for solving composite saddle-point and two-player Nash equilibrium problems
This page was built for publication: A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4657707)
