Projective method of multipliers for linearly constrained convex minimization
From MaRDI portal
Publication:2419546
DOI10.1007/s10589-019-00065-1zbMath1414.90271arXiv1609.00467OpenAlexW2963223140MaRDI QIDQ2419546
Publication date: 13 June 2019
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.00467
Numerical mathematical programming methods (65K05) Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Numerical methods involving duality (49M29)
Related Items
A projective splitting method for monotone inclusions: iteration-complexity and application to composite optimization ⋮ On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems ⋮ Single-forward-step projective splitting: exploiting cocoercivity ⋮ Convergence Rates for Projective Splitting
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- Functional analysis, Sobolev spaces and partial differential equations
- Monotone (nonlinear) operators in Hilbert space
- 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 dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Parallel alternating direction multiplier decomposition of convex programs
- A family of projective splitting methods for the sum of two maximal monotone operators
- On the maximal monotonicity of subdifferential mappings
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- The Split Bregman Method for L1-Regularized Problems
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control
- Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
- Proximité et dualité dans un espace hilbertien
- Convex Analysis
- Compressed sensing
