Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5128334 | Operations Research Letters | 2017 | 5 Pages |
Abstract
In the context of the minimization of a real function, we propose a line search scheme that involves a new positive definite modification of the Hessian. In this framework, a safeguard based on GersÌgorin Circle's theorem provides an approximation of the Hessian that improves with iteration count. Convergence analysis of the scheme is validated by numerical experiments.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Suvra Kanti Chakraborty, Geetanjali Panda,