10.1007/s40096-024-00526-7

Improved Dai-Yuan iterative schemes for convex constrained monotone nonlinear systems

  • Kabiru Ahmed1,
  • Mohammed Yusuf Waziri1,
  • Abubakar Sani Halilu2,
  • Jamilu Sabi’u3,
  • Salisu Murtala4,
  • Habibu Abdullahi*2,
  1. Numerical Optimization Research Group, Bayero University, Kano, NG Department of Mathematical Sciences, Bayero University, Kano, NG
  2. Department of Mathematics, Sule Lamido University, Kafin Hausa, NG Numerical Optimization Research Group, Bayero University, Kano, NG
  3. Numerical Optimization Research Group, Bayero University, Kano, NG Department of Mathematics, North-West University, Kano, NG
  4. Numerical Optimization Research Group, Bayero University, Kano, NG Department of Mathematics, Federal University, Dutse, NG

Published 2024-12-06

How to Cite

Ahmed, K., Waziri, M. Y., Halilu, A. S., Sabi’u, J., Murtala, S., & Abdullahi, H. (2024). Improved Dai-Yuan iterative schemes for convex constrained monotone nonlinear systems. Mathematical Sciences, 18(4 (December 2024). https://doi.org/10.1007/s40096-024-00526-7
Crossref
Scopus
Google Scholar
Europe PMC

Abstract

Abstract Two new Dai-Yuan (DY) iterative schemes are presented in this article for solving constrained system of nonlinear monotone equations. Using an extension of the classical scheme by Dai and Yuan [Soc. Ind. Appl. Math., 10(1)(1999) 177-182], two modified DY search directions are obtained, which possess the vital property for analyzing global convergence. By conducting eigenvalue analysis, appropriate values were obtained for the nonnegative parameter C of the two schemes. The self-restarting structure of the first scheme, as well as the choices of the parameter C in both methods, ensure fast convergence to the solution of the problems considered. Algorithms of both schemes are implemented by employing monotone line search procedure by Zhang and Zhou [J. Comput. Appl. Math. 196(2006) 478-484] and the projection technique. Using fundamental assumptions, global convergence of both schemes is established and results of numerical experiments with four recent methods in the literature show that the new methods are encouraging.

Keywords

  • Non-smooth functions,
  • Backtracking technique,
  • Projection operator,
  • Conjugacy condition,
  • Convex set,
  • Descent condition

References

  1. Meintjes and Morgan (1987) A methodology for solving chemical equilibrium systems (pp. 333-361)
  2. Dirkse and Ferris (1995) A collection of nonlinear mixed complementarity problems (pp. 319-345)
  3. Xiao and Zhu (2013) A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing (pp. 310-319)
  4. Solodov and Iusem (1997) Newton-type methods with generalized distances for constrained optimization 41(3) (pp. 257-278)
  5. Zhao and Li (2001) Monotonicity of fixed point and normal mappings associated with variational inequality and its application (pp. 962-973)
  6. Broyden (1965) A class of methods for solving nonlinear simultaneous equations (pp. 577-593)
  7. Dauda et al. (2019) Improved quasi-Newton method via SR1 update for solving symmetric systems of nonlinear equations (pp. 117-120)
  8. Solodov, M.V., Svaiter, B.F.: A globally convergent inexact newton method for systems of monotone equations, in: Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, Springer, 1999, pp. 355-369
  9. Fasano et al. (2006) A truncated nonmonotone Gauss-Newton method for large-scale nonlinear least-squares problems (pp. 343-358)
  10. Li and Fukushima (2000) A globally and superlinearly convergent Gauss-Newton-based BFGS method for symmetric nonlinear equations (pp. 152-172)
  11. Kanzow et al. (2004) Levenberg-Marquardt methods for constrained nonlinear equations with strong local convergence properties (pp. 375-397)
  12. Levenberg (1944) A method for the solution of certain non-linear problems in least squares (pp. 164-166)
  13. Marquardt (1963) An algorithm for least-squares estimation of nonlinear parameters (pp. 431-441)
  14. Sharma et al. (2022) Empirical study of new iterative algorithm for generalized nonexpansive operators 25(3) (pp. 284-295)
  15. Muangchoo (2022) Explicit Halpern-type iterative algorithm for solving equilibrium problems with applications 25(2) (pp. 115-132)
  16. Ali et al. (2022) Iterative methods for solving absolute value equations 26(4) (pp. 322-329)
  17. Babaie-Kafaki and Ghanbari (2015) A hybridization of the Hestenes-Stiefel and Dai-Yuan conjugate gradient methods based on a least-squares approach 30(4) (pp. 673-681)
  18. Andrei (2008) A Dai-Yuan conjugate gradient algorithm with sufficient descent and conjugacy conditions for unconstrained optimization (pp. 165-171)
  19. Andrei (2008) A hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization as a convex combination of Hestenes-Stiefel and Dai-Yuan algorithms 17(4) (pp. 373-392)
  20. Ahmed and Al-Naemi (2012) A modified Dai-Yuan conjugate gradient method and its global convergence 53(3) (pp. 620-628)
  21. Andrei (2011) Open problems in conjugate gradient algorithms for unconstrained optimization 34(2) (pp. 319-330)
  22. Arazm et al. (2017) An extended Dai-Liao conjugate gradient method with global convergence for nonconvex functions 52(72) (pp. 361-375)
  23. Babaie-Kafaki et al. (2010) Two new conjugate gradient methods based on modified secant equations 234(5) (pp. 1374-1386)
  24. Babaie-Kafaki and Ghanbari (2013) A descent family of Dai-Liao conjugate gradient methods 29(3) (pp. 583-591)
  25. Aminifard and Babaie-Kafaki (2019) A modified descent Polak-Ribiére-Polyak conjugate gradient method with global convergence property for nonconvex functions 56(16) (pp. 1-11) https://doi.org/10.1007/s10092-019-0312-9
  26. Dai and Yuan (1999) A Nonlinear conjugate gradient method with a strong global convergence property 10(1) (pp. 177-182)
  27. Cheng (2009) A PRP type method for systems of monotone equations (pp. 15-20)
  28. Dai and Kou (2013) A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search (pp. 296-320)
  29. Dai and Yuan (2000) Shanghai Scientific and Technical Publishers
  30. Fletcher and Reeves (1964) Function minimization by conjugate gradients (pp. 149-154)
  31. Fletcher, R.: Practical method of optimization. Volume 1: Unconstrained Optimization, 2nd ed., Wiley, New York, 1997
  32. Liu and Storey (1991) Efficient generalized conjugate gradient algorithms. Part 1: Theory (pp. 129-137)
  33. Cao (2021) A three-term derivative-free projection method for convex constrained monotone equations (pp. 235-240)
  34. Althobaiti et al. (2022) A scaled Dai-Yuan projection-based conjugate gradient method for solving monotone equations with applications https://doi.org/10.3390/sym14071401
  35. Gao et al. (2023) Signal recovery with constrained monotone nonlinear equations 13(4) (pp. 2006-2025)
  36. Koorapetse et al. (2021) A derivative-free RMIL conjugate gradient projection method for convex constrained nonlinear monotone equations with applications in compressive sensing (pp. 431-441)
  37. Hestenes and Stiefel (1952) Methods of conjugate gradients for solving linear systems (pp. 409-436)
  38. Ahmed et al. (2023) On a scaled symmetric Dai-Liao-type scheme for constrained system of nonlinear equations with applications (pp. 669-702) https://doi.org/10.1007/s10957-023-02281-6
  39. Polak (1969) Note Sur la convergence de directions conjug‘ees, (pp. 35-43)
  40. Polyak (1969) The conjugate gradient method in extreme problems (pp. 94-112)
  41. Dong and He (2010) Global convergence of a modified DY conjugate gradient method 31(1)
  42. Dolan and Moré (2002) Benchmarking optimization software with performance profiles 91(2) (pp. 201-2013)
  43. Grippo et al. (1986) A nonmonotone linesearch technique for Newton’s method (pp. 707-716)
  44. Hager and Zhang (2005) A new conjugate gradient method with guaranteed descent and an efficient line search 16(1) (pp. 170-192)
  45. Hager and Zhang (2006) Algorithm 851: CG-Descentdocumentclass[12pt]{minimal}
  46. usepackage{amsmath}
  47. usepackage{wasysym}
  48. usepackage{amsfonts}
  49. usepackage{amssymb}
  50. usepackage{amsbsy}
  51. usepackage{mathrsfs}
  52. usepackage{upgreek}
  53. setlength{oddsidemargin}{-69pt}
  54. begin{document}$$CG_{-}Descent$$end{document}, a conjugate gradient method with guaranteed descent 32(1) (pp. 113-137)
  55. Hager and Zhang (2006) A survey of nonlinear conjugate gradient methods 2(1) (pp. 35-58)
  56. Han et al. (2008) Multivariate spectral gradient method for unconstrained optimization (pp. 621-630)
  57. Liu and Feng (2018) A derivative-free iterative method for nonlinear monotone equations with convex constraints https://doi.org/10.1007/s11075-018-0603-2
  58. Liu and Li (2017) Multivariate spectral projection method for convex constrained nonlinear monotone equations 13(1) (pp. 283-297)
  59. Liu et al. (2012) A mixed spectral conjugate descent-Dai-Yuan conjugate gradient method
  60. Amini and Kamandi (2015) A new line search strategy for finding separating hyperplane in projection-based methods 70(3) (pp. 559-570)
  61. Koorapetse et al. (2018) A scaled derivative-Free projection method for solving nonlinear monotone equations 45(3) (pp. 755-770)
  62. Li and Fukushima (2000) A derivative-free linesearch and global convergence of Broyden-like method for nonlinear equations (pp. 583-599)
  63. Liu and Li (2015) A projection method for convex constrained monotone nonlinear equations with applications 70(10) (pp. 2442-2453)
  64. Yu et al. (2013) Multivariate spectral gradient projection method for nonlinear monotone equations with convex constraints 9(1) (pp. 117-129)
  65. Livieris and Pintelas (2012) Globally convergent modified Perrys conjugate gradient method (pp. 9197-9207)
  66. Dai (2001) New properties of a nonlinear conjugate gradient method (pp. 83-98)
  67. Mompati et al. (2018) Globally convergent three-term conjugate gradient projection methods for solving nonlinear monotone equations 7(4) (pp. 289-301)
  68. Gao and He (2018) An efficient three-term conjugate gradient methodfor nonlinear monotone equations with convex constraints https://doi.org/10.1007/s10092-018-0291-2
  69. Perry (1978) A modified conjugate gradient algorithm 26(6) (pp. 1073-1078)
  70. Polak (1969) The conjugate gradient method in extreme problems (pp. 94-112)
  71. Polak and Ribière (1969) Note sur la convergence de méthodes de directions conjuguées (pp. 35-43)
  72. Shiker and Amini (2018) A new projection-based algorithm for solving a large-scale nonlinear system of nonlinear equations (pp. 63-73)
  73. Solodov, M.V., Svaiter, B.F.: A globally convergent inexact Newton method for systems of monotone equations. In: Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, Springer. 355-369(1999)
  74. La cruz, W., Martinez, J.M., Raydan, M.: Spectral residual method without gradient information for solving large-scale nonlinear systems of equations: Theory and experiments, Technical Report RT-04-08, (2004)
  75. Sun and Yuan (2006) Springer
  76. Waziri et al. (2020) A Dai-Liao conjugate gradient method via modified secant equation for system of nonlinear equations (pp. 443-457)
  77. Waziri et al. (2019) A family of Hager-Zhang conjugate gradient methods for system of monotone nonlinear equations (pp. 645-660)
  78. Sabi’u et al. (2020) Modified Hager-Zhang conjugate gradient methods via singular value analysis for solving monotone nonlinear equations with convex constraint https://doi.org/10.1142/S0219876220500437
  79. Waziri et al. (2020) Modified matrix-free methods for solving systems of nonlinear equations https://doi.org/10.1080/02331934.2020.1778689
  80. Waziri (2022) Ahmed, K: Two descent Dai-Yuan conjugate gradient methods for systems of monotone nonlinear equations 90(36) https://doi.org/10.1007/s10915-021-01713-7
  81. Halilu et al. (2021) On solving double direction methods for convex constrained monotone nonlinear equations with image restoration
  82. Halilu et al. (2022) Motion control of the two joint planar robotic manipulators through accelerated Dai-Liao method for solving system of nonlinear equations (pp. 1802-1840) https://doi.org/10.1108/EC-06-2021-0317
  83. Ahmed et al. (2024) Signal and image reconstruction with a double parameter Hager-Zhang-type conjugate gradient method for system of nonlinear equations https://doi.org/10.1002/nla.2583
  84. Ahmed et al. (2024) Another Hager-Zhang-type method via singular value study for constrained monotone system equations with application 96(4) (pp. 1583-1623)
  85. Ahmed et al. (2023) Sparse signal reconstruction via Hager-Zhang-type schemes for constrained system of nonlinear equations (pp. 1949-1980) https://doi.org/10.1080/02331934.2023.2187255
  86. Waziri et al. (2022) A modified PRP-type conjugate gradient projection algorithm for solving large-scale monotone nonlinear equations with convex constraint
  87. Waziri et al. (2023) Modified Dai-Yuan iterative scheme for nonlinear systems and its application (pp. 53-80) https://doi.org/10.3934/naco.2021044
  88. Waziri et al. (2022) Adaptive three-term family of conjugate residual methods for system of monotone nonlinear equations (pp. 957-996)
  89. Waziri et al. (2022) A modified Dai-Kou-type method with applications to signal reconstruction and blurred image restoration 41(232) (pp. 1-33) https://doi.org/10.1007/s40314-022-01917-z
  90. Waziri et al. (2021) Two new Hager-Zhang iterative schemes with improved parameter choices for monotone nonlinear systems and their applications in compressed sensing https://doi.org/10.1051/ro/2021190
  91. Ahmed et al. (2023) On two symmetric Dai-Kou type schemes for constrained monotone equations with image recovery application https://doi.org/10.1016/j.ejco.2023.100057
  92. Yu et al. (2008) Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization 23(2) (pp. 275-293)
  93. Waziri et al. (2020) Descent Perry conjugate gradient methods for systems of monotone nonlinear equations (pp. 763-785)
  94. Waziri et al. (2020) Enhanced Dai-Liao conjugate gradient methods for systems of monotone nonlinear equations (pp. 15-51)
  95. Liu and Li (2015) Spectral DY-type projection methods for nonlinear monotone system of equations (pp. 341-355)
  96. Xue et al. (2018) Liang: A new DY conjugate gradient method and applications to image denoising 101(12) (pp. 2984-90)
  97. Yu (2010) A derivative-free method for solving large-scale nonlinear systems of equations (pp. 149-160)
  98. Yu (2011) Nonmonotone spectral gradient-type methods for large-scale unconstrained optimization and nonlinear systems of equations (pp. 387-404)
  99. Zhao, R., Jiao, B.: A modified Dai-Yuan conjugate gradient algorithm with sufficient Descent. Fifth International Joint Conference on Computational Sciences and Optimization, (2012)
  100. Narushima and Yabe (2014) A survey of sufficient descent conjugate gradient methods for unconstrained optimization 50(2) (pp. 167-203)
  101. Zhang and Zhou (2006) Spectral gradient projection method for solving nonlinear monotone equations (pp. 478-484)
  102. Zhou and Lu (2016) The global convergence of modified DY conjugate gradient methods under the wolfe line search 33(3) (pp. 6-10)
  103. Zhou and Wang (2015) A PRP-based residual method for large-scale monotone nonlinear equations (pp. 1-7)
  104. Zhu et al. (2020) Two modified DY conjugate gradient methods for unconstrained optimization problems 373(2020)
  105. Halilu et al. (2021) Signal recovery with convex constrained nonlinear monotone equations through conjugate gradient hybrid approach https://doi.org/10.1016/j.matcom.2021.03.020
  106. Nermeh et al. (2024) Modification of a conjugate gradient approach for convex constrained nonlinear monotone equations with applications in signal recovery and image restoration
  107. Salihu, S.B., Halilu, A.S., Abdullahi, M., Ahmed, K., Mehta, P., Murtala,S.: An improved spectral conjugate gradient projection method for monotone nonlinear equations with application, J. Appl. Math. Comput. 1–37