How Grossone Can Be Helpful to Iteratively Compute Negative Curvature Directions
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 , we can fruitfully pair the Conjugate Gradient (CG) method with a recently introduced numerical approach involving the use of grossone . 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  and , and straightforwardly allows the use of a CG-based method on indefinite Newton’s equations.
KeywordsNegative curvature directions Second order necessary optimality conditions Grossone Conjugate gradient method
- 1.Fasano, G.: Conjugate Gradient (CG)-type method for the solution of Newton’s equation within optimization frameworks. Optim. Methods Softw. 19(3–4), 267–290 (2004)Google Scholar
- 4.De Leone, R., Fasano, G., Sergeyev, Y.D.: Planar methods and grossone for the Conjugate Gradient breakdown in nonlinear programming. Comput. Optim. Appl. 71(1), 73–93 (2018)Google Scholar
- 6.De Leone, R.: Nonlinear programming and grossone: quadratic programming and the role of constraint qualifications. Appl. Math. Comput. 318, 290–297 (2018)Google Scholar
- 7.Gaudioso, M., Giallombardo, G., Mukhametzhanov, M.: Numerical infinitesimals in a variable metric method for convex nonsmooth optimization. Appl. Math. Comput. 318, 312–320 (2018)Google Scholar