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

DOI10.1016/j.cnsns.2017.11.013OpenAlexW2770331402MaRDI QIDQ2205849

Dmitri E. Kvasov, Marat S. Mukhametzhanov, Yaroslav D. Sergeyev

Publication date: 21 October 2020

Published in: Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1801.05306

zbMATH Keywords

Lipschitz global optimizationill-conditioned problemsnumerical infinities and infinitesimalsstrongly homogeneous methods

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Operations research and management science (90Bxx) Operations research, mathematical programming (90-XX)

Related Items (26)

Some paradoxes of infinity revisited ⋮ Novel first and second order numerical differentiation techniques and their application to nonlinear analysis of Kirchhoff-Love shells ⋮ On the use of the infinity computer architecture to set up a dynamic precision floating-point arithmetic ⋮ A constructive sequence algebra for the calculus of indications ⋮ The use of grossone in elastic net regularization and sparse support vector machines ⋮ Safe global optimization of expensive noisy black-box functions in the \(\delta \)-Lipschitz framework ⋮ Spherical separation with infinitely far center ⋮ Observability in the univalent universe ⋮ Iterative grossone-based computation of negative curvature directions in large-scale optimization ⋮ 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 ⋮ Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology ⋮ A Dynamic Precision Floating-Point Arithmetic Based on the Infinity Computer Framework ⋮ Grossone Methodology for Lexicographic Mixed-Integer Linear Programming Problems ⋮ A Simulink-Based Infinity Computer Simulator and Some Applications ⋮ On Acceleration of Derivative-Free Univariate Lipschitz Global Optimization Methods ⋮ Noise-induced kinetic transition in two-component environment ⋮ The big-M method with the numerical infinite \(M\) ⋮ Unnamed Item ⋮ Conjugate-symplecticity properties of Euler-Maclaurin methods and their implementation on the infinity computer ⋮ Non-Archimedean game theory: a numerical approach ⋮ A Simulink-based software solution using the infinity computer methodology for higher order differentiation ⋮ On the search of the shape parameter in radial basis functions using univariate global optimization methods ⋮ The DIRECT algorithm: 25 years later ⋮ Independence of the grossone-based infinity methodology from non-standard analysis and comments upon logical fallacies in some texts asserting the opposite

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adaptive nested optimization scheme for multidimensional global search
• 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
• Cellular automata using infinite computations
• On strong homogeneity of two global optimization algorithms based on statistical models of multimodal objective functions
• Higher order numerical differentiation on the infinity computer
• Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization
• Fibonacci words, hyperbolic tilings and grossone
• Axiomatic characterization of a global optimization algorithm and investigation of its search strategy
• Lipschitzian optimization without the Lipschitz constant
• A parallel method for finding the global minimum of univariate functions
• A generalized Taylor method of order three for the solution of initial value problems in standard and infinity floating-point arithmetic
• Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms
• A hybrid global optimization algorithm for nonlinear least squares regression
• Numerical infinities and infinitesimals: methodology, applications, and repercussions on two Hilbert problems
• Metaheuristic vs. deterministic global optimization algorithms: the univariate case
• Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes
• 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
• Stochastic global optimization.
• Introduction to Global Optimization Exploiting Space-Filling Curves
• Simplicial Global Optimization
• Homogeneous algorithms for multiextremal optimization
• Encyclopedia of Optimization
• A new applied approach for executing computations with infinite and infinitesimal quantities
• An algorithm for finding the absolute extremum of a function
• On convergence of "divide the best" global optimization algorithms
• Deterministic Global Optimization

This page was built for publication: On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales