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

Ole Løseth Elvetun () and Bjørn Fredrik Nielsen ()
Additional contact information
Ole Løseth Elvetun: Norwegian University of Life Sciences
Bjørn Fredrik Nielsen: Norwegian University of Life Sciences

Computational Optimization and Applications, 2016, vol. 64, issue 3, No 4, 699-724

Abstract: Abstract We derive an efficient solution method for ill-posed PDE-constrained optimization problems with total variation regularization. This regularization technique allows discontinuous solutions, which is desirable in many applications. Our approach is to adapt the split Bregman technique to handle such PDE-constrained optimization problems. This leads to an iterative scheme where we must solve a linear saddle point problem in each iteration. We prove that the spectra of the corresponding saddle point operators are almost contained in three bounded intervals, not containing zero, with a very limited number of isolated eigenvalues. Krylov subspace methods handle such operators very well and thus provide an efficient algorithm. In fact, we can guarantee that the number of iterations needed cannot grow faster than $$O([\ln (\alpha ^{-1})]^2)$$ O ( [ ln ( α - 1 ) ] 2 ) as $$\alpha \rightarrow 0$$ α → 0 , where $$\alpha $$ α is a small regularization parameter. Moreover, in our numerical experiments we demonstrate that one can expect iteration numbers of order $$O(\ln (\alpha ^{-1}))$$ O ( ln ( α - 1 ) ) .

Keywords: Total variation regularization; PDE-constrained optimization; Bregman algorithm; MINRES; KKT systems (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10589-016-9823-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:64:y:2016:i:3:d:10.1007_s10589-016-9823-3

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-016-9823-3

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().