Analysis on Newton projection method for the split feasibility problem

In this paper, based on a merit function of the split feasibility problem (SFP), we present a Newton projection method for solving it and analyze the convergence properties of the method. The merit function is differentiable and convex. But its gradient is a linear composite function of the projection operator, so it is nonsmooth in general. We prove that the sequence of iterates converges globally to a solution of the SFP as long as the regularization parameter matrix in the algorithm is chosen properly. Especially, under some local assumptions which are necessary for the case where the projection operator is nonsmooth, we prove that the sequence of iterates generated by the algorithm superlinearly converges to a regular solution of the SFP. Finally, some numerical results are presented.

[1]  Kazufumi Ito,et al.  On a semi-smooth Newton method and its globalization , 2009, Math. Program..

[2]  C. Byrne.  Bregman-Legendre Multidistance Projection Algorithms for Convex Feasibility and Optimization , 2001 .

[3]  Jiming Liu.  Linear Stability of Generalized Equations Part I: Basic Theory , 1994, Math. Oper. Res..

[4]  Jiming Liu.  Linear Stability of Generalized Equations, Part II: Applications to Nonlinear Programming , 1994, Math. Oper. Res..

[5]  J. Hiriart-Urruty,et al.  Generalized Hessian matrix and second-order optimality conditions for problems withC1,1 data , 1984 .

[6]  Liqun Qi,et al.  A nonsmooth version of Newton's method , 1993, Math. Program..

[7]  Masao Fukushima,et al.  Theoretical and numerical investigation of the D-gap function for box constrained variational inequalities , 1998, Math. Program..

[8]  N. Xiu,et al.  Some recent advances in projection-type methods for variational inequalities , 2003 .

[9]  R. Mifflin.  Semismooth and Semiconvex Functions in Constrained Optimization , 1977 .

[10]  Jiming Liu.  Strong Stability in Variational Inequalities , 1995 .

[11]  Yanjun Zhang,et al.  Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem , 2012, Appl. Math. Comput..

[13]  Naihua Xiu,et al.  Convergence of the Gradient Projection Method for Generalized Convex Minimization , 2000, Comput. Optim. Appl..

[14]  N. Xiu,et al.  A note on the CQ algorithm for the split feasibility problem , 2005 .

[15]  Cheng Ma,et al.  Smoothing SQP algorithm for semismooth equations with box constraints , 2013, Comput. Optim. Appl..

[16]  Heinz H. Bauschke,et al.  On Projection Algorithms for Solving Convex Feasibility Problems , 1996, SIAM Rev..

[17]  Biao Qu,et al.  A Successive Projection Algorithm for Solving the Multiple-Sets Split Feasibility Problem , 2014 .

[18]  Qingzhi Yang.  The relaxed CQ algorithm solving the split feasibility problem , 2004 .

[19]  Binghua Liu,et al.  On the computation of the step-size for the CQ-like algorithms for the split feasibility problem , 2015, Appl. Math. Comput..

[20]  Masao Fukushima,et al.  A hybrid Newton method for solving the variational inequality problem via the D-gap function , 1999, Math. Program..

[21]  Benar Fux Svaiter,et al.  A Truly Globally Convergent Newton-Type Method for the Monotone Nonlinear Complementarity Problem , 1999, SIAM J. Optim..

[22]  C. Byrne,et al.  A unified treatment of some iterative algorithms in signal processing and image reconstruction , 2003 .

[23]  Houduo Qi,et al.  A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions , 1999, SIAM J. Optim..

[24]  Defeng Sun,et al.  A feasible semismooth asymptotically Newton method for mixed complementarity problems , 2002, Math. Program..

[25]  L. Qi,et al.  Solving variational inequality problems via smoothing-nonsmooth reformulations , 2001 .

[26]  Yair Censor,et al.  A multiprojection algorithm using Bregman projections in a product space , 1994, Numerical Algorithms.

[27]  Stephen M. Robinson,et al.  Strongly Regular Generalized Equations , 1980, Math. Oper. Res..

[28]  Bo Yu,et al.  A smoothing homotopy method for variational inequality problems on polyhedral convex sets , 2014, J. Glob. Optim..

[29]  Patrick T. Harker,et al.  Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications , 1990, Math. Program..

[30]  F. Clarke.  Optimization And Nonsmooth Analysis , 1983 .

[31]  Christian Kanzow,et al.  An interior-point affine-scaling trust-region method for semismooth equations with box constraints , 2007, Comput. Optim. Appl..

[32]  Masao Fukushima,et al.  A globally convergent Newton method for solving strongly monotone variational inequalities , 1993, Math. Program..

[33]  C. Byrne,et al.  Iterative oblique projection onto convex sets and the split feasibility problem , 2002 .

[34]  Masao Fukushima,et al.  Globally Convergent Broyden-Like Methods for Semismooth Equations and Applications to VIP, NCP and MCP , 2001, Ann. Oper. Res..

[35]  N. Xiu,et al.  A new halfspace-relaxation projection method for the split feasibility problem , 2008 .

[36]  Vincent Pateloup,et al.  Study of a primal-dual algorithm for equality constrained minimization , 2011, Comput. Optim. Appl..

[37]  Arnold Neumaier,et al.  A New Exact Penalty Function , 2002, SIAM J. Optim..