Revisiting linearized Bregman iterations under Lipschitz-like convexity condition
DOI10.1090/MCOM/3792OpenAlexW4295694258MaRDI QIDQ5058656FDOQ5058656
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
Recommendations
regularizationnonconvex minimizationlinear inverse problemBregman distancequadratic inverse problemLipschitz-like convexity conditionKurdyka-Losiajewicz propertylinearized Bregman iterations
Numerical mathematical programming methods (65K05) Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Cites Work
- A Singular Value Thresholding Algorithm for Matrix Completion
- First-Order Methods in Optimization
- Title not available (Why is that?)
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- The linearized Bregman method via split feasibility problems: analysis and generalizations
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Higher-order TV methods -- enhancement via Bregman iteration
- Linearized Bregman iterations for compressed sensing
- Bregmanized nonlocal regularization for deconvolution and sparse reconstruction
- Title not available (Why is that?)
- Title not available (Why is that?)
- Proximal Minimization Methods with Generalized Bregman Functions
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- An Iterative Regularization Method for Total Variation-Based Image Restoration
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Title not available (Why is that?)
- Atomic decomposition by basis pursuit
- Linearized Bregman Iterations for Frame-Based Image Deblurring
- A first order method for finding minimal norm-like solutions of convex optimization problems
- Nonlinear inverse scale space methods
- Analysis and Generalizations of the Linearized Bregman Method
- Convergence of the linearized Bregman iteration for ℓ₁-norm minimization
- Augmented \(\ell_1\) and nuclear-norm models with a globally linearly convergent algorithm
- A dual algorithm for a class of augmented convex signal recovery models
- First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
- Relatively Smooth Convex Optimization by First-Order Methods, and Applications
- A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
- A First Order Method for Solving Convex Bilevel Optimization Problems
- Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
- A simplified view of first order methods for optimization
- Color Bregman TV
- New analysis of linear convergence of gradient-type methods via unifying error bound conditions
- Choose Your Path Wisely: Gradient Descent in a Bregman Distance Framework
Cited In (2)
This page was built for publication: Revisiting linearized Bregman iterations under Lipschitz-like convexity condition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5058656)
