Regularized HPE-type methods for solving monotone inclusions with improved pointwise iteration-complexity bounds
Maicon Marques Alves(maicon.alvesufsc.br)
Abstract: This paper studies the iteration-complexity of new regularized hybrid proximal extragradient (HPE)-type methods for solving monotone inclusion problems (MIPs). The new (regularized HPE-type) methods essentially consist of instances of the standard HPE method applied to regularizations of the original MIP. It is shown that its pointwise iteration-complexity considerably improves the one of the HPE method while approaches (up to a logarithmic factor) the ergodic iteration-complexity of the latter method.
Keywords: proximal point methods, hybrid proximal extragradient method, pointwise iterationcomplexity, ergodic iteration-complexity, Tseng’s MFBS method, Korpelevich’s extragradient method.
Category 1: Convex and Nonsmooth Optimization
Entry Submitted: 09/08/2015
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|