Bregman methods for large-scale optimization with applications in imaging
From MaRDI portal
Recommendations
- The Split Bregman Method for L1-Regularized Problems
- Bregmanized nonlocal regularization for deconvolution and sparse reconstruction
- Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization
- Analysis and generalizations of the linearized Bregman method
- Bregman Monotone Optimization Algorithms
Cites work
- A Convergent Incremental Gradient Method with a Constant Step Size
- A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
- A differential equation for modeling Nesterov's accelerated gradient method: theory and insights
- A family of variable metric proximal methods
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
- A primal-dual hybrid gradient method for nonlinear operators with applications to MRI
- A simplified view of first order methods for optimization
- A Stochastic Approximation Method
- A unified primal-dual algorithm framework based on Bregman iteration
- Accelerated linearized Bregman method
- Acceleration and global convergence of a first-order primal-dual method for nonconvex problems
- An adaptive inverse scale space method for compressed sensing
- An introduction to continuous optimization for imaging
- An Iterative Regularization Method for Total Variation-Based Image Restoration
- An iterative row-action method for interval convex programming
- Analysis and generalizations of the linearized Bregman method
- Angenäherte Auflösung von Systemen linearer Gleichungen.
- Bilevel optimization with nonsmooth lower level problems
- Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization
- Bregman Distances in Inverse Problems and Partial Differential Equations
- Bregman Iterative Algorithms for \ell₁-Minimization with Applications to Compressed Sensing
- Bregman Itoh-Abe methods for sparse optimisation
- Bregman Monotone Optimization Algorithms
- Convergence analysis for Kaczmarz-type methods in a Hilbert space framework
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Convergence of the linearized Bregman iteration for \(\ell _1\)-norm minimization
- Convergence rates of convex variational regularization
- Coordinate descent algorithms
- Data-driven science and engineering. Machine learning, dynamical systems, and control
- Deep unfolding of a proximal interior point method for image restoration
- Discrete gradient methods for solving variational image regularisation models
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Dual averaging methods for regularized stochastic learning and online optimization
- Enhancing joint reconstruction and segmentation with non-convex Bregman iteration
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- Ergodic mirror descent
- Error estimates for general fidelities
- Error estimates for non-quadratic regularization and the relation to enhancement
- Error estimation for Bregman iterations and inverse scale space methods in image restoration
- 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
- Geometric integration using discrete gradients
- Geometric Numerical Integration
- Global convergence of splitting methods for nonconvex composite optimization
- Hamiltonian-conserving discrete canonical equations based on variational difference quotients
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 1796939 (Why is no real title available?)
- scientific article; zbMATH DE number 3281217 (Why is no real title available?)
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- scientific article; zbMATH DE number 3366440 (Why is no real title available?)
- scientific article; zbMATH DE number 3023295 (Why is no real title available?)
- Incremental proximal methods for large scale convex optimization
- Inertial variable metric techniques for the inexact forward-backward algorithm
- Inverse Total Variation Flow
- iPiano: inertial proximal algorithm for nonconvex optimization
- Iterative regularization via dual diagonal descent
- Iterative total variation schemes for nonlinear inverse problems
- Linear convergence of the randomized sparse Kaczmarz method
- Linearized Bregman iterations for compressed sensing
- Linearized Bregman Iterations for Frame-Based Image Deblurring
- Minimizing finite sums with the stochastic average gradient
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Modern regularization methods for inverse problems
- NETT: solving inverse problems with deep neural networks
- Neue Begründung der Theorie quadratischer Formen von unendlichvielen Veränderlichen.
- Nonlinear inverse scale space methods
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Nonlinear spectral analysis via one-homogeneous functionals: overview and future prospects
- On Nesterov acceleration for Landweber iteration of linear ill-posed problems
- On the convergence of block coordinate descent type methods
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- On the convexity of higher order Jensen differences based on entropy functions (Corresp.)
- On the convexity of some divergence measures based on entropy functions
- On the equivalence between SOR-type methods for linear systems and the discrete gradient methods for gradient systems
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Primal-dual extragradient methods for nonlinear nonsmooth PDE-constrained optimization
- Primal-dual subgradient methods for convex problems
- Proximal minimization algorithm with \(D\)-functions
- Proximal Minimization Methods with Generalized Bregman Functions
- Proximité et dualité dans un espace hilbertien
- Randomized iterative methods for linear systems
- Regularization methods in Banach spaces.
- Regularization of linear least squares problems by total bounded variation
- Robust Stochastic Approximation Approach to Stochastic Programming
- Six lectures on the geometric integration of ODEs
- Solving inverse problems using data-driven models
- Spectral decompositions using one-homogeneous functionals
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications
- The Burbea-Rao and Bhattacharyya Centroids
- The linearized Bregman method via split feasibility problems: analysis and generalizations
- The ordered subsets mirror descent optimization method with applications to tomography
- The Primal-Dual Hybrid Gradient Method for Semiconvex Splittings
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- Variable metric forward-backward splitting with applications to monotone inclusions in duality
- Variational Analysis in Sobolev and BV Spaces
- Variational Depth From Focus Reconstruction
- Variational image regularization with Euler's elastica using a discrete gradient scheme
Cited in
(1)
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)
