Choose Your Path Wisely: Gradient Descent in a Bregman Distance Framework
From MaRDI portal
Publication:5860343
DOI10.1137/20M1357500zbMath1480.90197arXiv1712.04045OpenAlexW3163340401MaRDI QIDQ5860343
Carola-Bibiane Schönlieb, Martin Benning, Marta M. Betcke, Matthias J. Ehrhardt
Publication date: 19 November 2021
Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.04045
nonsmooth optimizationnonconvex optimizationblind deconvolutiongradient descentlinearized Bregman iterationdeep learningBregman iterationparallel MRI
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)
Related Items
Modular-Proximal Gradient Algorithms in Variable Exponent Lebesgue Spaces ⋮ Revisiting linearized Bregman iterations under Lipschitz-like convexity condition ⋮ Consistency of Bayesian inference with Gaussian process priors for a parabolic inverse problem ⋮ An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant ⋮ An abstract convergence framework with application to inertial inexact forward-backward methods ⋮ Bregman proximal mappings and Bregman-Moreau envelopes under relative prox-regularity ⋮ Modern regularization methods for inverse problems
Uses Software
Cites Work
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Regularization of ill-posed linear equations by the non-stationary augmented Lagrangian method
- A block coordinate variable metric forward-backward algorithm
- Sparse recovery via differential inclusions
- Error estimation for Bregman iterations and inverse scale space methods in image restoration
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- On gradients of functions definable in o-minimal structures
- Proximal minimization algorithm with \(D\)-functions
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- Iterative regularization via dual diagonal descent
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Accelerated linearized Bregman method
- Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria
- Non-smooth non-convex Bregman minimization: unification and new algorithms
- Nonlinear inverse scale space methods
- Variable Metric Inexact Line-Search-Based Methods for Nonsmooth Optimization
- A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
- iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
- Analysis and Generalizations of the Linearized Bregman Method
- Linearized Bregman iterations for compressed sensing
- Convergence of the linearized Bregman iteration for ℓ₁-norm minimization
- A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
- 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
- Nonlinear iterative methods for linear ill-posed problems in Banach spaces
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- Schwartz Functions on Nash Manifolds
- Iterative methods for nonlinear ill-posed problems in Banach spaces: convergence and applications to parameter identification problems
- Iterative total variation schemes for nonlinear inverse problems
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- On the Goldstein-Levitin-Polyak gradient projection method
- Proximal Minimization Methods with Generalized Bregman Functions
- ESSENTIAL SMOOTHNESS, ESSENTIAL STRICT CONVEXITY, AND LEGENDRE FUNCTIONS IN BANACH SPACES
- First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
- Variational Depth From Focus Reconstruction
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- An adaptive inverse scale space method for compressed sensing
- A primal–dual hybrid gradient method for nonlinear operators with applications to MRI
- Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems
- On the convergence of a linesearch based proximal-gradient method for nonconvex optimization
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Proximité et dualité dans un espace hilbertien
- Convex programming in Hilbert space
- Convex Analysis
- An Iterative Regularization Method for Total Variation-Based Image Restoration
- Image Processing and Analysis
- A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
- An introduction to continuous optimization for imaging
- Convex analysis and monotone operator theory in Hilbert spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
