An efficient three-term conjugate gradient method for nonlinear monotone equations with convex constraints

In this paper, based on the hyperplane projection technique, we propose a three-term conjugate gradient method for solving nonlinear monotone equations with convex constraints. Due to the derivative-free feature and lower storage requirement, the proposed method can be applied to the solution of large-scale non-smooth nonlinear monotone equations. Under some mild assumptions, the global convergence is proved when the line search fulfils the backtracking line search condition. Moreover, we prove that the proposed method is R-linearly convergent. Numerical results show that our method is competitive and efficient for solving large-scale nonlinear monotone equations with convex constraints.

[1]  Alexander P. Morgan,et al.  Chemical equilibrium systems as numerical test problems , 1990, TOMS.

[2]  Boris Polyak.  The conjugate gradient method in extremal problems , 1969 .

[3]  John E. Dennis,et al.  Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

[4]  Weijun,et al.  LIMITED MEMORY BFGS METHOD FOR NONLINEAR MONOTONE EQUATIONS , 2007 .

[5]  A. Morgan,et al.  A methodology for solving chemical equilibrium systems , 1987 .

[6]  José Mario Martínez,et al.  Spectral residual method without gradient information for solving large-scale nonlinear systems of equations , 2006, Math. Comput..

[7]  Yunhai Xiao,et al.  A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing , 2013 .

[8]  Li Zhang,et al.  Some descent three-term conjugate gradient methods and their global convergence , 2007, Optim. Methods Softw..

[9]  Dong-Hui Li,et al.  A modified Fletcher-Reeves-Type derivative-free method for symmetric nonlinearequations , 2011 .

[10]  Wanyou Cheng,et al.  A PRP type method for systems of monotone equations , 2009, Math. Comput. Model..

[11]  Li Zhang,et al.  Global convergence of a modified Fletcher–Reeves conjugate gradient method with Armijo-type line search , 2006, Numerische Mathematik.

[12]  Chuanwei Wang,et al.  A projection method for a system of nonlinear monotone equations with convex constraints , 2007, Math. Methods Oper. Res..

[13]  S. Dirkse,et al.  Mcplib: a collection of nonlinear mixed complementarity problems , 1995 .

[14]  L. Nazareth.  A conjugate direction algorithm without line searches , 1977 .

[15]  M. Fukushima,et al.  On the Rate of Convergence of the Levenberg-Marquardt Method , 2001 .

[16]  J. J. Moré,et al.  A Characterization of Superlinear Convergence and its Application to Quasi-Newton Methods , 1973 .

[17]  William W. Hager,et al.  A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search , 2005, SIAM J. Optim..

[18]  S. J. Li,et al.  A self-adaptive three-term conjugate gradient method for monotone nonlinear equations with convex constraints , 2016 .

[19]  Weijun Zhou,et al.  Spectral gradient projection method for solving nonlinear monotone equations , 2006 .

[20]  W. Cheng.  A Two-Term PRP-Based Descent Method , 2007 .

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

[22]  J. J. Moré,et al.  Quasi-Newton Methods, Motivation and Theory , 1974 .

[23]  Weijun Zhou,et al.  A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence , 2006 .

[24]  M. Solodov,et al.  A New Projection Method for Variational Inequality Problems , 1999 .