Open Journal of Optimization

Volume 5, Issue 1 (March 2016)

ISSN Print: 2325-7105   ISSN Online: 2325-7091

Google-based Impact Factor: 0.33  Citations  

A Regularized Newton Method with Correction for Unconstrained Convex Optimization

HTML  XML Download Download as PDF (Size: 365KB)  PP. 44-52  
DOI: 10.4236/ojop.2016.51006    2,873 Downloads   4,052 Views  Citations
Author(s)

ABSTRACT

In this paper, we present a regularized Newton method (M-RNM) with correction for minimizing a convex function whose Hessian matrices may be singular. At every iteration, not only a RNM step is computed but also two correction steps are computed. We show that if the objective function is LC2, then the method posses globally convergent. Numerical results show that the new algorithm performs very well.

Share and Cite:

Li, L. , Qin, M. and Wang, H. (2016) A Regularized Newton Method with Correction for Unconstrained Convex Optimization. Open Journal of Optimization, 5, 44-52. doi: 10.4236/ojop.2016.51006.

Cited by

[1] Efficient regularized Newton-type algorithm for solving convex optimization problem
Journal of Applied Mathematics and Computing, 2022

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.