Abstract
A regularized Newton method is presented in this paper to solve unconstrained nonconvex minimization problems without the nonsingularity assumption of solutions. The modified Cholesky factorization method proposed by Cheng and Higham is employed to calculate the regularized Newton step. Under suitable conditions, the global convergence of the regularized Newton method is established, and the fast local convergence result is achieved under the local error bound conditions. Some preliminary numerical results are also reported.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
