A Perry-type derivative-free algorithm for solving nonlinear system of equations and minimizing ℓ₁ regularized problem

References

• Ahookhosh M, Amini K, Kimiaei M, et al. A limited memory adaptive trust-region approach for large-scale unconstrained optimization. Bull Iran Math Soc. 2016;42(4):819–837.
   Web of Science ®Google Scholar
• Esmaeili H, Kimiaei M. An improved adaptive trust-region method for unconstrained optimization. Math Model Anal. 2014;19(4):469–490.
   Web of Science ®Google Scholar
• Grippo L, Lampariello F, Lucidi S. A truncated Newton method with nonmonotone line search for unconstrained optimization. J Optim Theory Appl. 1989;60(3):401–419.
   Web of Science ®Google Scholar
• Kimiaei M, Ghaderi S. A new restarting adaptive trust-region method for unconstrained optimization. J Oper Res Soc China. 2017;5(4):487–507.
   Web of Science ®Google Scholar
• Liu DC, Nocedal J. On the limited memory BFGS method for large scale optimization. Math Program. 1989;45(1–3):503–528.
   Web of Science ®Google Scholar
• Ueda K, Yamashita N. A regularized Newton method without line search for unconstrained optimization. Comput Optim Appl. 2014;59(1–2):321–351.
   Web of Science ®Google Scholar
• Vlček J, Lukšan L. A modified limited-memory BNS method for unconstrained minimization based on the conjugate directions idea. Optim Methods Softw. 2015;30(3):616–633.
   Web of Science ®Google Scholar
• Vlček J, Lukšan L. A limited-memory optimization method using the infinitely many times repeated BNS update and conjugate directions. J Comput Appl Math. 2019;351:14–28.
   Web of Science ®Google Scholar
• Babaie-Kafaki S, Ghanbari R. A descent family of Dai–Liao conjugate gradient methods. Optim Methods Softw. 2014;29(3):583–591.
   Web of Science ®Google Scholar
• Dai Y, Yuan Y. A nonlinear conjugate gradient method with a strong global convergence property. SIAM J Optim. 1999;10(1):177–182.
   Web of Science ®Google Scholar
• Fletcher R, Reeves CM. Function minimization by conjugate gradients. Comput J. 1964;7(2):149–154.
   Web of Science ®Google Scholar
• Hager WW, Zhang H. A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM J Optim. 2005;16(1):170–192.
   Web of Science ®Google Scholar
• Hager WW, Zhang H. Algorithm 851: CG _DESCENT, a conjugate gradient method with guaranteed descent. ACM Trans Math Softw (TOMS). 2006;32(1):113–137.
   Web of Science ®Google Scholar
• Hestenes MR, Stiefel E. Methods of conjugate gradients for solving linear systems. Vol. 49. Washington (DC): NBS; 1952.
   Google Scholar
• Pola E, Ribiere G. Note sur la convergence de methodes de directions conjugées. Rev Française Informat Recherche Operationelle, 3e Année. 1969;16:35–43.
   Google Scholar
• Polyak BT. The conjugate gradient method in extremal problems. USSR Comput Math Math Phys. 1969;9(4):94–112.
   Google Scholar
• Perry A. A modified conjugate gradient algorithm. Oper Res. 1978;26(6):1073–1078.
   Web of Science ®Google Scholar
• Livieris IE, Pintelas P. Globally convergent modified Perry's conjugate gradient method. Appl Math Comput. 2012;218(18):9197–9207.
   Web of Science ®Google Scholar
• Liu D, Xu G. Symmetric Perry conjugate gradient method. Comput Optim Appl. 2013;56(2):317–341.
   Web of Science ®Google Scholar
• Livieris IE, Pintelas P. A modified Perry conjugate gradient method and its global convergence. Optim Lett. 2015;9(5):999–1015.
   Web of Science ®Google Scholar
• Yao S, He D, Shi L. An improved Perry conjugate gradient method with adaptive parameter choice. Numer Algorithms. 2018;78(4):1255–1269.
   Web of Science ®Google Scholar
• Xiao Y, Wang Q, Hu Q. Non-smooth equations based method for 11-norm problems with applications to compressed sensing. Nonlinear Anal Theory Methods Appl. 2011;74(11):3570–3577.
   Web of Science ®Google Scholar
• Dai Z, Chen X, Wen F. A modified Perry's conjugate gradient method-based derivative-free method for solving large-scale nonlinear monotone equations. Appl Math Comput. 2015;270:378–386.
   Web of Science ®Google Scholar
• Solodov MV, Svaiter BF. A globally convergent inexact Newton method for systems of monotone equations. Reformulation: nonsmooth, piecewise smooth, semismooth and smoothing methods. Springer; 1998. p. 355–369.
   Google Scholar
• Yuan N. A derivative-free projection method for solving convex constrained monotone equations. Sci Asia. 2017;43(3):195–200.
   Web of Science ®Google Scholar
• Barzilai J, Borwein JM. Two-point step size gradient methods. IMA J Numer Anal. 1988;8(1):141–148.
   Web of Science ®Google Scholar
• Awwal AM, Kumam P, Abubakar AB. A modified conjugate gradient method for monotone nonlinear equations with convex constraints. Appl Numer Math. 2019;145:507–520.
   Web of Science ®Google Scholar
• Amini K, Faramarzi P, Pirfalah N. A modified Hestenes–Stiefel conjugate gradient method with an optimal property. Optim Methods Softw. 2019;34(4):770–782.
   Web of Science ®Google Scholar
• Dai Z, Zhu H. A modified Hestenes–Stiefel-type derivative-free method for large-scale nonlinear monotone equations. Mathematics. 2020;8(2):168.
   Web of Science ®Google Scholar
