Iterative grossone-based computation of negative curvature directions in large-scale optimization
From MaRDI portal
Publication:2194128
DOI10.1007/s10957-020-01717-7zbMath1450.90009OpenAlexW3046263807MaRDI QIDQ2194128
Renato De Leone, Giovanni Fasano, Yaroslav D. Sergeyev, Massimo Roma
Publication date: 25 August 2020
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-020-01717-7
conjugate gradient methodgrossonesecond-order necessary optimality conditionsnegative curvature directions
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)
Related Items
Non-standard analysis revisited: an easy axiomatic presentation oriented towards numerical applications, Spherical separation with infinitely far center, Lower and upper estimates of the quantity of algebraic numbers, A new cutting plane method for lexicographic multi-objective integer linear programming, Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives, Computation of higher order Lie derivatives on the infinity computer, Noise-induced kinetic transition in two-component environment, Polarity and conjugacy for quadratic hypersurfaces: a unified framework with recent advances, Non-Archimedean zero-sum games
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Metamathematical investigations on the theory of grossone
- Numerical point of view on calculus for functions assuming finite, infinite, and infinitesimal values over finite, infinite, and infinitesimal domains
- The use of grossone in mathematical programming and operations research
- Computing sums of conditionally convergent and divergent series using the concept of grossone
- Higher order numerical differentiation on the infinity computer
- A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization
- Fibonacci words, hyperbolic tilings and grossone
- Taking the Pirahã seriously
- Lanczos conjugate-gradient method and pseudoinverse computation on indefinite and singular systems
- A survey of truncated-Newton methods
- Using negative curvature in solving nonlinear programs
- Conjugate direction methods and polarity for quadratic hypersurfaces
- Using grossone to count the number of elements of infinite sets and the connection with bijections
- Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming
- Nonmonotone curvilinear line search methods for unconstrained optimization
- Conjugate-symplecticity properties of Euler-Maclaurin methods and their implementation on the infinity computer
- Multistart with early termination of descents
- Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology
- On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales
- The exact measures of the Sierpiński \(d\)-dimensional tetrahedron in connection with a Diophantine nonlinear system
- A generalized Taylor method of order three for the solution of initial value problems in standard and infinity floating-point arithmetic
- Independence of the grossone-based infinity methodology from non-standard analysis and comments upon logical fallacies in some texts asserting the opposite
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Numerical infinities and infinitesimals: methodology, applications, and repercussions on two Hilbert problems
- Nonlinear programming and grossone: quadratic programing and the role of constraint qualifications
- Lexicographic multi-objective linear programming using grossone methodology: theory and algorithm
- Numerical infinitesimals in a variable metric method for convex nonsmooth optimization
- The Sierpinski curve viewed by numerical computations with infinities and infinitesimals
- Exploiting negative curvature in deterministic and stochastic optimization
- Iterative computation of negative curvature directions in large scale optimization
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application
- Counting systems and the first Hilbert problem
- Curvilinear path steplength algorithms for minimization which use directions of negative curvature
- Solution of Sparse Indefinite Systems of Linear Equations
- A modification of Armijo's step-size rule for negative curvature
- On the use of directions of negative curvature in a modified newton method
- Curvilinear Stabilization Techniques for Truncated Newton Methods in Large Scale Unconstrained Optimization
- Exploiting negative curvature directions in linesearch methods for unconstrained optimization
- Conjugate gradient (CG)-type method for the solution of Newton's equation within optimization frameworks
- A Simulink-Based Infinity Computer Simulator and Some Applications
- A Study of Mathematical Determination through Bertrand’s Paradox
- Methods of conjugate gradients for solving linear systems
- Benchmarking optimization software with performance profiles.
