File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints

TitleA customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
Authors
Issue Date2014
Citation
Numerische Mathematik, 2014, v. 127, n. 1, p. 167-200 How to Cite?
AbstractWe consider applying the Douglas-Rachford splitting method (DRSM) to the convex minimization problem with linear constraints and a separable objective function. The dual application of DRSM has been well studied in the literature, resulting in the well known alternating direction method of multipliers (ADMM). In this paper, we show that the primal application of DRSM in combination with an appropriate decomposition can yield an efficient structure-exploiting algorithm for the model under consideration, whose subproblems could be easier than those of ADMM. Both the exact and inexact versions of this customized DRSM are studied; and their numerical efficiency is demonstrated by some preliminary numerical results. © 2013 Springer-Verlag Berlin Heidelberg.
Persistent Identifierhttp://hdl.handle.net/10722/251062
ISSN
2023 Impact Factor: 2.1
2023 SCImago Journal Rankings: 1.855
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorHan, Deren-
dc.contributor.authorHe, Hongjin-
dc.contributor.authorYang, Hai-
dc.contributor.authorYuan, Xiaoming-
dc.date.accessioned2018-02-01T01:54:28Z-
dc.date.available2018-02-01T01:54:28Z-
dc.date.issued2014-
dc.identifier.citationNumerische Mathematik, 2014, v. 127, n. 1, p. 167-200-
dc.identifier.issn0029-599X-
dc.identifier.urihttp://hdl.handle.net/10722/251062-
dc.description.abstractWe consider applying the Douglas-Rachford splitting method (DRSM) to the convex minimization problem with linear constraints and a separable objective function. The dual application of DRSM has been well studied in the literature, resulting in the well known alternating direction method of multipliers (ADMM). In this paper, we show that the primal application of DRSM in combination with an appropriate decomposition can yield an efficient structure-exploiting algorithm for the model under consideration, whose subproblems could be easier than those of ADMM. Both the exact and inexact versions of this customized DRSM are studied; and their numerical efficiency is demonstrated by some preliminary numerical results. © 2013 Springer-Verlag Berlin Heidelberg.-
dc.languageeng-
dc.relation.ispartofNumerische Mathematik-
dc.titleA customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1007/s00211-013-0580-2-
dc.identifier.scopuseid_2-s2.0-84898547640-
dc.identifier.volume127-
dc.identifier.issue1-
dc.identifier.spage167-
dc.identifier.epage200-
dc.identifier.isiWOS:000336028900005-
dc.identifier.issnl0029-599X-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats