A Modified Newton Method for Unconstrained Convex Optimization
Liu Hailin
Abstract
Liu Hailin
Abstract
In this paper , we provide a new method through modifying the iterative matrix of Newton method . For this modification, we prove general local convergence results .The new method improves the condition number of the Hessian. The numeric results shows that the new method avoid the singular phenomenon.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper , we provide a new method through modifying the iterative matrix of Newton method . For this modification, we prove general local convergence results .The new method improves the condition number of the Hessian. The numeric results shows that the new method avoid the singular phenomenon.
Key concepts: Hessian matrix, Convergence (economics), Newton's method, Local convergence, Mathematical optimization, Iterative method, Quasi-Newton method, Newton's method in optimization