Revisiting linearized Bregman iterations under Lipschitz-like convexity condition
DOI10.1090/mcom/3792OpenAlexW4295694258MaRDI QIDQ5058656
Haoxing Yang, Lu Zhang, Hui Zhang
Publication date: 21 December 2022
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.02109
regularizationnonconvex minimizationlinear inverse problemBregman distancequadratic inverse problemLipschitz-like convexity conditionKurdyka-Losiajewicz propertylinearized Bregman iterations
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- A first order method for finding minimal norm-like solutions of convex optimization problems
- A simplified view of first order methods for optimization
- Higher-order TV methods -- enhancement via Bregman iteration
- A dual algorithm for a class of augmented convex signal recovery models
- New analysis of linear convergence of gradient-type methods via unifying error bound conditions
- Nonlinear inverse scale space methods
- Atomic Decomposition by Basis Pursuit
- Augmented $\ell_1$ and Nuclear-Norm Models with a Globally Linearly Convergent Algorithm
- The Linearized Bregman Method via Split Feasibility Problems: Analysis and Generalizations
- Analysis and Generalizations of the Linearized Bregman Method
- Linearized Bregman iterations for compressed sensing
- Convergence of the linearized Bregman iteration for ℓ₁-norm minimization
- A Singular Value Thresholding Algorithm for Matrix Completion
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Linearized Bregman Iterations for Frame-Based Image Deblurring
- Bregmanized Nonlocal Regularization for Deconvolution and Sparse Reconstruction
- Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
- Proximal Minimization Methods with Generalized Bregman Functions
- First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
- First-Order Methods in Optimization
- Relatively Smooth Convex Optimization by First-Order Methods, and Applications
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Color Bregman TV
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- An Iterative Regularization Method for Total Variation-Based Image Restoration
- A First Order Method for Solving Convex Bilevel Optimization Problems
- A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
- Choose Your Path Wisely: Gradient Descent in a Bregman Distance Framework
This page was built for publication: Revisiting linearized Bregman iterations under Lipschitz-like convexity condition
