File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/s10107-014-0826-5
- Scopus: eid_2-s2.0-84953209903
- WOS: WOS:000367695200002
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
Title | The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent |
---|---|
Authors | |
Keywords | Alternating direction method of multipliers Splitting methods Convex programming Convergence analysis |
Issue Date | 2016 |
Citation | Mathematical Programming, 2016, v. 155, n. 1-2, p. 57-79 How to Cite? |
Abstract | © 2014, Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society. The alternating direction method of multipliers (ADMM) is now widely used in many fields, and its convergence was proved when two blocks of variables are alternatively updated. It is strongly desirable and practically valuable to extend the ADMM directly to the case of a multi-block convex minimization problem where its objective function is the sum of more than two separable convex functions. However, the convergence of this extension has been missing for a long timeâneither an affirmative convergence proof nor an example showing its divergence is known in the literature. In this paper we give a negative answer to this long-standing open question: The direct extension of ADMM is not necessarily convergent. We present a sufficient condition to ensure the convergence of the direct extension of ADMM, and give an example to show its divergence. |
Persistent Identifier | http://hdl.handle.net/10722/251133 |
ISSN | 2023 Impact Factor: 2.2 2023 SCImago Journal Rankings: 1.982 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chen, Caihua | - |
dc.contributor.author | He, Bingsheng | - |
dc.contributor.author | Ye, Yinyu | - |
dc.contributor.author | Yuan, Xiaoming | - |
dc.date.accessioned | 2018-02-01T01:54:42Z | - |
dc.date.available | 2018-02-01T01:54:42Z | - |
dc.date.issued | 2016 | - |
dc.identifier.citation | Mathematical Programming, 2016, v. 155, n. 1-2, p. 57-79 | - |
dc.identifier.issn | 0025-5610 | - |
dc.identifier.uri | http://hdl.handle.net/10722/251133 | - |
dc.description.abstract | © 2014, Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society. The alternating direction method of multipliers (ADMM) is now widely used in many fields, and its convergence was proved when two blocks of variables are alternatively updated. It is strongly desirable and practically valuable to extend the ADMM directly to the case of a multi-block convex minimization problem where its objective function is the sum of more than two separable convex functions. However, the convergence of this extension has been missing for a long timeâneither an affirmative convergence proof nor an example showing its divergence is known in the literature. In this paper we give a negative answer to this long-standing open question: The direct extension of ADMM is not necessarily convergent. We present a sufficient condition to ensure the convergence of the direct extension of ADMM, and give an example to show its divergence. | - |
dc.language | eng | - |
dc.relation.ispartof | Mathematical Programming | - |
dc.subject | Alternating direction method of multipliers | - |
dc.subject | Splitting methods | - |
dc.subject | Convex programming | - |
dc.subject | Convergence analysis | - |
dc.title | The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/s10107-014-0826-5 | - |
dc.identifier.scopus | eid_2-s2.0-84953209903 | - |
dc.identifier.volume | 155 | - |
dc.identifier.issue | 1-2 | - |
dc.identifier.spage | 57 | - |
dc.identifier.epage | 79 | - |
dc.identifier.eissn | 1436-4646 | - |
dc.identifier.isi | WOS:000367695200002 | - |
dc.identifier.issnl | 0025-5610 | - |