A unified Douglas-Rachford algorithm for generalized DC programming
From MaRDI portal
Publication:2114583
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
Cites work
- scientific article; zbMATH DE number 4041643 (Why is no real title available?)
- A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting
- A New Decomposition Method for Multiuser DC-Programming and Its Applications
- A continuous approach for the concave cost supply problem via DC programming and DCA
- A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
- A note on the Douglas-Rachford splitting method for optimization problems involving hypoconvex functions
- A proximal difference-of-convex algorithm with extrapolation
- A rank-corrected procedure for matrix completion with fixed basis coefficients
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
- A weighted difference of anisotropic and isotropic total variation model for image processing
- Alternating direction method of multipliers with difference of convex functions
- Convergence Analysis of the Relaxed Douglas--Rachford Algorithm
- Convergence analysis of Douglas-Rachford splitting method for ``strongly + weakly convex programming
- Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems
- Convergence of generalized proximal point algorithms
- Convex analysis and monotone operator theory in Hilbert spaces
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC programming and DCA: thirty years of developments
- DC programming: overview.
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
- Fast L1-L2 minimization via a proximal operator
- Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm
- Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
- Global convergence of a non-convex Douglas-Rachford iteration
- Minimization of \(\ell_{1-2}\) for compressed sensing
- Non-convex optimization for machine learning
- Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Optimizing a multi-stage production/inventory system by DC programming based approaches
- Proximal splitting methods in signal processing
- Stable signal recovery from incomplete and inaccurate measurements
- Sum-Rate Maximization in Two-Way AF MIMO Relaying: Polynomial Time Solutions to a Class of DC Programming Problems
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
- Visualizing data as objects by DC (difference of convex) optimization
Cited in
(14)- Doubly relaxed forward-Douglas-Rachford splitting for the sum of two nonconvex and a DC function
- A forward-backward algorithm for the DC programming in Hilbert spaces
- New Douglas-Rashford splitting algorithms for generalized DC programming with applications in machine learning
- A three-operator splitting algorithm with deviations for generalized DC programming
- An inertial Bregman proximal DC algorithm for generalized DC programming with application to data completion
- An extragradient method 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
- A proximal splitting algorithm for generalized DC programming with applications in signal recovery
- A multi-step inertial extragradient algorithm for nonsmooth and nonconvex composite optimization problems
- Alternating DC algorithm for partial DC programming problems
- Three operator splitting algorithms for solving nonsmooth DC programming problems
- A multi-step inertial Bregman proximal DC algorithm and its application to solving some inverse problems
- A proximal alternating direction method of multipliers for DC programming with structured constraints
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)
