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

Cites Work

Unnamed Item
Discovering governing equations from data by sparse identification of nonlinear dynamical systems
An implementable splitting algorithm for the $\ell_1$-norm regularized split feasibility problem
Point source super-resolution via non-convex $L_1$ based methods
Proximal alternating linearized minimization for nonconvex and nonsmooth problems
Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem
Computing sparse representation in a highly coherent dictionary based on difference of $L_1$ and $L_2$
Alternating direction method of multipliers with difference of convex functions
The ABC of DC programming
A multiprojection algorithm using Bregman projections in a product space
Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
$l_1$-$l_2$ regularization of split feasibility problems
Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
Global convergence of ADMM in nonconvex nonsmooth optimization
Fast L1-L2 minimization via a proximal operator
A proximal difference-of-convex algorithm with extrapolation
DC programming and DCA: thirty years of developments
Accelerating the DC algorithm for smooth functions
DC formulations and algorithms for sparse optimization problems
A note on approximating curve with 1-norm regularization method for the split feasibility problem
A unified Douglas-Rachford algorithm for generalized DC programming
A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems
PhaseLiftOff: an accurate and stable phase retrieval method based on difference of trace and Frobenius norms
Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
The Dantzig selector: statistical estimation when $p$ is much larger than $n$. (With discussions and rejoinder).
Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization
Functional Analysis, Calculus of Variations and Optimal Control
Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
A Weighted Difference of Anisotropic and Isotropic Total Variation Model for Image Processing
Variational Analysis
First-Order Methods in Optimization
Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
Learning partial differential equations via data discovery and sparse optimization
Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
The Dantzig selector: recovery of signal via ℓ ₁ − αℓ ₂ minimization
The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates
Extracting Structured Dynamical Systems Using Sparse Optimization With Very Few Samples
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
Splitting methods for split feasibility problems with application to Dantzig selectors
Signal Recovery by Proximal Forward-Backward Splitting
Convex Analysis
New Restricted Isometry Property Analysis for $\ell_1-\ell_2$ Minimization Methods
Convex analysis and monotone operator theory in Hilbert spaces
New Bregman proximal type algoritms for solving DC optimization problems
Structured model selection via ℓ1−ℓ2 optimization

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