A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework
From MaRDI portal
Publication:4657707
DOI10.1080/1055678042000218957zbMath1097.90041OpenAlexW1968262474MaRDI QIDQ4657707
Publication date: 14 March 2005
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/1055678042000218957
decompositionmaximal monotone operatorvariational inclusionbundle methodenlargement of operatorhybrid inexact proximal point method
Convex programming (90C25) Variational inequalities (49J40) Numerical methods in optimal control (49M99)
Related Items
A bundle method using two polyhedral approximations of the \(\epsilon \)-enlargement of a maximal monotone operator ⋮ Accelerating Block-Decomposition First-Order Methods for Solving Composite Saddle-Point and Two-Player Nash Equilibrium Problems ⋮ Convergence rates with inexact non-expansive operators ⋮ A revisit of Chen-Teboulle's proximal-based decomposition method ⋮ A survey on operator splitting and decomposition of convex programs ⋮ A class of Dantzig-Wolfe type decomposition methods for variational inequality problems ⋮ The hybrid proximal decomposition method applied to the computation of a Nash equilibrium for hydrothermal electricity markets ⋮ Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization ⋮ Strong Convergence of an Inexact Proximal Point Algorithm for Equilibrium Problems in Banach Spaces ⋮ Rate of convergence for proximal point algorithms on Hadamard manifolds ⋮ A new extragradient-type method for mixed variational inequalities ⋮ Pointwise and ergodic convergence rates of a variable metric proximal alternating direction method of multipliers ⋮ Low Complexity Regularization of Linear Inverse Problems
Uses Software
Cites Work
- Two general methods for computing saddle points with applications for decomposing convex programming problems
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A proximal-based deomposition method for compositions method for convex minimization problems
- Enlargement of monotone operators with applications to variational inequalities
- Epsilon-proximal decomposition method
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- On linear convergence of iterative methods for the variational inequality problem
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- Applications of the method of partial inverses to convex programming: Decomposition
- Modification of the extra-gradient method for solving variational inequalities and certain optimization problems
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Convergence Rates in Forward--Backward Splitting
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- A new proximal-based globalization strategy for the Josephy‐Newton method for variational inequalities
- Proximal Decomposition Via Alternating Linearization
- Modified Projection-Type Methods for Monotone Variational Inequalities
- A SPLITTING METHOD FOR COMPOSITE MAPPINGS
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- A Truly Globally Convergent Newton-Type Method for the Monotone Nonlinear Complementarity Problem
