A fast memoryless interval-based algorithm for global optimization
From MaRDI portal
Publication:975771
Recommendations
Cites work
- scientific article; zbMATH DE number 429516 (Why is no real title available?)
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- scientific article; zbMATH DE number 54095 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 867338 (Why is no real title available?)
- scientific article; zbMATH DE number 869737 (Why is no real title available?)
- A collection of test problems for constrained global optimization algorithms
- A direct search variant of the simulated annealing algorithm for optimization involving continuous variables
- A global optimization algorithm using Lagrangian underestimates and the interval Newton method
- An Algorithm for Separable Nonconvex Programming Problems
- An algorithm for nonconvex programming problems
- Computation of rational interval functions
- Derivative-free filter simulated annealing method for constrained continuous global optimization
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Efficient interval partitioning for constrained global optimization
- FITTING OF TABU SEARCH TO OPTIMIZE FUNCTIONS OF CONTINUOUS VARIABLES
- Handbook of global optimization. Vol. 2
- Interval branch and bound with local sampling for constrained global optimization
- Introduction to Interval Analysis
- Lipschitz continuity and the termination of interval methods for global optimization
- Optimization by simulated annealing
- Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization.
- Taboo Search: An Approach to the Multiple Minima Problem
- Tabu Search—Part I
- The convergence speed of interval methods for global optimization
Cited in
(8)- A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms
- Experiments with a new selection criterion in a fast interval optimization algorithm
- Interval branch and bound with local sampling for constrained global optimization
- Combining interval branch and bound and stochastic search
- A simple strategy for nonlinear optimization
- scientific article; zbMATH DE number 2068067 (Why is no real title available?)
- scientific article; zbMATH DE number 818540 (Why is no real title available?)
- Adaptive memory programming for constrained global optimization
This page was built for publication: A fast memoryless interval-based algorithm for global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975771)
