Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes
DOI10.1016/j.amc.2017.06.036zbMath1426.90204OpenAlexW2738207903MaRDI QIDQ2422874
Ruslan Israfilov, Yaroslav D. Sergeyev, Vladimir A. Grishagin
Publication date: 21 June 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2017.06.036
global optimizationconvergencenumerical methodsdimensionality reductioncomparison of efficiencymultiextremal functions
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)
Related Items (18)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel global optimization on GPU
- Adaptive nested optimization scheme for multidimensional global search
- Lipschitz global optimization methods in control problems
- P-algorithm based on a simplicial statistical model of multimodal functions
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
- Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization
- A deterministic global optimization using smooth diagonal auxiliary functions
- Lipschitz and Hölder global optimization using space-filling curves
- A global optimization technique for checking parametric robustness
- Lipschitzian optimization without the Lipschitz constant
- Handbook of global optimization
- Parallel characteristical algorithms for solving problems of global optimization
- Local tuning and partition strategies for diagonal GO methods
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Global minimization algorithms for Hölder functions
- Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- Global optimization of Hölder functions
- A deterministic approach to global box-constrained optimization
- On similarities between two models of global optimization: Statistical models and radial basis functions
- Global optimization with space-filling curves.
- Globally-biased disimpl algorithm for expensive global optimization
- One-dimensional nested maximin designs
- Stochastic global optimization.
- Introduction to Global Optimization Exploiting Space-Filling Curves
- Simplicial Global Optimization
- The information approach to multiextremal optimization problems
- Nested Partitions Method for Global Optimization
- Two Methods for Solving Optimization Problems Arising in Electronic Measurements and Electrical Engineering
- An algorithm for finding the absolute extremum of a function
- Algorithm 829
- Space filling curves and mathematical programming
This page was built for publication: Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes