Adaptive global optimization based on a block-recursive dimensionality reduction scheme
From MaRDI portal
Recommendations
- Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes
- Adaptive nested optimization scheme for multidimensional global search
- scientific article; zbMATH DE number 2205701
- Globally convergent methods for n-dimensional multiextremal optimization
- Multidimensional global optimization using numerical estimates of objective function derivatives
Cites work
- scientific article; zbMATH DE number 3718485 (Why is no real title available?)
- scientific article; zbMATH DE number 1971078 (Why is no real title available?)
- A Sequential Method Seeking the Global Maximum of a Function
- A deterministic approach to global box-constrained optimization
- A method for solving multi-extremal problems with non-convex constraints, that uses a priori information about estimates of the optimum
- Adaptive nested optimization scheme for multidimensional global search
- Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
- Algorithm 829
- An algorithm for finding the absolute extremum of a function
- BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
- Comparison of several stochastic and deterministic derivative-free global optimization algorithms
- Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
- Lipschitz global optimization methods in control problems
- Lipschitzian optimization without the Lipschitz constant
- Metaheuristic vs. deterministic global optimization algorithms: the univariate case
- Multi-extremal minimization
- Numerical methods for finding global extrema (Case of a non-uniform mesh)
- On a uniform estimate of the set of weakly effective points in multi- criterion multi-extremal optimization problems
- Parallel characteristical algorithms for solving problems of global optimization
- Parallel multiextremum optimization using a set of Peano curves
- Parallelization of the global extremum searching process
- Search for the extremum of functions by the principle of maximum information
Cited in
(7)- Reducing dimension in global optimization
- Adaptive nested optimization scheme for multidimensional global search
- scientific article; zbMATH DE number 2205701 (Why is no real title available?)
- Parallel global search algorithm with local tuning for solving mixed-integer global optimization problems
- Multidimensional global optimization using numerical estimates of objective function derivatives
- Globally convergent methods for n-dimensional multiextremal optimization
- Optimal maximization and approximation algorithms for approximately calculated functions of many variables
This page was built for publication: Adaptive global optimization based on a block-recursive dimensionality reduction scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q828539)
