Computer Science ›› 2023, Vol. 50 ›› Issue (6): 261-265.doi: 10.11896/jsjkx.230100009

• Artificial Intelligence • Previous Articles     Next Articles

Extrapolation Accelerated Linear Alternating Direction Multiplier Method for Split Feasibility Problems and Its Global Convergence

LIU Yang1,2, XUE Zhonghui3, WANG Yongquan1, CAO Yongsheng1   

  1. 1 Department of Intelligent Science and Information Law,East China University of Political Science and Law,Shanghai 201620,China
    2 China Institute for Smart Court,Shanghai Jiao Tong University,Shanghai 200030,China
    3 Department of Information and Intelligent Engineering,Shanghai Publishing and Printing College,Shanghai 200093,China
  • Received:2023-01-03 Revised:2023-04-10 Online:2023-06-15 Published:2023-06-06
  • About author:LIU Yang,born in 1983,Ph.D,lecturer.Her main research interests include algorithm optimization and artificial intelligence.XUE Zhonghui,born in 1974,Ph.D,associate professor.His main research interests include operational research and optimization theory,image reconstruction and restoration,artificial intelligence and brain science.
  • Supported by:
    National Social Science Fund Major Project of China (20&ZD199,21&ZD200),Youth Fund for Humanities and Social Sciences of the Ministry of Education (20YJC820030) and Bidding Project of the Key Laboratory of “Intelligent and Green Flexographic Printing” of the State Press and Publication Administration(KLIGFP-02).

Abstract: This paper deals with a linear alternating direction multiplier method (ADMM) for Split feasibility problems (SFP).More specifically,the SFP has been formulated as a separable convex minimization problem with linear constraints,and then extrapolation accelerated linear ADMM has been proposed,which takes advantage of the separable structure,and then rising to sub-problems with closed-form solutions have been given.Furthermore,the global convergence of the proposed method is proved under some suitable conditions.Moreover,the algorithm has been tested by applying to two SFP examples in our theoretical results.

Key words: Split feasible problem, ADMM, Separable convex problem, Extrapolation accelerated

CLC Number: 

  • TP301.6
[1]CENSOR Y,ELFVING T.A multiprojection algorithm usingbregman projections in a product space [J].Numerical Algorithms,1994,8:221-239.
[2]BYRNE C.A unified treatment of some iterative algorithm algorithms in signal processing and image reconstruction [J].Inverse Problems,2004,20:103-120.
[3]DANG Y Z,GAO Y.The strong convergence of a KM-CQ-like algorithm for a split feasibility problem [J].Inverse Problems,2011,27(1):015007.
[4]QU B,XIU N.A note on the CQ algorithm for the split feasibility problem [J].Inverse Problem,2005,21:1655-1665.
[5]XU H.A variable Krasnosel'skii-Mann algorithm and themultiple-set split feasibility problem [J].Inverse Problems,2006,22:2021-2034.
[6]ZHAO J,YANG Q.Several solution methods for the split feasibility problem [J].Inverse Problems,2005,21:1791-1799.
[7]ROCKAFELLAR R.Augmented lagrangians and applications of the proximal point algorithm in convex programming [J].Mathmetics of Operations Research,1976,1(2):97-116.
[8]XUE Z H,YIN Q W,DANG Y Z.Inertia approximate relaxation alternating direction multiplier method for separable convex optimization problems[J].Journal of University of Shanghai for Science and Technology,2022,44(2):204-212.
[9]YANG J,ZHANG Y.Alternating direction algorithms for l1-problems in compressive sensing [J].SIAM Journal on Scientific Computing,2011,33(1):250-278.
[10]YANG J,ZHANG Y,YIN W.A fast alternating direction me-thod for TV l1Cl2 signal reconstruction from partial fourier data [J].IEEE Journal of Selected Topics in Signal Processing,2010,4(2):288-297.
[11]HE H J,LING C,XU H.An implementable splitting algorithm for the l1norm regularized split feasibility problem [J].Journal of Scientific Computing,2016,67(1):281-298.
[1] ZHANG Lihong, YE Jun. Hyperspectral Image Denoising Based on Group Sparse and Constraint Smooth Rank Approximation [J]. Computer Science, 2023, 50(6): 209-215.
[2] LIU Hua-jun, TANG Shi-di, ZHANG Di-ke, XIA Qiao-qiao. Study on Optimization of Quantization Algorithm in ADMM Decoding Algorithm Based on Lookup Table [J]. Computer Science, 2019, 46(11): 328-333.
[3] ZHANG Xing-hang, GUO Yan, LI Ning and SUN Bao-ming. DOA Estimating Algorithm Based on Grid-less Compressive Sensing [J]. Computer Science, 2017, 44(10): 99-102.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!