How grossone can be helpful to iteratively compute negative curvature directions

0Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider an iterative computation of negative curvature directions, in large scale optimization frameworks. We show that to the latter purpose, borrowing the ideas in [1, 3] and [4], we can fruitfully pair the Conjugate Gradient (CG) method with a recently introduced numerical approach involving the use of grossone [5]. In particular, though in principle the CG method is well-posed only on positive definite linear systems, the use of grossone can enhance the performance of the CG, allowing the computation of negative curvature directions, too. The overall method in our proposal significantly generalizes the theory proposed for [1] and [3], and straightforwardly allows the use of a CG-based method on indefinite Newton’s equations.

Cite

CITATION STYLE

APA

De Leone, R., Fasano, G., Roma, M., & Sergeyev, Y. D. (2019). How grossone can be helpful to iteratively compute negative curvature directions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11353 LNCS, pp. 180–183). Springer Verlag. https://doi.org/10.1007/978-3-030-05348-2_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free