Bregman ADMM: a new algorithm for nonconvex optimization with linear constraints

DOI10.23952/JNVA.9.2025.2.02MaRDI QIDQ7023402zbMATH OpenFDO

Authors Li Tan, Ke Guo

Publication date 21 February 2025

Published in Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.23952/JNVA.9.2025.2.02

zbMATH Keywords

alternating direction method of multipliersBregman ADMMKurdyka-Łojasiewicz inequalityLipschitz-like convexity conditionnonconvex optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Cites work

• A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• A Nonlinear Alternating Direction Method
• Alternating direction method of multipliers based on \(\ell_{2,0}\)-norm for multiple measurement vector problem
• Alternating direction method of multipliers for real and complex polynomial optimization models
• An alternating direction algorithm for matrix completion with nonnegative factors
• Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
• Bregman Monotone Optimization Algorithms
• Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems
• 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
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
• Geometric applications of the split Bregman method: segmentation and surface reconstruction
• Global convergence of splitting methods for nonconvex composite optimization
• scientific article; zbMATH DE number 996056 (Why is no real title available?)
• scientific article; zbMATH DE number 45081 (Why is no real title available?)
• scientific article; zbMATH DE number 3574917 (Why is no real title available?)
• scientific article; zbMATH DE number 3296905 (Why is no real title available?)
• Implementable tensor methods in unconstrained convex optimization
• Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
• Local linear convergence of the alternating direction method of multipliers on quadratic or linear programs
• On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
• 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
• Restoration of Poissonian Images Using Alternating Direction Optimization

This page was built for publication: Bregman ADMM: a new algorithm for nonconvex optimization with linear constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7023402)