A survey on operator splitting and decomposition of convex programs
From MaRDI portal
Publication:2969955
Recommendations
- A splitting method for separable convex programming
- scientific article; zbMATH DE number 7652690
- Monotone operator theory and splitting methods
- Recent developments on primal-dual splitting methods with applications to convex minimization
- Some parallel splitting methods for separable convex programming with the \(O(\frac{1}{t})\) convergence rate
Cites work
- scientific article; zbMATH DE number 45081 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 3615396 (Why is no real title available?)
- scientific article; zbMATH DE number 679861 (Why is no real title available?)
- scientific article; zbMATH DE number 1086732 (Why is no real title available?)
- scientific article; zbMATH DE number 1488004 (Why is no real title available?)
- scientific article; zbMATH DE number 4121779 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- A Parallel Algorithm for a Class of Convex Programs
- A Perturbed Parallel Decomposition Method for a Class of Nonsmooth Convex Minimization Problems
- A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A general formulation of alternating direction methods. I: Parabolic and hyperbolic problems
- A monotone+skew splitting model for composite monotone inclusions in duality
- A new proximal decomposition algorithm for routing in telecommunication networks
- A primal-dual method of partial inverses for composite inclusions
- A primal-dual splitting algorithm for finding zeros of sums of maximal monotone operators
- A proximal-based deomposition method for compositions method for convex minimization problems
- A variable-penalty alternating directions method for convex optimization
- Accelerating convergence of a class of splitting algorithms with iterative foldings
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- Application of the alternating direction method of multipliers to separable convex programming problems
- 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 Lagrangian and proximal alternating direction methods of multipliers in Hilbert spaces. Applications to games, PDE's and control
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Auxiliary problem principle and decomposition of optimization problems
- Convergence Rates in Forward--Backward Splitting
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convergence rate analysis of several splitting schemes
- Convergence rate analysis of the forward-Douglas-Rachford splitting scheme
- Convex analysis and monotone operator theory in Hilbert spaces
- Convex programming in Hilbert space
- Convexification procedures and decomposition methods for nonconvex optimization problems
- Decomposition through formalization in a product space
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- Fast alternating linearization methods for minimizing the sum of two convex functions
- Fast multiple-splitting algorithms for convex optimization
- Forward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusions
- General Projective Splitting Methods for Sums of Maximal Monotone Operators
- Hankel matrix rank minimization with applications to system identification and realization
- Lectures on topics in finite element solution of elliptic problems. Notes by G. Vijayasundaram
- Monotone (nonlinear) operators in Hilbert space
- Monotone Operators and the Proximal Point Algorithm
- On Fixed Points of Non-Expansive Piecewise Isometric Mappings
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Partial inverse of a monotone operator
- Proto-differentiability of set-valued mappings and its applications in optimization
- Proximal Decomposition Via Alternating Linearization
- Proximal Decomposition on the Graph of a Maximal Monotone Operator
- Proximal alternating directions method for structured variational inequalities
- Proximal splitting methods in signal processing
- Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- Separable augmented Lagrangian algorithm with multidimensional scaling for monotropic programming
- Signal Recovery by Proximal Forward-Backward Splitting
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping
- Sur la stabilité et la convergence de la méthode des pas fractionnaires
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
Cited in
(13)- A primer on monotone operator methods
- A unified splitting algorithm for composite monotone inclusions
- Operator splitting performance estimation: tight contraction factors and optimal parameter selection
- A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing
- Progressive decoupling of linkages in optimization and variational inequalities with elicitable convexity or monotonicity
- Stochastic decomposition applied to large-scale hydro valleys management
- The geometry of monotone operator splitting methods
- Another proof and a generalization of a theorem of H. H. Bauschke on monotone operators
- Risk-averse stochastic programming and distributionally robust optimization via operator splitting
- Monotone operator theory in convex optimization
- Decomposition methods for a spatial model for long-term energy pricing problem
- A closer look at consistent operator splitting and its extensions for topology optimization
- On the convergence rate of the scaled proximal decomposition on the graph of a maximal monotone operator (SPDG) algorithm
This page was built for publication: A survey on operator splitting and decomposition of convex programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2969955)
