The split Bregman algorithm applied to PDE-constrained optimization problems with total variation regularization

DOI10.1007/S10589-016-9823-3MaRDI QIDQ301680zbMATHOpenAlexFDO

Authors Ole Løseth Elvetun, Bjørn Fredrik Nielsen

Publication date 1 July 2016

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10589-016-9823-3

zbMATH Keywords

total variation regularizationPDE-constrained optimizationBregman algorithmKKT systemsMINRES

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• The Split Bregman Method for L1-Regularized Problems
• The linearized Bregman method via split feasibility problems: analysis and generalizations
• Regularized methods for the split feasibility problem
• New iterative regularization methods for solving split variational inclusion problems
• The conjugate gradient method for split variational inclusion and constrained convex minimization problems
• Preconditioning for PDE-constrained optimization with total variation regularization
• A regularized algorithm for the proximal split feasibility problem
• A split variational inequality problem and its convergence algorithm
• An application of splitting methods to convex partially separable optimization problems

Cites work

• scientific article; zbMATH DE number 3296905 (Why is no real title available?)
• scientific article; zbMATH DE number 3331230 (Why is no real title available?)
• A new approximation of the Schur complement in preconditioners for PDE-constrained optimization.
• A robust multigrid method for elliptic optimal control problems
• An Infeasible Primal-Dual Algorithm for Total Bounded Variation--Based Inf-Convolution-Type Image Restoration
• An Iterative Regularization Method for Total Variation-Based Image Restoration
• Analysis of bounded variation penalty methods for ill-posed problems
• Analysis of the Minimal Residual Method Applied to Ill Posed Optimality Systems
• Augmented Lagrangian method, dual methods, and split Bregman iteration for ROF, vectorial TV, and high order models
• Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
• Multiplier and gradient methods
• Preconditioning discretizations of systems of partial differential equations.
• Regularization of linear least squares problems by total bounded variation
• Split Bregman methods and frame based image restoration
• Symmetric Indefinite Preconditioners for Saddle Point Problems with Applications to PDE-Constrained Optimization Problems
• The Split Bregman Method for L1-Regularized Problems
• Total Bounded Variation Regularization as a Bilaterally Constrained Optimization Problem

Cited in

(4)

• Preconditioning for PDE-constrained optimization with total variation regularization
• An FE-inexact heterogeneous ADMM for elliptic optimal control problems with \(L^1\)-control cost
• Split Bregman algorithms for multiple measurement vector problem
• A path-following inexact Newton method for PDE-constrained optimal control in BV

This page was built for publication: The split Bregman algorithm applied to PDE-constrained optimization problems with total variation regularization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q301680)