Analysis on Newton projection method for the split feasibility problem
作者： Biao Qu , Changyu Wang , Naihua Xiu
DOI: 10.1007/S10589-016-9884-3
关键词:
摘要: In this paper, based on a merit function of the split feasibility problem (SFP), we present Newton projection method for solving it and analyze convergence properties method. The is differentiable convex. But its gradient linear composite operator, so nonsmooth in general. We prove that sequence iterates converges globally to solution SFP as long regularization parameter matrix algorithm chosen properly. Especially, under some local assumptions which are necessary case where operator nonsmooth, generated by superlinearly regular SFP. Finally, numerical results presented.
springer.com
sci-hub.se 参考文章(37)
Charles Byrne, Bregman-Legendre Multidistance Projection Algorithms for Convex Feasibility and Optimization Studies in Computational Mathematics. ,vol. 8, pp. 87- 99 ,(2001) , 10.1016/S1570-579X(01)80008-2
Kazufumi Ito, Karl Kunisch, Applications of Semi-smooth Newton Methods to Variational Inequalities International Series of Numerical Mathematics. pp. 175- 192 ,(2007) , 10.1007/978-3-7643-7721-2_8
Biao Qu, Binghua Liu, Na Zheng, On the computation of the step-size for the CQ-like algorithms for the split feasibility problem Applied Mathematics and Computation. ,vol. 262, pp. 218- 223 ,(2015) , 10.1016/J.AMC.2015.04.056
Changyu Wang, Naihua Xiu, Convergence of the Gradient Projection Method for Generalized Convex Minimization Computational Optimization and Applications. ,vol. 16, pp. 111- 120 ,(2000) , 10.1023/A:1008714607737
Frank H. Clarke, Optimization and nonsmooth analysis ,(1983)
Dong-Hui Li, Masao Fukushima, Globally Convergent Broyden-Like Methods for Semismooth Equations and Applications to VIP, NCP and MCP Annals of Operations Research. ,vol. 103, pp. 71- 97 ,(2001) , 10.1023/A:1012996232707
Biao Qu, Naihua Xiu, A new halfspace-relaxation projection method for the split feasibility problem Linear Algebra and its Applications. ,vol. 428, pp. 1218- 1229 ,(2008) , 10.1016/J.LAA.2007.03.002
Paul Armand, Joël Benoist, Riadh Omheni, Vincent Pateloup, Study of a primal-dual algorithm for equality constrained minimization Computational Optimization and Applications. ,vol. 59, pp. 405- 433 ,(2014) , 10.1007/S10589-014-9679-3
Qingzhi Yang, The relaxed CQ algorithm solving the split feasibility problem Inverse Problems. ,vol. 20, pp. 1261- 1266 ,(2004) , 10.1088/0266-5611/20/4/014
Naihua Xiu, Jianzhong Zhang, Some recent advances in projection-type methods for variational inequalities Journal of Computational and Applied Mathematics. ,vol. 152, pp. 559- 585 ,(2003) , 10.1016/S0377-0427(02)00730-6