A unified Douglas-Rachford algorithm for generalized DC programming
From MaRDI portal
Publication:2114583
DOI10.1007/S10898-021-01079-YzbMATH Open1486.90151OpenAlexW3199330683MaRDI QIDQ2114583FDOQ2114583
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
Recommendations
- A general double-proximal gradient algorithm for d.c. programming
- Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
- An accelerated proximal algorithm for the difference of convex programming
- Alternating DC algorithm for partial DC programming problems
- A forward-backward algorithm for the DC programming in Hilbert spaces
alternating direction method of multipliersnonconvex optimizationDouglas-Rachford algorithmDC programmingDC algorithm
Cites Work
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Convex analysis and monotone operator theory in Hilbert spaces
- 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
- DC programming: overview.
- Title not available (Why is that?)
- Stable signal recovery from incomplete and inaccurate measurements
- Proximal Splitting Methods in Signal Processing
- Convergence of generalized proximal point algorithms
- A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
- Global convergence of a non-convex Douglas-Rachford iteration
- Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
- A note on the Douglas-Rachford splitting method for optimization problems involving hypoconvex functions
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- A continuous approach for the concave cost supply problem via DC programming and DCA
- A rank-corrected procedure for matrix completion with fixed basis coefficients
- Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm
- A Weighted Difference of Anisotropic and Isotropic Total Variation Model for Image Processing
- A New Decomposition Method for Multiuser DC-Programming and Its Applications
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- 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
- Convergence Analysis of the Relaxed Douglas--Rachford Algorithm
- Alternating direction method of multipliers with difference of convex functions
- Non-convex Optimization for Machine Learning
- DC programming and DCA: thirty years of developments
- Visualizing data as objects by DC (difference of convex) optimization
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
- Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming
- Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
- Fast L1-L2 minimization via a proximal operator
- A proximal difference-of-convex algorithm with extrapolation
- 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
- Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming
- Sum-Rate Maximization in Two-Way AF MIMO Relaying: Polynomial Time Solutions to a Class of DC Programming Problems
Cited In (5)
- A three-operator splitting algorithm with deviations for generalized DC programming
- A unified Bregman alternating minimization algorithm for generalized DC programs with application to imaging
- A revision of the rectangular algorithm for a class of DC optimization problems
- Alternating DC algorithm for partial DC programming problems
- A proximal alternating direction method of multipliers for DC programming with structured constraints
Uses Software
This page was built for publication: A unified Douglas-Rachford algorithm for generalized DC programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2114583)
