A unified Douglas-Rachford algorithm for generalized DC programming
type: Item
instance of: scholarly article
title: A unified Douglas-Rachford algorithm for generalized DC programming
zbMATH Open document ID: 1486.90151
author: Chih-Sheng Chuang
author: Hongjin He
author: Zhiyuan Zhang
published in: Journal of Global Optimization
publication date: 2022-03-15T00:00:00Z
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 7489929
zbMATH Keywords: Douglas-Rachford algorithm
zbMATH Keywords: DC programming
zbMATH Keywords: DC algorithm
zbMATH Keywords: alternating direction method of multipliers
zbMATH Keywords: nonconvex optimization
describes a project that uses: UNLocBoX
MaRDI profile type: Publication
full work available at URL: s10898-021-01079-y
OpenAlex ID: W3199330683
cites work: A New Decomposition Method for Multiuser DC-Programming and Its Applications
cites work: Global convergence of a non-convex Douglas-Rachford iteration
cites work: Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
cites work: The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
cites work: Convex analysis and monotone operator theory in Hilbert spaces
cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
cites work: Stable signal recovery from incomplete and inaccurate measurements
cites work: Visualizing data as objects by DC (difference of convex) optimization
cites work: Proximal Splitting Methods in Signal Processing
cites work: A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting
cites work: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
cites work: A note on the Douglas-Rachford splitting method for optimization problems involving hypoconvex functions
cites work: Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming
cites work: A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
cites work: DC programming: overview.
cites work: Non-convex Optimization for Machine Learning
cites work: Sum-Rate Maximization in Two-Way AF MIMO Relaying: Polynomial Time Solutions to a Class of DC Programming Problems
cites work: A continuous approach for the concave cost supply problem via DC programming and DCA
cites work: Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm
cites work: DC programming and DCA: thirty years of developments
cites work: Optimizing a multi-stage production/inventory system by DC programming based approaches
cites work: Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
cites work: Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems
cites work: A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
cites work: Fast L1-L2 minimization via a proximal operator
cites work: A Weighted Difference of Anisotropic and Isotropic Total Variation Model for Image Processing
cites work: Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming
cites work: Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
cites work: Convergence Analysis of the Relaxed Douglas--Rachford Algorithm
cites work: Convergence of generalized proximal point algorithms
cites work: A rank-corrected procedure for matrix completion with fixed basis coefficients
cites work: Convex analysis approach to d. c. programming: Theory, algorithms and applications
cites work: Q3780016
cites work: Alternating direction method of multipliers with difference of convex functions
cites work: Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
cites work: A proximal difference-of-convex algorithm with extrapolation
cites work: Minimization of $\ell_{1-2}$ for Compressed Sensing
DOI: 10.1007/S10898-021-01079-Y
description: scientific article; zbMATH DE number 7489929