Adaptive global optimization based on a block-recursive dimensionality reduction scheme
From MaRDI portal
Publication:828539
DOI10.1134/S0005117920080093zbMath1457.90117OpenAlexW3091438572MaRDI QIDQ828539
K. A. Barkalov, Victor P. Gergel, Roman G. Strongin
Publication date: 9 January 2021
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0005117920080093
global optimizationdimensionality reductionPeano curvesmultiextremal objective functionsrecursive optimization
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Adaptive nested optimization scheme for multidimensional global search
- Lipschitz global optimization methods in control problems
- Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
- Parallel multiextremum optimization using a set of Peano curves
- On a uniform estimate of the set of weakly effective points in multi- criterion multi-extremal optimization problems
- Lipschitzian optimization without the Lipschitz constant
- Parallel characteristical algorithms for solving problems of global optimization
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- A deterministic approach to global box-constrained optimization
- Comparison of several stochastic and deterministic derivative-free global optimization algorithms
- Metaheuristic vs. deterministic global optimization algorithms: the univariate case
- Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes
- Parallelization of the global extremum searching process
- Search for the extremum of functions by the principle of maximum information
- Multi-extremal minimization
- BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
- A method for solving multi-extremal problems with non-convex constraints, that uses a priori information about estimates of the optimum
- An algorithm for finding the absolute extremum of a function
- Algorithm 829
- A Sequential Method Seeking the Global Maximum of a Function
- Numerical methods for finding global extrema (Case of a non-uniform mesh)
- Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
