A proximal alternating direction method of multipliers for DC programming with structured constraints

Recommendations

Alternating direction method of multipliers with difference of convex functions
A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems
A proximal point algorithm revisit on the alternating direction method of multipliers
A linearized alternating direction method of multipliers with substitution procedure
Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming

Cites work

$l_1$-$l_2$ regularization of split feasibility problems
A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems
A multiprojection algorithm using Bregman projections in a product space
A note on approximating curve with 1-norm regularization method for the split feasibility problem
A proximal difference-of-convex algorithm with extrapolation
A unified Douglas-Rachford algorithm for generalized DC programming
A weighted difference of anisotropic and isotropic total variation model for image processing
Accelerating the DC algorithm for smooth functions
Alternating direction method of multipliers with difference of convex functions
Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
An implementable splitting algorithm for the _1-norm regularized split feasibility problem
Computing sparse representation in a highly coherent dictionary based on difference of L₁ and L₂
Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems
Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
Convex Analysis
Convex analysis and monotone operator theory in Hilbert spaces
DC formulations and algorithms for sparse optimization problems
DC programming and DCA: thirty years of developments
Discovering governing equations from data by sparse identification of nonlinear dynamical systems
Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
Extracting Structured Dynamical Systems Using Sparse Optimization With Very Few Samples
Fast L1-L2 minimization via a proximal operator
First-order methods in optimization
Functional analysis, calculus of variations and optimal control
Global convergence of ADMM in nonconvex nonsmooth optimization
scientific article; zbMATH DE number 4041643 (Why is no real title available?)
Learning partial differential equations via data discovery and sparse optimization
Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
Minimization of $\ell_{1-2}$ for compressed sensing
New Bregman proximal type algoritms for solving DC optimization problems
New restricted isometry property analysis for $\ell_1-\ell_2$ minimization methods
Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
PhaseLiftOff: an accurate and stable phase retrieval method based on difference of trace and Frobenius norms
Point source super-resolution via non-convex $L_1$ based methods
Proximal alternating linearized minimization for nonconvex and nonsmooth problems
Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem
Signal Recovery by Proximal Forward-Backward Splitting
Splitting methods for split feasibility problems with application to Dantzig selectors
Structured model selection via ℓ1−ℓ2 optimization
Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
The ABC of DC programming
The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
The Dantzig selector: recovery of signal via ℓ ₁ − αℓ ₂ minimization
The Dantzig selector: statistical estimation when $p$ is much larger than $n$. (With discussions and rejoinder).
The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates
Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization
Variational Analysis

Cited in

(5)

General inertial proximal DC algorithm for three block nonsmooth DC optimization problems
A multi-step inertial Bregman proximal DC algorithm and its application to solving some inverse problems
A relaxed alternating direction method of multipliers for separable nonconvex minimization problems
An extragradient method for generalized DC programming
Dynamic mode decomposition via difference-of-convex principal component analysis

This page was built for publication: A proximal alternating direction method of multipliers for DC programming with structured constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536834)