A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization

E. G. Birgin () and J. M. Martínez ()
Additional contact information
E. G. Birgin: University of São Paulo
J. M. Martínez: State University of Campinas

Computational Optimization and Applications, 2019, vol. 73, issue 3, No 1, 707-753

Abstract: Abstract A Newton-like method for unconstrained minimization is introduced in the present work. While the computer work per iteration of the best-known implementations may need several factorizations or may use rather expensive matrix decompositions, the proposed method uses a single cheap factorization per iteration. Convergence and complexity and results, even in the case in which the subproblems’ Hessians are far from being Hessians of the objective function, are presented. Moreover, when the Hessian is Lipschitz-continuous, the proposed method enjoys $$O(\varepsilon ^{-3/2})$$ O ( ε - 3 / 2 ) evaluation complexity for first-order optimality and $$O(\varepsilon ^{-3})$$ O ( ε - 3 ) for second-order optimality as other recently introduced Newton method for unconstrained optimization based on cubic regularization or special trust-region procedures. Fairly successful and fully reproducible numerical experiments are presented and the developed corresponding software is freely available.

Keywords: Smooth unconstrained minimization; Bunch–Parlett–Kaufman factorizations; Regularization; Newton-type methods (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10589-019-00089-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:73:y:2019:i:3:d:10.1007_s10589-019-00089-7

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-019-00089-7

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().