Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming
From MaRDI portal
Publication:5275290
DOI10.1137/16M1078604zbMath1368.47038MaRDI QIDQ5275290
Deren Han, Ke Guo, Xiao-Ming Yuan
Publication date: 11 July 2017
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
convergenceconvergence rateDouglas-Rachford splitting methodrate of asymptotic regularityFejér monotoneweakly convex penalty
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52) Monotone operators and generalizations (47H05)
Related Items (24)
A note on the Douglas-Rachford splitting method for optimization problems involving hypoconvex functions ⋮ A survey on some recent developments of alternating direction method of multipliers ⋮ On compositions of special cases of Lipschitz continuous operators ⋮ Asymptotic behaviour of a nonautonomous evolution equation governed by a quasi-nonexpansive operator ⋮ The springback penalty for robust signal recovery ⋮ An envelope for Davis-Yin splitting and strict saddle-point avoidance ⋮ A generalization of linearized alternating direction method of multipliers for solving two-block separable convex programming ⋮ A continuous dynamical splitting method for solving ‘strongly+weakly’ convex programming problems ⋮ On Proximal Algorithms with Inertial Effects Beyond Monotonicity ⋮ A linearized Peaceman-Rachford splitting method for structured convex optimization with application to stable principal component pursuit ⋮ A general truncated regularization framework for contrast-preserving variational signal and image restoration: motivation and implementation ⋮ Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems ⋮ A second-order adaptive Douglas-Rachford dynamic method for maximal \(\alpha\)-monotone operators ⋮ An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge ⋮ A fundamental proof of convergence of alternating direction method of multipliers for weakly convex optimization ⋮ ADMM-type methods for generalized multi-facility Weber problem ⋮ Adaptive Douglas--Rachford Splitting Algorithm for the Sum of Two Operators ⋮ A Peaceman-Rachford splitting method with monotone plus skew-symmetric splitting for nonlinear saddle point problems ⋮ A Three-Operator Splitting Algorithm for Nonconvex Sparsity Regularization ⋮ An adaptive alternating direction method of multipliers ⋮ Adaptive Douglas--Rachford Splitting Algorithm from a Yosida Approximation Standpoint ⋮ Convergence of an Inertial Shadow Douglas-Rachford Splitting Algorithm for Monotone Inclusions ⋮ A unified Douglas-Rachford algorithm for generalized DC programming ⋮ Conical averagedness and convergence analysis of fixed point algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- Nonlinear total variation based noise removal algorithms
- On the order of the operators in the Douglas-Rachford algorithm
- On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Convergence rates with inexact non-expansive operators
- Linear and strong convergence of algorithms involving averaged nonexpansive operators
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Iterative methods for fixed point problems in Hilbert spaces
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- Semiconcave functions, Hamilton-Jacobi equations, and optimal control
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- On the convergence rate of Douglas-Rachford operator splitting method
- On Chebyshev functions and Klee functions
- Wavelet methods in statistics: some recent developments and their applications
- Metric subregularity and the proximal point method
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Peaceman-Rachford splitting for a class of nonconvex optimization problems
- The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem
- On the rate of convergence of Krasnosel'skiĭ-Mann iterations and their connection with sums of Bernoullis
- The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle
- Local convergence properties of Douglas-Rachford and alternating direction method of multipliers
- Backward-forward algorithms for structured monotone inclusions in Hilbert spaces
- On the local convergence of the Douglas-Rachford algorithm
- Linear convergence of the Douglas–Rachford method for two closed sets
- The Douglas--Rachford Algorithm for Two (Not Necessarily Intersecting) Affine Subspaces
- Stadium Norm and Douglas-Rachford Splitting: A New Approach to Road Design Optimization
- Iteration processes for nonexpansive mappings
- The composition of projections onto closed convex sets in Hilbert space is asymptotically regular
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- On the Range of the Douglas–Rachford Operator
- Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging
- Krasnoselski-Mann Iterations in Normed Spaces
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Evolution equations with lack of convexity
- Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit
- Implicit Functions and Solution Mappings
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- Nonexpansive Mappings, Asymptotic Regularity and Successive Approximations
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Fixed Points and Iteration of a Nonexpansive Mapping in a Banach Space
- Modified Lagrangians in convex programming and their generalizations
- Variational Analysis
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Sparse Signal Estimation by Maximally Sparse Convex Optimization
- The Convergence Guarantees of a Non-Convex Approach for Sparse Recovery
- On the Convergence of the Iterative Shrinkage/Thresholding Algorithm With a Weakly Convex Penalty
- A Generalized Proximal Point Algorithm and Its Convergence Rate
- The Primal-Dual Hybrid Gradient Method for Semiconvex Splittings
- Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems
- The solution by iteration of nonlinear functional equations in Banach spaces
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
- Convergence of Krasnoselskii-Mann iterations of nonexpansive operators
This page was built for publication: Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming