The convergence speed of interval methods for global optimization
From MaRDI portal
Publication:1361290
DOI10.1016/0898-1221(95)00229-4zbMATH Open0874.90171OpenAlexW1965862399MaRDI QIDQ1361290FDOQ1361290
Authors: András Erik Csallner, Tibor Csendes 
Publication date: 23 July 1997
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(95)00229-4
Recommendations
- Subdivision Direction Selection in Interval Methods for Global Optimization
- Interval tools for global optimization
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization
- The impact of accelerating tools on the interval subdivision algorithm for global optimization
- scientific article; zbMATH DE number 4066243
Cites Work
- Testing Unconstrained Optimization Software
- Title not available (Why is that?)
- Title not available (Why is that?)
- Global optimization using interval analysis - the multi-dimensional case
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficiency of a Global Optimization Algorithm
- Computation of rational interval functions
- Title not available (Why is that?)
- The impact of accelerating tools on the interval subdivision algorithm for global optimization
- Title not available (Why is that?)
Cited In (19)
- Balanced random interval arithmetic in market model estimation
- The extrapolated interval global optimization algorithm
- Convergence rates of a global optimization algorithm
- A fast memoryless interval-based algorithm for global optimization
- An interval version of Shubert's iterative method for the localization of the global maximum
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization
- A surprising approach in interval global optimization
- Theoretical convergence analysis of a general division-deletion algorithm for solving global search problems
- The impact of accelerating tools on the interval subdivision algorithm for global optimization
- Accelerations for a variety of global optimization methods
- Empirical convergence speed of inclusion functions for facility location problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- The theoretical and empirical rate of convergence for geometric branch-and-bound methods
- Empirical investigation of the convergence speed of inclusion functions in a global otimization context
- Theoretical rate of convergence for interval inclusion functions
- New interval methods for constrained global optimization
- Lipschitz continuity and the termination of interval methods for global optimization
- Improving the convergence rate of the DIRECT global optimization algorithm
Uses Software
This page was built for publication: The convergence speed of interval methods for global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361290)
