Summary: University of California,
Santa Barbara
Senior Thesis
Bregman Algorithms
Author:
Jacqueline Bush
Supervisor:
Dr. Carlos
Garc´ia-Cervera
June 10, 2011
Acknowledgments
I could not have done this without the help and support of my advisor
Dr. Carlos Garcia-Cervera.
i
Abstract
In this paper we investigate methods for solving the Basis Pursuit problem and
the Total Variation denoising problem. The methods studied here are based on
the Bregman iterative regularization, and efficient algorithm for convex, con-
straint optimization problems. We study two different versions of the original
Bregman iterative algorithm: the Linearized Bregman algorithm, and the Split

Source: Akhmedov, Azer - Department of Mathematics, University of California at Santa Barbara

Collections: Mathematics