Alternating direction method of multipliers with difference of convex functions
From MaRDI portal
Publication:723734
DOI10.1007/s10444-017-9559-3zbMath1393.90119OpenAlexW2745841187MaRDI QIDQ723734
Hao Jiang, Penghang Yin, Tao Sun, Li-Zhi Cheng
Publication date: 24 July 2018
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10444-017-9559-3
difference of convex functionsnonconvexalternating direction method of multipliersKurdyka-Łojasiewicz property
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)
Related Items
Nonconvex optimization for robust tensor completion from grossly sparse observations, Bregman reweighted alternating minimization and its application to image deblurring, A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems, Robust Tensor Completion: Equivalent Surrogates, Error Bounds, and Algorithms, A unified Douglas-Rachford algorithm for generalized DC programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- Point source super-resolution via non-convex \(L_1\) based methods
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\)
- Alternating direction augmented Lagrangian methods for semidefinite programming
- An alternating direction algorithm for matrix completion with nonnegative factors
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- On gradients of functions definable in o-minimal structures
- A proximal-based deomposition method for compositions method for convex minimization problems
- On semi- and subanalytic geometry
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- Global convergence of ADMM in nonconvex nonsmooth optimization
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- On the global and linear convergence of the generalized alternating direction method of multipliers
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Solving Constrained Total-variation Image Restoration and Reconstruction Problems via Alternating Direction Methods
- Analysis and Generalizations of the Linearized Bregman Method
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- The Split Bregman Method for L1-Regularized Problems
- A Weighted Difference of Anisotropic and Isotropic Total Variation Model for Image Processing
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- Variational Analysis
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- Variational Analysis and Generalized Differentiation I
- Iterative <em>l</em><sub>1</sub> Minimization for Non-Convex Compressed Sensing
- The Linearized Alternating Direction Method of Multipliers for Dantzig Selector
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- Local Linear Convergence of the Alternating Direction Method of Multipliers on Quadratic or Linear Programs
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- An Iterative Regularization Method for Total Variation-Based Image Restoration
