Revisiting linearized Bregman iterations under Lipschitz-like convexity condition
From MaRDI portal
(Redirected from Publication:5058656)
Recommendations
Cites work
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 1046019 (Why is no real title available?)
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- scientific article; zbMATH DE number 3082712 (Why is no real title available?)
- A Singular Value Thresholding Algorithm for Matrix Completion
- A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
- A dual algorithm for a class of augmented convex signal recovery models
- A first order method for finding minimal norm-like solutions of convex optimization problems
- A first order method for solving convex bilevel optimization problems
- A simplified view of first order methods for optimization
- An Iterative Regularization Method for Total Variation-Based Image Restoration
- Analysis and generalizations of the linearized Bregman method
- Atomic decomposition by basis pursuit
- Augmented _1 and nuclear-norm models with a globally linearly convergent algorithm
- Bregman Iterative Algorithms for \ell₁-Minimization with Applications to Compressed Sensing
- Bregmanized nonlocal regularization for deconvolution and sparse reconstruction
- Choose your path wisely: gradient descent in a Bregman distance framework
- Color Bregman TV
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Convergence of the linearized Bregman iteration for \(\ell _1\)-norm minimization
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- First-order methods in optimization
- Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
- Higher-order TV methods -- enhancement via Bregman iteration
- Linearized Bregman Iterations for Frame-Based Image Deblurring
- Linearized Bregman iterations for compressed sensing
- New analysis of linear convergence of gradient-type methods via unifying error bound conditions
- Nonlinear inverse scale space methods
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Proximal Minimization Methods with Generalized Bregman Functions
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Relatively smooth convex optimization by first-order methods, and applications
- The linearized Bregman method via split feasibility problems: analysis and generalizations
Cited in
(4)- Alternating block linearized Bregman iterations for regularized nonnegative matrix factorization
- Iterating Bregman Retractions
- Nonlinear preconditioned primal-dual method with projection for nonconvex-nonconcave minimax problems
- Revisiting Linearized Bregman Iterations under Lipschitz-like Convexity Condition
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)
