RECORD DETAIL


Back To Previous

UPA Perpustakaan Universitas Jember

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

No image available for this title
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 point-wise and ergodic iteration-complexity has been established recently by Monteiro and Svaiter. As applications, we propose and analyze the iteration-complexity of an inex-act operator splitting algorithm—which generalizes the original Spingarn’s splitting method—and of a parallel forward–backward algorithm for multi-term composite convex optimization.

Availability
EB00000003228KAvailable
Detail Information

Series Title

-

Call Number

-

Publisher

: ,

Collation

-

Language

ISBN/ISSN

-

Classification

NONE

Detail Information

Content Type

E-Jurnal

Media Type

-

Carrier Type

-

Edition

-

Specific Detail Info

-

Statement of Responsibility

No other version available
File Attachment