Variable metric quasi-Fejér monotonicity

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 allo...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Nonlinear analysis Jg. 78; S. 17 - 31
Hauptverfasser:	Combettes, Patrick L., Vũ, Bằng C.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Ltd 01.02.2013 Elsevier
Schlagworte:	Algorithms Convergence Convex feasibility problem Convex optimization Hilbert space Inverse problems Mathematics Nonlinearity Norms Optimization Optimization and Control Proximal Landweber method Proximal point algorithm Quasi-Fejér sequence Variable metric Proximal Landweber method 65J05 Convex feasibility problem Inverse problems 90C25 Convex optimization 47H09 Variable metric Hilbert space Quasi-Fejér sequence Proximal point algorithm quasi-Fejér sequence inverse problems convex optimization convex feasibility problem proximal Landweber method proximal point algorithm variable metric Mathematics Subject Classifications 65J05
ISSN:	0362-546X, 1873-5215
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!