• Dai Z, Wen F. Global convergence of a modified Hestenes–Stiefel nonlinear conjugate gradient method with Armijo line search. Numer Algorithms. 2012;59(1):79–93.
   Web of Science ®Google Scholar
• Abubakar AB, Kumam P, Mohammad H, et al. An efficient conjugate gradient method for convex constrained monotone nonlinear equations with applications. Mathematics. 2019;7(9):767.
   Web of Science ®Google Scholar
• Awwal AM, Kumam P, Abubakar AB. Spectral modified Polak–Ribiére–Polyak projection conjugate gradient method for solving monotone systems of nonlinear equations. Appl Math Comput. 2019;362:124514.
   Web of Science ®Google Scholar
• Awwal AM, Kumam P, Abubakar AB, Wakili A. A projection Hestenes–Stiefel-like method for monotone nonlinear equations with convex constraints. Thai J Math. 2019;181:199.
   Google Scholar
• Awwal AM, Kumam P, Abubakar AB, et al. A new hybrid spectral gradient projection method for monotone system of nonlinear equations with convex constraints. Thai J Math. 2018;16(4):125–147.
   Google Scholar
• Awwal AM, Wang L, Kumam P, et al. A two-step spectral gradient projection method for system of nonlinear monotone equations and image deblurring problems. Symmetry. 2020;12(6):874.
   Google Scholar
• Bellavia S, Morini B. Subspace trust-region methods for large bound-constrained nonlinear equations. SIAM J Numer Anal. 2006;44(4):1535–1555.
   Web of Science ®Google Scholar
• Mohammad H. A diagonal PRP-type projection method for convex constrained nonlinear monotone equations. J Indust Manage Optim. doi:10.3934/jimo.2019101
   Web of Science ®Google Scholar
• Yuan G, Lu J, Wang Z. The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration problems. Appl Numer Math. 2020;152:1–11.
   Web of Science ®Google Scholar
• Zheng L. A new projection algorithm for solving a system of nonlinear equations with convex constraints. Bull Korean Math Soc. 2013;50(3):823–832.
   Web of Science ®Google Scholar
• Nocedal J, Wright S. Numerical optimization. New York (NY): Springer Science & Business Media; 2006.
   Google Scholar
• Zhang L, Zhou W, Li D-H. A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence. IMA J Numer Anal. 2006;26(4):629–640.
   Web of Science ®Google Scholar
• Zarantonello EH. Projections on convex sets in Hilbert space and spectral theory: Part I. Projections on convex sets: Part II. Spectral theory. Contributions to nonlinear functional analysis. Elsevier; 1971. p. 237–424.
   Google Scholar
• Dolan ED, Moré JJ. Benchmarking optimization software with performance profiles. Math Program Ser. 2002;91:201–213.
   Web of Science ®Google Scholar
• Moré JJ, Wild SM. Benchmarking derivative-free optimization algorithms. SIAM J Optim. 2009;20(1):172–191.
   Web of Science ®Google Scholar
• Gao P, He C, Liu Y. An adaptive family of projection methods for constrained monotone nonlinear equations with applications. Appl Math Comput. 2019;359:1–16.
   Web of Science ®Google Scholar
• Liu J, Feng Y. A derivative-free iterative method for nonlinear monotone equations with convex constraints. Numer Algorithms. 2019;82(1):245–262.
   Web of Science ®Google Scholar
• Figueiredo MAT, Nowak RD, Wright SJ. Gradient projection for sparse reconstruction: application to compressed sensing and other inverse problems. IEEE J Sel Top Signal Process. 2007;1(4):586–597.
   Web of Science ®Google Scholar
• Pang JS. Inexact Newton methods for the nonlinear complementarity problem. Math Program. 1986;36(1):54–71.
   Web of Science ®Google Scholar
• Wright SJ, Nowak RD, Figueiredo MAT. Sparse reconstruction by separable approximation. IEEE Trans Signal Process. 2009;57(7):2479–2493.
   Web of Science ®Google Scholar
• Dai Z, Zhou H. Prediction of stock returns: sum-of-the-parts method and economic constraint method. Sustainability. 2020;12(2):541.
   Web of Science ®Google Scholar
• Dai Z, Zhu H. Stock return predictability from a mixed model perspective. Pacific-Basin Financ J. 2020;60:101267.
   Web of Science ®Google Scholar
• Lukšan L, Matonoha C, Vlcek J. Problems for nonlinear least squares and nonlinear equations. Technical report, Technical Report; 2018.
   Google Scholar
• Li D, Fukushima M. A globally and superlinearly convergent Gauss–Newton-based BFGS method for symmetric nonlinear equations. SIAM J Numer Anal. 1999;37(1):152–172.
   Web of Science ®Google Scholar
• Awwal AM, Wang L, Kumam P, et al. A projection Hestenes–Stiefel method with spectral parameter for nonlinear monotone equations and signal processing. Math Comput Appl. 2020;25(2):27.
   Web of Science ®Google Scholar
• La Cruz W. A spectral algorithm for large-scale systems of nonlinear monotone equations. Numer Algorithms. 2017;76(4):1109–1130.
   Web of Science ®Google Scholar
• Zhou W, Shen D. An inexact PRP conjugate gradient method for symmetric nonlinear equations. Numer Funct Anal Optim. 2014;35(3):370–388.
   Web of Science ®Google Scholar
• Yu G, Niu S, Ma J. Multivariate spectral gradient projection method for nonlinear monotone equations with convex constraints. J Indust Manage Optim. 2013;9(1):117–129.
   Web of Science ®Google Scholar