A unified Bregman alternating minimization algorithm for generalized DC programs with application to imaging

DOI10.1007/s10915-024-02715-xMaRDI QIDQ6639517

Zhiyuan Zhang, Hongjin He

Publication date: 15 November 2024

Published in: Journal of Scientific Computing (Search for Journal in Brave)

zbMATH Keywords

image processingnonconvex optimizationBregman distancefirst-order methodsKurdyka-Łojasiewicz propertyalternating minimization algorithmDC programs

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Numerical methods based on nonlinear programming (49M37)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Nonlinear total variation based noise removal algorithms
• DC approximation approaches for sparse optimization
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Iteration complexity analysis of block coordinate descent methods
• Alternating direction method of multipliers with difference of convex functions
• The ABC of DC programming
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities
• On gradients of functions definable in o-minimal structures
• Error bounds and convergence analysis of feasible descent methods: A general approach
• Asymptotic properties of the Fenchel dual functional and applications to decomposition problems
• Proximal minimization algorithm with \(D\)-functions
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• A simplified view of first order methods for optimization
• From error bounds to the complexity of first-order descent methods for convex functions
• A globally convergent algorithm for nonconvex optimization based on block coordinate update
• A proximal difference-of-convex algorithm with extrapolation
• DC programming and DCA: thirty years of developments
• DC formulations and algorithms for sparse optimization problems
• Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
• Kurdyka-Łojasiewicz property of zero-norm composite functions
• Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
• A unified Douglas-Rachford algorithm for generalized DC programming
• Alternating DC algorithm for partial DC programming problems
• Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
• Kurdyka-Łojasiewicz exponent via inf-projection
• Nonconvex optimization for robust tensor completion from grossly sparse observations
• An inertial algorithm for DC programming
• A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
• A general double-proximal gradient algorithm for d.c. programming
• Coordinate descent algorithms
• 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
• On the maximal monotonicity of subdifferential mappings
• A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
• iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
• Robust principal component analysis?
• A Singular Value Thresholding Algorithm for Matrix Completion
• Matrix completion via an alternating direction method
• Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems
• A Weighted Difference of Anisotropic and Isotropic Total Variation Model for Image Processing
• Deblurring Images
• Clarke Subgradients of Stratifiable Functions
• Convergence of New Inertial Proximal Methods for DC Programming
• Globally convergent block-coordinate techniques for unconstrained optimization
• Variational Analysis
• Bregman Monotone Optimization Algorithms
• First-Order Methods in Optimization
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• Modern Nonconvex Nondifferentiable Optimization
• Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Nonconvex Optimization
• Fixed Point Strategies in Data Science
• First-Order Methods for Nonconvex Quadratic Minimization
• Convergence guarantees for a class of non-convex and non-smooth optimization problems
• The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
• A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
• Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems
• Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
• Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming
• Minimization of $\ell_{1-2}$ for Compressed Sensing
• On the Convergence of Block Coordinate Descent Type Methods
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• Signal Recovery by Proximal Forward-Backward Splitting
• On search directions for minimization algorithms
• Blind Image Deconvolution
• Convergence of a block coordinate descent method for nondifferentiable minimization
• New Bregman proximal type algoritms for solving DC optimization problems
• Principled analyses and design of first-order methods with inexact proximal operators
• Recent Theoretical Advances in Non-Convex Optimization
• Bregman proximal linearized ADMM for minimizing separable sums coupled by a difference of functions

This page was built for publication: A unified Bregman alternating minimization algorithm for generalized DC programs with application to imaging