DeepAI AI Chat
Log In Sign Up

The Linearized Bregman Method via Split Feasibility Problems: Analysis and Generalizations

by   Dirk A. Lorenz, et al.

The linearized Bregman method is a method to calculate sparse solutions to systems of linear equations. We formulate this problem as a split feasibility problem, propose an algorithmic framework based on Bregman projections and prove a general convergence result for this framework. Convergence of the linearized Bregman method will be obtained as a special case. Our approach also allows for several generalizations such as other objective functions, incremental iterations, incorporation of non-gaussian noise models or box constraints.


page 21

page 22

page 23

page 25


Convergence and Semi-convergence of a class of constrained block iterative methods

In this paper, we analyze the convergence projected non-stationary bloc...

A Bregman-Kaczmarz method for nonlinear systems of equations

We propose a new randomized method for solving systems of nonlinear equa...

Statistical Multiresolution Dantzig Estimation in Imaging: Fundamental Concepts and Algorithmic Framework

In this paper we are concerned with fully automatic and locally adaptive...

The Orthogonal 2D Planes Split of Quaternions and Steerable Quaternion Fourier Transformations

The two-sided quaternionic Fourier transformation (QFT) was introduced i...

Split-Correctness in Information Extraction

Programs for extracting structured information from text, namely informa...