| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 840256 | Nonlinear Analysis: Theory, Methods & Applications | 2013 | 15 Pages |
Abstract
The notion of quasi-Fejér monotonicity has proven to be an efficient tool to simplify and unify the convergence analysis of various algorithms arising in applied nonlinear analysis. In this paper, we extend this notion in the context of variable metric algorithms, whereby the underlying norm is allowed to vary at each iteration. Applications to convex optimization and inverse problems are demonstrated.
Related Topics
Physical Sciences and Engineering
Engineering
Engineering (General)
Authors
Patrick L. Combettes, Bằng C. Vũ,