Live briefing
Everything about Bregman method
Iterative optimization algorithm
The Bregman method is an iterative algorithm to solve certain convex optimization problems involving regularization. The original version is due to Lev M. Bregman, who published it in 1967. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Bregman methodA 5-minute orientation
- Skim a recent paper: USB-Net: Unfolding Split Bregman Method With Multi-Phase Feature Integration for Compressive ImagingInfluential work since 2022
- Pick up a classic book: Bringing systems thinking to lifeThe most-reprinted book on the subject
- Read the landmark paper: The Split Bregman Method for L1-Regularized ProblemsCited 3,685 times
- Go sideways: Augmented Lagrangian methodA closely related topic
- Go sideways: Total variation denoisingA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
The Split Bregman Method for L1-Regularized Problems
Analysis and Generalizations of the Linearized Bregman Method
Split Bregman method for large scale fused Lasso
Adaptive total variation-based spectral deconvolution with the split Bregman method
Fluorescence diffuse optical tomography using the split Bregman method
Accelerated Linearized Bregman Method
Modified extragradient method with Bregman distance for variational inequalities
Bregman Extragradient Method with Monotone Rule of Step Adjustment*
🆕 Influential since 2022
USB-Net: Unfolding Split Bregman Method With Multi-Phase Feature Integration for Compressive Imaging
Gradient regularization of Newton method with Bregman distances
Bregman Three-Operator Splitting Methods
Convergence of Bregman Peaceman–Rachford Splitting Method for Nonconvex Nonseparable Optimization
A Surrogate Hyperplane Bregman–Kaczmarz Method for Solving Linear Inverse Problems
📚 Books worth reading
Bringing systems thinking to lifeOna Cohn Bregman · 2010
Developmental disabilities from childhood to adulthoodRoxanne Dryden-Edwards · 2010
Scale Space and Variational Methods in Computer VisionArjan Kuijper · 2013- 📕Cardiopulmonary bypassPierre A. Casthely, David Bregman · 1991
- 📕Grafy v zadachakh upravlenii͡a︡ proizvodstvomVladimir Ilʹich Bregman · 1974
- 📕Agendas for the study of midrash in the twenty-first centuryMarc Lee Raphael · 1999
System modelling and optimizationIFIP TC7 Conference on System Modelling and Optimization (17th 1995 Prague, Czech Republic) · 1996
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Augmented Lagrangian method Augmented Lagrangian methods are a certain class of algorithms for solving constrained optimization problems. They have similarities to penalty methods…
- Total variation denoising In signal processing, particularly image processing, total variation denoising, also known as total variation regularization or total variation filtering…
- Proximal gradient method Proximal gradient methods are a generalized form of projection used to solve non-differentiable convex optimization problems. Many interesting problems…
- Regularization (mathematics) In mathematics, statistics, finance, and computer science, particularly in machine learning and inverse problems, regularization is a process that converts…
- Regularized least squares Regularized least squares (RLS) is a family of methods for solving the least-squares problem while using regularization to further constrain the resulting…
- Proximal gradient methods for learning Proximal gradient (forward backward splitting) methods for learning is an area of research in optimization and statistical learning theory which studies…
- Limited-memory BFGS Limited-memory BFGS (L-BFGS or LM-BFGS) is an optimization algorithm in the collection of quasi-Newton methods that approximates the Broyden–Fletcher–Goldfarb–S…
- Chambolle–Pock algorithm In mathematics, the Chambolle–Pock algorithm is an algorithm used to solve convex optimization problems. It was introduced by Antonin Chambolle and Thomas…