|Table of Contents|

A Primal-Dual Fixed Point Algorithm Based on Proximity Operator for Convex Set Constrained Separable Problem(PDF)

《南京师大学报（自然科学版）》[ISSN:1001-4616/CN:32-1239/N]

Issue:
2013年03期
Page:
1-5
Research Field:
数学
Publishing date:

Info

Title:
A Primal-Dual Fixed Point Algorithm Based on Proximity Operator for Convex Set Constrained Separable Problem
Author(s):
Chen Peijun1; 2; Huang Jianguo1; Zhang Xiaoqun1; 3
(1.Department of Mathematics,MOE-LSC,Shanghai Jiao Tong University,Shanghai 200240,China) (2.Department of Mathematics,Taiyuan University of Science and Technology,Taiyuan 030024,China) (3.Institute of Natural Sciences,Shanghai Jiao Tong University,Shanghai 200240,China)
Keywords:
convex constraint; convex separable minimization; proximity operator; fixed point algorithm
PACS:
O224; O29
DOI:
-
Abstract:
In many real problems,the solutions may have constraints arising from their physical requirements.In this paper,we design an efficient algorithm for solving the separable convex minimization on closed convex set based on the algorithm PDFP2O.Precisely speaking,the constraint can be enforced by adding an indicator function to the objective function,and the function are reformulated and can be solved with PDFP2O.Using the separability of the function with respect to its variables,we thus get a primal-dual fixed point algorithm based on proximity operator on closed convex set(PDFP2OC).Since the algorithm PDFP2OC can be recast as the original PDFP2O for unconstrained problem,the convergence and convergence rate analysis can be obtained directly.Finally,we illustrate the efficiency of PDFP2OC through computerized tomographic reconstruction.

References:

[1] Combettes P L,Wajs V R.Signal recovery by proximal forward-backward splitting[J].Multiscale Modeling and Simulation,2005,4(4):1 168-1 200.
[2]Rudin L I,Osher S,Fatemi E.Nonlinear total variation based noise removal algorithms[J].Physica D:Nonlinear Phenomena,1992,60(1/4):259-268.
[3]Chen P,Huang J,Zhang X.A primal-dual fixed point algorithm for convex separable minimization with applications to image restoration[J].Inverse Problems,2013,29(2):025011(1-33).
[4]Micchelli C A,Shen L,Xu Y.Proximity algorithms for image models:denoising[J].Inverse Problems,2011,27(4):045009(1-30).
[5]Goldstein T,Osher S.The split Bregman method for b>1-regularized problems[J].SIAM Journal on Imaging Sciences,2009,2(2):323-343.
[6]Chambolle A,Pock T.A first-order primal-dual algorithm for convex problems with applications to imaging[J].Journal of Mathematical Imaging and Vision,2011,40(1):120-145.
[7]Zhang X,Burger M,Osher S.A unified primal-dual algorithm framework based on Bregman iteration[J].Journal of Scientific Computing,2011,46(1):20-46.
[8]Esser E,Zhang X,Chan T F.A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science[J].SIAM Journal on Imaging Sciences,2010,3(4):1 015-1 046.
[9]Avinash C,Malcolm S.Principles of Computerized Tomographic Imaging[M].Philadelphia:SIAM,2001.

Memo

Memo:
-
Last Update: 2013-09-30