Abstract | ||
---|---|---|
In this work we propose a class of quasi-Newton methods to minimize a twice differentiable function with Lipschitz continuous Hessian. These methods are based on the quadratic regularization of Newton's method, with algebraic explicit rules for computing the regularizing parameter. The convergence properties of this class of methods are analysed. We show that if the sequence generated by the algorithm converges then its limit point is stationary. We also establish local quadratic convergence in a neighborhood of a stationary point with positive definite Hessian. Encouraging numerical experiments are presented. |
Year | DOI | Venue |
---|---|---|
2015 | 10.1007/s10589-014-9671-y | Computational Optimization and Applications |
Keywords | Field | DocType |
Smooth unconstrained minimization,Newton’s method,Regularization,Global convergence,Local convergence,Computational results,90C30,90C53,49M15 | Mathematical optimization,Quasi-Newton method,Mathematical analysis,Hessian matrix,Stationary point,Newton's method in optimization,Rate of convergence,Lipschitz continuity,Local convergence,Mathematics,Newton's method | Journal |
Volume | Issue | ISSN |
60 | 2 | 0926-6003 |
Citations | PageRank | References |
5 | 0.48 | 10 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Elizabeth W. Karas | 1 | 51 | 5.82 |
Sandra A. Santos | 2 | 168 | 21.53 |
B. F. Svaiter | 3 | 608 | 72.74 |