On the Complexity of the Projective Splitting and Spingarn’s Methods for the Sum of Two Maximal Monotone Operators

Majela Pentón Machado ()
Additional contact information
Majela Pentón Machado: IMPA

Journal of Optimization Theory and Applications, 2018, vol. 178, issue 1, No 9, 153-190

Abstract: Abstract In this work, we study the pointwise and ergodic iteration complexity of a family of projective splitting methods proposed by Eckstein and Svaiter, for finding a zero of the sum of two maximal monotone operators. As a consequence of the complexity analysis of the projective splitting methods, we obtain complexity bounds for the two-operator case of Spingarn’s partial inverse method. We also present inexact variants of two specific instances of this family of algorithms and derive corresponding convergence rate results.

Keywords: Splitting algorithms; Maximal monotone operators; Complexity; Spingarn’s method; 47H05; 49M27; 90C60; 65K05 (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10957-018-1310-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:178:y:2018:i:1:d:10.1007_s10957-018-1310-9

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-018-1310-9

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().