Asset Details
Do you wish to reserve the book?
Global convergence in a hybrid conjugate gradient projection method for finding solutions of constrained nonlinear equations with applications
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Global convergence in a hybrid conjugate gradient projection method for finding solutions of constrained nonlinear equations with applications
Do you wish to request the book?
Global convergence in a hybrid conjugate gradient projection method for finding solutions of constrained nonlinear equations with applications
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Global convergence in a hybrid conjugate gradient projection method for finding solutions of constrained nonlinear equations with applications
2025
Overview
In this paper, a hybrid conjugate gradient projection method for finding solutions of constrained nonlinear equations is proposed by integrating both hyperplane projection and hybrid techniques. The key features of this method are as follows: (1) It is characterized by a low storage requirement and relies solely on function values; (2) The designed search direction ensures the sufficient descent property without the need for line search approaches; (3) Under certain reasonable assumptions, the global convergence of the method is established; (4) Experimental results demonstrate that the proposed method outperforms the two existing methods about 75.71%, 85.36%, and 86.43% of benchmark problems in terms of CPU time, the number of function evaluations, and iterations. Furthermore, it is applied to successfully solve the sparse signal restoration problems.
Publisher
Public Library of Science,Public Library of Science (PLoS)
