Convergence of Bregman ADMM for solving multi-block nonconvex separable optimization problems
From MaRDI portal
Cites work
- A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
- Alternating direction method of multipliers for a class of nonconvex and nonsmooth problems with applications to background/foreground extraction
- Alternating direction methods for classical and ptychographic phase retrieval
- Bregman ADMM: a new algorithm for nonconvex optimization with linear constraints
- Bregman Monotone Optimization Algorithms
- Convergence of ADMM for multi-block nonconvex separable optimization models
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- First-order methods in optimization
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- Implementable tensor methods in unconstrained convex optimization
- Latent variable graphical model selection via convex optimization
- Node-based learning of multiple Gaussian graphical models
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- 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
- Quartic first-order methods for low-rank minimization
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- Variational Analysis
This page was built for publication: Convergence of Bregman ADMM for solving multi-block nonconvex separable optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7295451)
