Bregman methods for large-scale optimization with applications in imaging
From MaRDI portal
Publication:6606442
DOI10.1007/978-3-030-98661-2_62zbMATH Open1547.90151MaRDI QIDQ6606442
Martin Benning, Erlend S. Riis
Publication date: 16 September 2024
Could not fetch data.
Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Cites Work
- Bregman Distances in Inverse Problems and Partial Differential Equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Primal-dual subgradient methods for convex problems
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Nonlinear spectral analysis via one-homogeneous functionals: overview and future prospects
- Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization
- Regularization methods in Banach spaces.
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- Minimizing finite sums with the stochastic average gradient
- A unified primal-dual algorithm framework based on Bregman iteration
- Incremental proximal methods for large scale convex optimization
- Error estimation for Bregman iterations and inverse scale space methods in image restoration
- Hamiltonian-conserving discrete canonical equations based on variational difference quotients
- An iterative row-action method for interval convex programming
- Proximal minimization algorithm with \(D\)-functions
- Neue Begründung der Theorie quadratischer Formen von unendlichvielen Veränderlichen.
- On the equivalence between SOR-type methods for linear systems and the discrete gradient methods for gradient systems
- A simplified view of first order methods for optimization
- Iterative regularization via dual diagonal descent
- Linear convergence of the randomized sparse Kaczmarz method
- A family of variable metric proximal methods
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Accelerated linearized Bregman method
- Bregman Itoh-Abe methods for sparse optimisation
- Convergence analysis for Kaczmarz-type methods in a Hilbert space framework
- Coordinate descent algorithms
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- On Nesterov acceleration for Landweber iteration of linear ill-posed problems
- Error estimates for general fidelities
- Nonlinear inverse scale space methods
- Angenäherte Auflösung von Systemen linearer Gleichungen.
- Six lectures on the geometric integration of ODEs
- The ordered subsets mirror descent optimization method with applications to tomography
- A differential equation for modeling Nesterov's accelerated gradient method: theory and insights
- The Linearized Bregman Method via Split Feasibility Problems: Analysis and Generalizations
- iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
- Variational Analysis in Sobolev and BV Spaces
- 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
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Spectral Decompositions Using One-Homogeneous Functionals
- Linearized Bregman Iterations for Frame-Based Image Deblurring
- Bilevel Optimization with Nonsmooth Lower Level Problems
- Randomized Iterative Methods for Linear Systems
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- Inverse Total Variation Flow
- Iterative total variation schemes for nonlinear inverse problems
- Robust Stochastic Approximation Approach to Stochastic Programming
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- On the convexity of some divergence measures based on entropy functions
- On the convexity of higher order Jensen differences based on entropy functions (Corresp.)
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- Geometric integration using discrete gradients
- Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
- Proximal Minimization Methods with Generalized Bregman Functions
- Regularization of linear least squares problems by total bounded variation
- Bregman Monotone Optimization Algorithms
- First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
- First-Order Methods in Optimization
- Variational Depth From Focus Reconstruction
- Acceleration and Global Convergence of a First-Order Primal-Dual Method for Nonconvex Problems
- Data-Driven Science and Engineering
- Convergence rates of convex variational regularization
- Inertial Variable Metric Techniques for the Inexact Forward--Backward Algorithm
- Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- An adaptive inverse scale space method for compressed sensing
- Ergodic Mirror Descent
- A primal–dual hybrid gradient method for nonlinear operators with applications to MRI
- NETT: solving inverse problems with deep neural networks
- Deep unfolding of a proximal interior point method for image restoration
- Modern regularization methods for inverse problems
- Solving inverse problems using data-driven models
- Variational Image Regularization with Euler's Elastica Using a Discrete Gradient Scheme
- The Primal-Dual Hybrid Gradient Method for Semiconvex Splittings
- The Burbea-Rao and Bhattacharyya Centroids
- Primal-Dual Extragradient Methods for Nonlinear Nonsmooth PDE-Constrained Optimization
- Discrete gradient methods for solving variational image regularisation models
- Enhancing joint reconstruction and segmentation with non-convex Bregman iteration
- On the Convergence of Block Coordinate Descent Type Methods
- A Convergent Incremental Gradient Method with a Constant Step Size
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Geometric Numerical Integration
- Error estimates for non-quadratic regularization and the relation to enhancement
- Variable metric forward–backward splitting with applications to monotone inclusions in duality
- Proximité et dualité dans un espace hilbertien
- An Iterative Regularization Method for Total Variation-Based Image Restoration
- A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
- An introduction to continuous optimization for imaging
- A Stochastic Approximation Method
This page was built for publication: Bregman methods for large-scale optimization with applications in imaging
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606442)