Efficiency of a Global Optimization Algorithm
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4066243
- scientific article; zbMATH DE number 3965348
- scientific article; zbMATH DE number 804619
- Interval tools for global optimization
- scientific article; zbMATH DE number 4076484
- scientific article; zbMATH DE number 1543292
- Bounding the set of solutions of a perturbed global optimization problem
- Conditions for boundedness in concave programming under reverse convex and convex constraints
- On an efficient use of gradient information for accelerating interval global optimization algorithms
- scientific article; zbMATH DE number 852342
Cited in
(11)- What can interval analysis do for global optimization?
- The method of global optimization of a function and estimation of the speed of its convergence
- The convergence speed of interval methods for global optimization
- The impact of accelerating tools on the interval subdivision algorithm for global optimization
- On an efficient use of gradient information for accelerating interval global optimization algorithms
- Arbitrarily slow convergence of sequences of linear operators: a survey
- On the asymptotic tractability of global optimization
- Survey of modeling and optimization strategies to solve high-dimensional design problems with computationally-expensive black-box functions
- scientific article; zbMATH DE number 524102 (Why is no real title available?)
- A new interval method for locating the boundary of level sets
- Interval tools for global optimization
This page was built for publication: Efficiency of a Global Optimization Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3776516)