A unified primal-dual algorithm framework based on Bregman iteration (Q639393): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10915-010-9408-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2016910236 / rank | |||
Normal rank | |||
Revision as of 02:21, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A unified primal-dual algorithm framework based on Bregman iteration |
scientific article |
Statements
A unified primal-dual algorithm framework based on Bregman iteration (English)
0 references
20 September 2011
0 references
The goal of the paper is to propose a unified primal-dual algorithm framework for two classes of convex optimization problems arising from various signal and image processing applications. The convergence of the general algorithm framework is proved under mild assumption. Numerical examples show the algorithms proposed are easy to implement, efficient, stable and flexible enough to cover a wide variety of applications.
0 references
saddle point
0 references
Bregman iteration
0 references
\(\ell ^{1}\) minimization
0 references
inexact Uzawa methods
0 references
proximal point iteration
0 references
