An Inexact Spingarn’s Partial Inverse Method with Applications to Operator Splitting and Composite Optimization

We propose and study the iteration-complexity of an inexact version of the Spingarn’s partial inverse method. Its complexity analysis is performed by viewing it in the framework of the hybrid proximal extragradient method, for which pointwise and ergodic iteration-complexity has been established rec...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of optimization theory and applications Jg. 175; H. 3; S. 818 - 847
Hauptverfasser: Alves, Maicon Marques, Lima, Samara Costa
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.12.2017
Springer Nature B.V
Schlagworte:
Applications of Mathematics
Calculus of Variations and Optimal Control; Optimization
Complexity
Computational geometry
Convexity
Engineering
Inverse method
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Splitting
Theory of Computation
Iteration-complexity
Splitting
47J20
Partial inverse method
90C33
Composite optimization
Forward–backward
90C060
65K10
Inexact proximal point methods
Parallel
47H05
ISSN:0022-3239, 1573-2878
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We propose and study the iteration-complexity of an inexact version of the Spingarn’s partial inverse method. Its complexity analysis is performed by viewing it in the framework of the hybrid proximal extragradient method, for which pointwise and ergodic iteration-complexity has been established recently by Monteiro and Svaiter. As applications, we propose and analyze the iteration-complexity of an inexact operator splitting algorithm—which generalizes the original Spingarn’s splitting method—and of a parallel forward–backward algorithm for multi-term composite convex optimization.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0022-3239
1573-2878
DOI:10.1007/s10957-017-1188-y