Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/28042
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAbdulkarim Hassan Ibrahim-
dc.contributor.authorKanikar Muangchoo-
dc.contributor.authorNur Syarafina Mohamed-
dc.contributor.authorAuwal Bala Abubakar-
dc.contributor.author(UniKL MITEC)-
dc.date.accessioned2023-07-05T03:01:48Z-
dc.date.available2023-07-05T03:01:48Z-
dc.date.issued2023-07-05-
dc.identifier.urihttp://hdl.handle.net/123456789/28042-
dc.descriptionThis article is index by Scopus.en_US
dc.description.abstractBased 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.subjectNonlinear equationsen_US
dc.subjectconjugate gradient methoden_US
dc.subjectprojection methoden_US
dc.subjectglobal convergenceen_US
dc.titleDerivative-free SMR conjugate gradient method for constraint nonlinear equationsen_US
Appears in Collections:Journal Articles

Files in This Item:
File Description SizeFormat 
6 Derivative-free SMR conjugate gradient method for constraint nonlinear equations.pdf32.12 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.