Bregman proximal linearized ADMM for minimizing separable sums coupled by a difference of functions
DOI10.1007/s10957-024-02539-7MaRDI QIDQ6644253
Minh N. Dao, Tan Nhat Pham, N. Sultanova, A. C. Eberhard
Publication date: 27 November 2024
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
linearizationnonconvex optimizationlinear constraintssplitting algorithmBregman distancealternating direction method of multipliers (ADMM)composite optimization problemdifference of functionsmulti-block structure
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Decomposition methods (49M27)
Cites Work
- Unnamed Item
- Unnamed Item
- Lectures on convex optimization
- Alternating direction method of multipliers with difference of convex functions
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- On gradients of functions definable in o-minimal structures
- Global convergence of unmodified 3-block ADMM for a class of convex minimization problems
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Fast L1-L2 minimization via a proximal operator
- Multi-block nonconvex nonsmooth proximal ADMM: convergence and rates under Kurdyka-Łojasiewicz property
- A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems
- Convergence analysis of a proximal point algorithm for minimizing differences of functions
- A Singular Value Thresholding Algorithm for Matrix Completion
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- Matrix Nearness Problems with Bregman Divergences
- Variational Analysis
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction
- An Iterative Regularization Method for Total Variation-Based Image Restoration
- Median filtering‐based methods for static background extraction from surveillance video
- Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs
- A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems
- Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems
- An inertial proximal splitting method with applications
Related Items (1)
This page was built for publication: Bregman proximal linearized ADMM for minimizing separable sums coupled by a difference of functions
