File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A splitting method for separable convex programming

TitleA splitting method for separable convex programming
Authors
He, BingshengTao, MinYuan, Xiaoming
Keywordsoperator splitting methods
image processing
separable structure
convex programming
Issue Date2013
Citation
IMA Journal of Numerical Analysis, 2013, v. 35, n. 1, p. 394-426 How to Cite?
DOI: http://dx.doi.org/10.1093/imanum/drt060
Abstract© 2014 The Authors. We propose a splitting method for solving a separable convex minimization problem with linear constraints, where the objective function is expressed as the sum of m individual functions without coupled variables. Treating the functions in the objective separately, the new method belongs to the category of operator splitting methods. We show the global convergence and estimate a worst-case convergence rate for the new method, and then illustrate its numerical efficiency by some applications.
Persistent Identifierhttp://hdl.handle.net/10722/251089
ISSN
0272-4979
2023 Impact Factor: 2.3
2023 SCImago Journal Rankings: 1.861
ISI Accession Number ID
WOS:000350204800017

 

DC FieldValueLanguage
dc.contributor.authorHe, Bingsheng-
dc.contributor.authorTao, Min-
dc.contributor.authorYuan, Xiaoming-
dc.date.accessioned2018-02-01T01:54:32Z-
dc.date.available2018-02-01T01:54:32Z-
dc.date.issued2013-
dc.identifier.citationIMA Journal of Numerical Analysis, 2013, v. 35, n. 1, p. 394-426-
dc.identifier.issn0272-4979-
dc.identifier.urihttp://hdl.handle.net/10722/251089-
dc.description.abstract© 2014 The Authors. We propose a splitting method for solving a separable convex minimization problem with linear constraints, where the objective function is expressed as the sum of m individual functions without coupled variables. Treating the functions in the objective separately, the new method belongs to the category of operator splitting methods. We show the global convergence and estimate a worst-case convergence rate for the new method, and then illustrate its numerical efficiency by some applications.-
dc.languageeng-
dc.relation.ispartofIMA Journal of Numerical Analysis-
dc.subjectoperator splitting methods-
dc.subjectimage processing-
dc.subjectseparable structure-
dc.subjectconvex programming-
dc.titleA splitting method for separable convex programming-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1093/imanum/drt060-
dc.identifier.scopuseid_2-s2.0-84922552820-
dc.identifier.volume35-
dc.identifier.issue1-
dc.identifier.spage394-
dc.identifier.epage426-
dc.identifier.eissn1464-3642-
dc.identifier.isiWOS:000350204800017-
dc.identifier.issnl0272-4979-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats