A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems
Publication:2307744
DOI10.1007/S10898-019-00828-4zbMATH Open1448.90088OpenAlexW2971289269WikidataQ127315307 ScholiaQ127315307MaRDI QIDQ2307744FDOQ2307744
Hai-Bin Zhang, Kai Tu, Jun-Kai Feng, Huan Gao
Publication date: 25 March 2020
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-019-00828-4
alternating direction method of multipliersBregman distancelinearly constrained difference-of-convex problemsKurdyka-ลojasiewicz function
Cites Work
- Title not available (Why is that?)
- NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Nonlinear total variation based noise removal algorithms
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Variational Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Introductory lectures on convex optimization. A basic course.
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Some sharp performance bounds for least squares regression with \(L_1\) regularization
- A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move
- Convergence of New Inertial Proximal Methods for DC Programming
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- Deblurring Images
- Convergence analysis of tight framelet approach for missing data recovery
- An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
- Minimization of non-smooth, non-convex functionals by iterative thresholding
- A new efficient algorithm based on DC programming and DCA for clustering
- Frรฉchet subdifferential calculus and optimality conditions in nondifferentiable programming
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A Weighted Difference of Anisotropic and Isotropic Total Variation Model for Image Processing
- Point source super-resolution via non-convex \(L_1\) based methods
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- A proximal point algorithm for DC functions on Hadamard manifolds
- Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms
- Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction
- Convergence rate bounds for a proximal ADMM with over-relaxation stepsize parameter for solving nonconvex linearly constrained problems
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- Alternating direction method of multipliers with difference of convex functions
- Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM
- A general double-proximal gradient algorithm for d.c. programming
- DC formulations and algorithms for sparse optimization problems
- Adaptive correction procedure for TVL1 image deblurring under impulse noise
- Parallel Algorithms for Constrained Tensor Factorization via Alternating Direction Method of Multipliers
- Fast L1-L2 minimization via a proximal operator
- A proximal difference-of-convex algorithm with extrapolation
- A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique
- A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
- Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
- The linearized alternating direction method of multipliers for sparse group LAD model
Cited In (7)
- New Bregman proximal type algoritms for solving DC optimization problems
- Splitting augmented Lagrangian-type algorithms with partial quadratic approximation to solve sparse signal recovery problems
- A three-operator splitting algorithm with deviations for generalized DC programming
- Bregman proximal linearized ADMM for minimizing separable sums coupled by a difference of functions
- Difference of convex algorithms for bilevel programs with applications in hyperparameter selection
- A proximal alternating direction method of multipliers for DC programming with structured constraints
- An inertial Bregman generalized alternating direction method of multipliers for nonconvex optimization
Uses Software
Recommendations
- On the linear convergence of the alternating direction method of multipliers ๐ ๐
- A Proximal Alternating Direction Method of Multiplier for Linearly Constrained Nonconvex Minimization ๐ ๐
- A homotopy alternating direction method of multipliers for linearly constrained separable convex optimization ๐ ๐
- A new alternating direction method for linearly constrained nonconvex optimization problems ๐ ๐
- Linear convergence of the alternating direction method of multipliers for a class of convex optimization problems ๐ ๐
- Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications ๐ ๐
- Optimally linearizing the alternating direction method of multipliers for convex programming ๐ ๐
- Alternating direction method of multipliers with difference of convex functions ๐ ๐
- A Bregman-style partially symmetric alternating direction method of multipliers for nonconvex multi-block optimization ๐ ๐
- A regularized alternating direction method of multipliers for a class of nonconvex problems ๐ ๐
This page was built for publication: A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2307744)