A survey on operator splitting and decomposition of convex programs
From MaRDI portal
Publication:2969955
DOI10.1051/ro/2015065zbMath1360.65169MaRDI QIDQ2969955
Publication date: 24 March 2017
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ro/2015065
algorithmconvergence accelerationoperator splittingdecomposition methodsconvex minimizationaugmented Lagrangian
Related Items
Another proof and a generalization of a theorem of H. H. Bauschke on monotone operators, On the convergence rate of the scaled proximal decomposition on the graph of a maximal monotone operator (SPDG) algorithm, Decomposition methods for a spatial model for long-term energy pricing problem, Stochastic decomposition applied to large-scale hydro valleys management, Monotone operator theory in convex optimization, Risk-averse stochastic programming and distributionally robust optimization via operator splitting, Progressive decoupling of linkages in optimization and variational inequalities with elicitable convexity or monotonicity, A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing, Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Fast alternating linearization methods for minimizing the sum of two convex functions
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- A primal-dual method of partial inverses for composite inclusions
- Partial inverse of a monotone operator
- Auxiliary problem principle and decomposition of optimization problems
- Separable augmented Lagrangian algorithm with multidimensional scaling for monotropic programming
- Proto-differentiability of set-valued mappings and its applications in optimization
- Monotone (nonlinear) operators in Hilbert space
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- Lectures on topics in finite element solution of elliptic problems. Notes by G. Vijayasundaram
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Application of the alternating direction method of multipliers to separable convex programming problems
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Convexification procedures and decomposition methods for nonconvex optimization problems
- A variable-penalty alternating directions method for convex optimization
- A proximal-based deomposition method for compositions method for convex minimization problems
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Accelerating convergence of a class of splitting algorithms with iterative foldings
- Proximal alternating directions method for structured variational inequalities
- A general formulation of alternating direction methods. I: Parabolic and hyperbolic problems
- Sur la stabilité et la convergence de la méthode des pas fractionnaires
- Hankel Matrix Rank Minimization with Applications to System Identification and Realization
- Proximal Splitting Methods in Signal Processing
- Fast Multiple-Splitting Algorithms for Convex Optimization
- Convergence Rate Analysis of the Forward-Douglas-Rachford Splitting Scheme
- A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- A Perturbed Parallel Decomposition Method for a Class of Nonsmooth Convex Minimization Problems
- General Projective Splitting Methods for Sums of Maximal Monotone Operators
- Decomposition through formalization in a product space
- Applications of the method of partial inverses to convex programming: Decomposition
- On Fixed Points of Non-Expansive Piecewise Isometric Mappings
- A Parallel Algorithm for a Class of Convex Programs
- 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
- A new proximal decomposition algorithm for routing in telecommunication networks
- A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- Proximal Decomposition Via Alternating Linearization
- Proximal Decomposition on the Graph of a Maximal Monotone Operator
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
- Forward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusions
- Convergence Rate Analysis of Several Splitting Schemes
- A Primal-Dual Splitting Algorithm for Finding Zeros of Sums of Maximal Monotone Operators
- Signal Recovery by Proximal Forward-Backward Splitting
- Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping
- Convex programming in Hilbert space
- Convex analysis and monotone operator theory in Hilbert spaces
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
