Iterative grossone-based computation of negative curvature directions in large-scale optimization (Q2194128): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 09:22, 28 December 2024

scientific article

Language	Label	Description	Also known as
English	Iterative grossone-based computation of negative curvature directions in large-scale optimization	scientific article

Statements

scholarly article

0 references

Iterative grossone-based computation of negative curvature directions in large-scale optimization (English)

0 references

Renato De Leone

0 references

Giovanni Fasano

0 references

Yaroslav D. Sergeyev

0 references

0 references

Journal of Optimization Theory and Applications

0 references

publication date

25 August 2020

0 references

zbMATH Keywords

negative curvature directions

0 references

second-order necessary optimality conditions

0 references

grossone

0 references

conjugate gradient method

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10957-020-01717-7

0 references

Nonmonotone curvilinear line search methods for unconstrained optimization

0 references

Curvilinear path steplength algorithms for minimization which use directions of negative curvature

0 references

Exploiting negative curvature directions in linesearch methods for unconstrained optimization

0 references

Using negative curvature in solving nonlinear programs

0 references

Curvilinear Stabilization Techniques for Truncated Newton Methods in Large Scale Unconstrained Optimization

0 references

A modification of Armijo's step-size rule for negative curvature

0 references

On the use of directions of negative curvature in a modified newton method

0 references

Exploiting negative curvature in deterministic and stochastic optimization

0 references

Iterative computation of negative curvature directions in large scale optimization

0 references

A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization

0 references

Methods of conjugate gradients for solving linear systems

0 references

Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming

0 references

Numerical infinities and infinitesimals: methodology, applications, and repercussions on two Hilbert problems

0 references

Conjugate gradient (CG)-type method for the solution of Newton's equation within optimization frameworks

0 references

Metamathematical investigations on the theory of grossone

0 references

Using grossone to count the number of elements of infinite sets and the connection with bijections

0 references

Taking the Pirahã seriously

0 references

Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology

0 references

Lexicographic multi-objective linear programming using grossone methodology: theory and algorithm

0 references

The use of grossone in mathematical programming and operations research

0 references

Nonlinear programming and grossone: quadratic programing and the role of constraint qualifications

0 references

Numerical infinitesimals in a variable metric method for convex nonsmooth optimization

0 references

On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales

0 references

The Sierpinski curve viewed by numerical computations with infinities and infinitesimals

0 references

Numerical point of view on calculus for functions assuming finite, infinite, and infinitesimal values over finite, infinite, and infinitesimal domains

0 references

Computing sums of conditionally convergent and divergent series using the concept of grossone

0 references

The exact measures of the Sierpiński \(d\)-dimensional tetrahedron in connection with a Diophantine nonlinear system

0 references

0 references

A Simulink-Based Infinity Computer Simulator and Some Applications

0 references

Fibonacci words, hyperbolic tilings and grossone

0 references

Counting systems and the first Hilbert problem

0 references

A Study of Mathematical Determination through Bertrand’s Paradox

0 references

A generalized Taylor method of order three for the solution of initial value problems in standard and infinity floating-point arithmetic

0 references

Higher order numerical differentiation on the infinity computer

0 references

Conjugate-symplecticity properties of Euler-Maclaurin methods and their implementation on the infinity computer

0 references

Independence of the grossone-based infinity methodology from non-standard analysis and comments upon logical fallacies in some texts asserting the opposite

0 references

0 references

Solution of Sparse Indefinite Systems of Linear Equations

0 references

Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory

0 references

Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application

0 references

Lanczos conjugate-gradient method and pseudoinverse computation on indefinite and singular systems

0 references

A survey of truncated-Newton methods

0 references

0 references

Conjugate direction methods and polarity for quadratic hypersurfaces

0 references

CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization

0 references

Benchmarking optimization software with performance profiles.

0 references

Multistart with early termination of descents

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1007/S10957-020-01717-7

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2194128

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2194128&oldid=39380378"