A unified Douglas-Rachford algorithm for generalized DC programming
From MaRDI portal
Publication:2114583
DOI10.1007/s10898-021-01079-yzbMath1486.90151OpenAlexW3199330683MaRDI QIDQ2114583
Chih-Sheng Chuang, Zhiyuan Zhang, Hongjin He
Publication date: 15 March 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-021-01079-y
nonconvex optimizationalternating direction method of multipliersDC programmingDouglas-Rachford algorithmDC algorithm
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
- A rank-corrected procedure for matrix completion with fixed basis coefficients
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Optimizing a multi-stage production/inventory system by DC programming based approaches
- A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting
- Alternating direction method of multipliers with difference of convex functions
- Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- A note on the Douglas-Rachford splitting method for optimization problems involving hypoconvex functions
- Fast L1-L2 minimization via a proximal operator
- A proximal difference-of-convex algorithm with extrapolation
- DC programming and DCA: thirty years of developments
- Visualizing data as objects by DC (difference of convex) optimization
- Convergence of generalized proximal point algorithms
- DC programming: overview.
- Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
- Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
- Global convergence of a non-convex Douglas-Rachford iteration
- A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
- A continuous approach for the concave cost supply problem via DC programming and DCA
- Proximal Splitting Methods in Signal Processing
- A Weighted Difference of Anisotropic and Isotropic Total Variation Model for Image Processing
- Sum-Rate Maximization in Two-Way AF MIMO Relaying: Polynomial Time Solutions to a Class of DC Programming Problems
- A New Decomposition Method for Multiuser DC-Programming and Its Applications
- Non-convex Optimization for Machine Learning
- Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
- Convergence Analysis of the Relaxed Douglas--Rachford Algorithm
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
- Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming
- Stable signal recovery from incomplete and inaccurate measurements
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: A unified Douglas-Rachford algorithm for generalized DC programming
