File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1137/130940402
- Scopus: eid_2-s2.0-84919799221
- WOS: WOS:000346839800002
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: A generalized proximal point a lgorithm and its convergence rate
Title | A generalized proximal point a lgorithm and its convergence rate |
---|---|
Authors | |
Keywords | Convex optimization Proximal point algorithm Operator splitting methods Convergence rate |
Issue Date | 2014 |
Publisher | Society for Industrial and Applied Mathematics. The Journal's web site is located at http://www.siam.org/journals/siopt.php |
Citation | SIAM Journal on Optimization, 2014, v. 24, n. 4, p. 1614-1638 How to Cite? |
Abstract | Copyright © by SIAM. Unauthorized reproduction of this article is prohibited. We propose a generalized proximal point algorithm (PPA) in the generic setting of finding a root of a maximal monotone operator. In addition to the classical PPA, a number of benchmark operator splitting methods in the PDE and optimization literatures can be retrieved by this generalized PPA scheme. We establish the convergence rate of this generalized PPA scheme under different conditions, including estimating its worst-case convergence rate measured by the iteration complexity under mild assumptions and deriving its linear convergence rate under certain stronger conditions. Throughout our discussion, we pay particular attention to the special case where the operator is the sum of two maximal monotone operators and specify our theoretical results in the generic setting to this special case. Our result turns out to be a general and unified study on the convergence rate of a number of existing methods and subsumes some existing results in the literature. |
Persistent Identifier | http://hdl.handle.net/10722/251083 |
ISSN | 2023 Impact Factor: 2.6 2023 SCImago Journal Rankings: 2.138 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Corman, Etienne | - |
dc.contributor.author | Yuan, Xiaoming | - |
dc.date.accessioned | 2018-02-01T01:54:31Z | - |
dc.date.available | 2018-02-01T01:54:31Z | - |
dc.date.issued | 2014 | - |
dc.identifier.citation | SIAM Journal on Optimization, 2014, v. 24, n. 4, p. 1614-1638 | - |
dc.identifier.issn | 1052-6234 | - |
dc.identifier.uri | http://hdl.handle.net/10722/251083 | - |
dc.description.abstract | Copyright © by SIAM. Unauthorized reproduction of this article is prohibited. We propose a generalized proximal point algorithm (PPA) in the generic setting of finding a root of a maximal monotone operator. In addition to the classical PPA, a number of benchmark operator splitting methods in the PDE and optimization literatures can be retrieved by this generalized PPA scheme. We establish the convergence rate of this generalized PPA scheme under different conditions, including estimating its worst-case convergence rate measured by the iteration complexity under mild assumptions and deriving its linear convergence rate under certain stronger conditions. Throughout our discussion, we pay particular attention to the special case where the operator is the sum of two maximal monotone operators and specify our theoretical results in the generic setting to this special case. Our result turns out to be a general and unified study on the convergence rate of a number of existing methods and subsumes some existing results in the literature. | - |
dc.language | eng | - |
dc.publisher | Society for Industrial and Applied Mathematics. The Journal's web site is located at http://www.siam.org/journals/siopt.php | - |
dc.relation.ispartof | SIAM Journal on Optimization | - |
dc.subject | Convex optimization | - |
dc.subject | Proximal point algorithm | - |
dc.subject | Operator splitting methods | - |
dc.subject | Convergence rate | - |
dc.title | A generalized proximal point a lgorithm and its convergence rate | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1137/130940402 | - |
dc.identifier.scopus | eid_2-s2.0-84919799221 | - |
dc.identifier.volume | 24 | - |
dc.identifier.issue | 4 | - |
dc.identifier.spage | 1614 | - |
dc.identifier.epage | 1638 | - |
dc.identifier.isi | WOS:000346839800002 | - |
dc.identifier.issnl | 1052-6234 | - |