DSpace Repository

Derivative-free SMR conjugate gradient method for constraint nonlinear equations

Show simple item record

dc.contributor.author Abdulkarim Hassan Ibrahim
dc.contributor.author Kanikar Muangchoo
dc.contributor.author Nur Syarafina Mohamed
dc.contributor.author Auwal Bala Abubakar
dc.contributor.author (UniKL MITEC)
dc.date.accessioned 2023-07-05T03:01:48Z
dc.date.available 2023-07-05T03:01:48Z
dc.date.issued 2023-07-05
dc.identifier.uri http://hdl.handle.net/123456789/28042
dc.description This article is index by Scopus. en_US
dc.description.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. en_US
dc.subject Nonlinear equations en_US
dc.subject conjugate gradient method en_US
dc.subject projection method en_US
dc.subject global convergence en_US
dc.title Derivative-free SMR conjugate gradient method for constraint nonlinear equations en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account