scientific article; zbMATH DE number 4066243
From MaRDI portal
Publication:3799574
[For the entire collection see Zbl 0638.00033.] Here interval algorithms for solving global optimization problems are considered. Results concerning convergence properties of the discussed algorithms are put together. In two sections optimization over unbounded domains and nonsmooth optimization are treated. Some numerical examples are enclosed.
Recommendations
Cited in
(19)- What can interval analysis do for global optimization?
- Global optimization by multilevel coordinate search
- The convergence speed of interval methods for global optimization
- Interval methods for global optimization
- An interval global optimization algorithm combining symbolic rewriting and componentwise Newton method applied to control a class of queueing systems
- Comparison and Automated Selection of Local Optimization Solvers for Interval Global Optimization Methods
- Efficiency of a Global Optimization Algorithm
- Interval algorithms and their application to discrete optimization of multistep processes
- scientific article; zbMATH DE number 4076484 (Why is no real title available?)
- scientific article; zbMATH DE number 1292983 (Why is no real title available?)
- Dynamic optimization of interval narrowing algorithms
- scientific article; zbMATH DE number 2068067 (Why is no real title available?)
- scientific article; zbMATH DE number 1512090 (Why is no real title available?)
- scientific article; zbMATH DE number 1861585 (Why is no real title available?)
- scientific article; zbMATH DE number 757686 (Why is no real title available?)
- Global stability of interval optimization problems
- Global Optimization over Unbounded Domains
- Interval tools for global optimization
- A fast memoryless interval-based algorithm for global optimization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3799574)