On strong homogeneity of two global optimization algorithms based on statistical models of multimodal objective functions
From MaRDI portal
Publication:440675
DOI10.1016/j.amc.2011.07.051zbMath1245.90094arXiv1108.1042OpenAlexW2116117196MaRDI QIDQ440675
Publication date: 19 August 2012
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.1042
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Stochastic programming (90C15)
Related Items (26)
On local search in d.c. optimization problems ⋮ Simulation of hybrid systems under Zeno behavior using numerical infinitesimals ⋮ Some paradoxes of infinity revisited ⋮ On the use of the infinity computer architecture to set up a dynamic precision floating-point arithmetic ⋮ On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization ⋮ Computations with Grossone-Based Infinities ⋮ Infinite numerical computing applied to Hilbert's, Peano's, and Moore's curves ⋮ 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 ⋮ The Olympic medals ranks, lexicographic ordering, and numerical infinities ⋮ The exact (up to infinitesimals) infinite perimeter of the Koch snowflake and its finite area ⋮ On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales ⋮ A new approach to the \(Z\)-transform through infinite computation ⋮ The exact measures of the Sierpiński \(d\)-dimensional tetrahedron in connection with a Diophantine nonlinear system ⋮ Solving ordinary differential equations on the Infinity Computer by working with infinitesimals numerically ⋮ A generalized Taylor method of order three for the solution of initial value problems in standard and infinity floating-point arithmetic ⋮ Application of reduced-set Pareto-Lipschitzian optimization to truss optimization ⋮ A Simulink-based software solution using the infinity computer methodology for higher order differentiation ⋮ Improving the convergence rate of the DIRECT global optimization algorithm ⋮ Simplicial Lipschitz optimization without the Lipschitz constant ⋮ Globally-biased disimpl algorithm for expensive global optimization ⋮ The DIRECT algorithm: 25 years later ⋮ Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming ⋮ Branch and probability bound methods in multi-objective optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Numerical computations and mathematical modelling with infinite and infinitesimal numbers
- Axiomatic characterization of a global optimization algorithm and investigation of its search strategy
- Lipschitzian optimization without the Lipschitz constant
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- On similarities between two models of global optimization: Statistical models and radial basis functions
- Stochastic global optimization.
- Homogeneous algorithms for multiextremal optimization
- Methodology of Numerical Computations with Infinities and Infinitesimals
- Small Sample Estimation of Parameters for Wiener Process with Noise
- A new applied approach for executing computations with infinite and infinitesimal quantities
- Axiomatic approach to statistical models and their use in multimodal optimization theory
- Global optimization
- A radial basis function method for global optimization
This page was built for publication: On strong homogeneity of two global optimization algorithms based on statistical models of multimodal objective functions
