Derivative-free SMR conjugate gradient method for constraint nonlinear equations

Abdulkarim Hassan Ibrahim, Kanikar Muangchoo*, Nur Syarafina Mohamed, Auwal Bala Abubakard

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)

Abstract

Based on the SMR conjugate gradient method for unconstrained optimization proposed by Mohamed et al. [N. S. Mohamed, M. Mamat, M. Rivaie, S. M. Shaharuddin, Indones. J. Electr. Eng. Comput. Sci., 11 (2018), 1188-1193] and the Solodov and Svaiter projection technique, we propose a derivative-free SMR method for solving nonlinear equations with convex constraints. The proposed method can be viewed as an extension of the SMR method for solving unconstrained optimization. The proposed method can be used to solve large-scale nonlinear equations with convex constraints because of derivative-free and low storage. Under the assumption that the underlying mapping is Lipschitz continuous and satisfies a weaker monotonicity assumption, we prove its global convergence. Preliminary numerical results show that the proposed method is promising.

Original languageEnglish
Pages (from-to)147-164
Number of pages18
JournalJournal of Mathematics and Computer Science
Volume24
Issue number2
DOIs
Publication statusPublished - 2022
Externally publishedYes

Keywords

  • Conjugate gradient method
  • Global convergence
  • Nonlinear equations
  • Projection method

Fingerprint

Dive into the research topics of 'Derivative-free SMR conjugate gradient method for constraint nonlinear equations'. Together they form a unique fingerprint.

Cite this