A primal-dual fixed-point algorithm for minimization of the sum of three convex separable functions

Many problems arising in image processing and signal recovery with multi-regularization can be formulated as minimization of a sum of three convex separable functions. Typically, the objective function involves a smooth function with Lipschitz continuous gradient, a linear composite nonsmooth functi...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2015-12
Main Authors: Chen, Peijun, Huang, Jianguo, Zhang, Xiaoqun
Format: Article
Language:English
Subjects:
Algorithms
Continuity (mathematics)
Fixed points (mathematics)
Image processing
Image restoration
Linear operators
Operators (mathematics)
Optimization
Regularization
Signal processing
Signal reconstruction
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Chen, Peijun
Huang, Jianguo
Zhang, Xiaoqun
description Many problems arising in image processing and signal recovery with multi-regularization can be formulated as minimization of a sum of three convex separable functions. Typically, the objective function involves a smooth function with Lipschitz continuous gradient, a linear composite nonsmooth function and a nonsmooth function. In this paper, we propose a primal-dual fixed-point (PDFP) scheme to solve the above class of problems. The proposed algorithm for three block problems is a fully splitting symmetric scheme, only involving explicit gradient and linear operators without inner iteration, when the nonsmooth functions can be easily solved via their proximity operators, such as \(\ell_1\) type regularization. We study the convergence of the proposed algorithm and illustrate its efficiency through examples on fused LASSO and image restoration with non-negative constraint and sparse regularization.
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2078222571</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2078222571</sourcerecordid><originalsourceid>FETCH-proquest_journals_20782225713</originalsourceid><addsrcrecordid>eNqNissKgkAUQIcgSMp_uNBa0Gum24iiD2gvk93JkXnYPEL6-or6gFbnwDkzlmBZFlmzQVyw1Pshz3Pc1lhVZcK6HYxOaq6ya-QKhJzomo1WmgBc3ayTodcgrAMtjdTyyYO0BqyA0BP4qL_qiKCz5kETeBq54xdFIKLpPrdfsbngylP645Ktj4fz_pSNzt4j-dAONjrzTi3mdYOIVV2U_10v-xdGaQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2078222571</pqid></control><display><type>article</type><title>A primal-dual fixed-point algorithm for minimization of the sum of three convex separable functions</title><source>Publicly Available Content (ProQuest)</source><creator>Chen, Peijun ; Huang, Jianguo ; Zhang, Xiaoqun</creator><creatorcontrib>Chen, Peijun ; Huang, Jianguo ; Zhang, Xiaoqun</creatorcontrib><description>Many problems arising in image processing and signal recovery with multi-regularization can be formulated as minimization of a sum of three convex separable functions. Typically, the objective function involves a smooth function with Lipschitz continuous gradient, a linear composite nonsmooth function and a nonsmooth function. In this paper, we propose a primal-dual fixed-point (PDFP) scheme to solve the above class of problems. The proposed algorithm for three block problems is a fully splitting symmetric scheme, only involving explicit gradient and linear operators without inner iteration, when the nonsmooth functions can be easily solved via their proximity operators, such as \(\ell_1\) type regularization. We study the convergence of the proposed algorithm and illustrate its efficiency through examples on fused LASSO and image restoration with non-negative constraint and sparse regularization.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Continuity (mathematics) ; Fixed points (mathematics) ; Image processing ; Image restoration ; Linear operators ; Operators (mathematics) ; Optimization ; Regularization ; Signal processing ; Signal reconstruction</subject><ispartof>arXiv.org, 2015-12</ispartof><rights>2015. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2078222571?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>780,784,25753,37012,44590</link.rule.ids></links><search><creatorcontrib>Chen, Peijun</creatorcontrib><creatorcontrib>Huang, Jianguo</creatorcontrib><creatorcontrib>Zhang, Xiaoqun</creatorcontrib><title>A primal-dual fixed-point algorithm for minimization of the sum of three convex separable functions</title><title>arXiv.org</title><description>Many problems arising in image processing and signal recovery with multi-regularization can be formulated as minimization of a sum of three convex separable functions. Typically, the objective function involves a smooth function with Lipschitz continuous gradient, a linear composite nonsmooth function and a nonsmooth function. In this paper, we propose a primal-dual fixed-point (PDFP) scheme to solve the above class of problems. The proposed algorithm for three block problems is a fully splitting symmetric scheme, only involving explicit gradient and linear operators without inner iteration, when the nonsmooth functions can be easily solved via their proximity operators, such as \(\ell_1\) type regularization. We study the convergence of the proposed algorithm and illustrate its efficiency through examples on fused LASSO and image restoration with non-negative constraint and sparse regularization.</description><subject>Algorithms</subject><subject>Continuity (mathematics)</subject><subject>Fixed points (mathematics)</subject><subject>Image processing</subject><subject>Image restoration</subject><subject>Linear operators</subject><subject>Operators (mathematics)</subject><subject>Optimization</subject><subject>Regularization</subject><subject>Signal processing</subject><subject>Signal reconstruction</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNqNissKgkAUQIcgSMp_uNBa0Gum24iiD2gvk93JkXnYPEL6-or6gFbnwDkzlmBZFlmzQVyw1Pshz3Pc1lhVZcK6HYxOaq6ya-QKhJzomo1WmgBc3ayTodcgrAMtjdTyyYO0BqyA0BP4qL_qiKCz5kETeBq54xdFIKLpPrdfsbngylP645Ktj4fz_pSNzt4j-dAONjrzTi3mdYOIVV2U_10v-xdGaQ</recordid><startdate>20151231</startdate><enddate>20151231</enddate><creator>Chen, Peijun</creator><creator>Huang, Jianguo</creator><creator>Zhang, Xiaoqun</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20151231</creationdate><title>A primal-dual fixed-point algorithm for minimization of the sum of three convex separable functions</title><author>Chen, Peijun ; Huang, Jianguo ; Zhang, Xiaoqun</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20782225713</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Algorithms</topic><topic>Continuity (mathematics)</topic><topic>Fixed points (mathematics)</topic><topic>Image processing</topic><topic>Image restoration</topic><topic>Linear operators</topic><topic>Operators (mathematics)</topic><topic>Optimization</topic><topic>Regularization</topic><topic>Signal processing</topic><topic>Signal reconstruction</topic><toplevel>online_resources</toplevel><creatorcontrib>Chen, Peijun</creatorcontrib><creatorcontrib>Huang, Jianguo</creatorcontrib><creatorcontrib>Zhang, Xiaoqun</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content (ProQuest)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Chen, Peijun</au><au>Huang, Jianguo</au><au>Zhang, Xiaoqun</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>A primal-dual fixed-point algorithm for minimization of the sum of three convex separable functions</atitle><jtitle>arXiv.org</jtitle><date>2015-12-31</date><risdate>2015</risdate><eissn>2331-8422</eissn><abstract>Many problems arising in image processing and signal recovery with multi-regularization can be formulated as minimization of a sum of three convex separable functions. Typically, the objective function involves a smooth function with Lipschitz continuous gradient, a linear composite nonsmooth function and a nonsmooth function. In this paper, we propose a primal-dual fixed-point (PDFP) scheme to solve the above class of problems. The proposed algorithm for three block problems is a fully splitting symmetric scheme, only involving explicit gradient and linear operators without inner iteration, when the nonsmooth functions can be easily solved via their proximity operators, such as \(\ell_1\) type regularization. We study the convergence of the proposed algorithm and illustrate its efficiency through examples on fused LASSO and image restoration with non-negative constraint and sparse regularization.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2015-12
issn 2331-8422
language eng
recordid cdi_proquest_journals_2078222571
source Publicly Available Content (ProQuest)
subjects Algorithms
Continuity (mathematics)
Fixed points (mathematics)
Image processing
Image restoration
Linear operators
Operators (mathematics)
Optimization
Regularization
Signal processing
Signal reconstruction
title A primal-dual fixed-point algorithm for minimization of the sum of three convex separable functions
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T03%3A20%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=A%20primal-dual%20fixed-point%20algorithm%20for%20minimization%20of%20the%20sum%20of%20three%20convex%20separable%20functions&rft.jtitle=arXiv.org&rft.au=Chen,%20Peijun&rft.date=2015-12-31&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2078222571%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_20782225713%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2078222571&rft_id=info:pmid/&rfr_iscdi=true