Extragradient Method in Optimization: Convergence and Complexity

Trong Phong Nguyen (), Edouard Pauwels (), Emile Richard () and Bruce W. Suter ()
Additional contact information
Trong Phong Nguyen: Université Toulouse I Capitole
Edouard Pauwels: IRIT-UPS
Emile Richard: AdRoll
Bruce W. Suter: Air Force Research Laboratory

Journal of Optimization Theory and Applications, 2018, vol. 176, issue 1, No 8, 137-162

Abstract: Abstract We consider the extragradient method to minimize the sum of two functions, the first one being smooth and the second being convex. Under the Kurdyka–Łojasiewicz assumption, we prove that the sequence produced by the extragradient method converges to a critical point of the problem and has finite length. The analysis is extended to the case when both functions are convex. We provide, in this case, a sublinear convergence rate, as for gradient-based methods. Furthermore, we show that the recent small-prox complexity result can be applied to this method. Considering the extragradient method is an occasion to describe an exact line search scheme for proximal decomposition methods. We provide details for the implementation of this scheme for the one-norm regularized least squares problem and demonstrate numerical results which suggest that combining nonaccelerated methods with exact line search can be a competitive choice.

Keywords: Extragradient; Descent method; Forward–Backward splitting; Kurdyka–Łojasiewicz inequality; Complexity; first-order method; LASSO problem; 49M37; 65K05; 90C25; 90C30; 90C52 (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10957-017-1200-6 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:176:y:2018:i:1:d:10.1007_s10957-017-1200-6

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

DOI: 10.1007/s10957-017-1200-6

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 ().