The convergence speed of interval methods for global optimization

DOI10.1016/0898-1221(95)00229-4zbMath0874.90171OpenAlexW1965862399MaRDI QIDQ1361290

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

zbMATH Keywords

global optimizationinterval subdivisionHansen's method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items

The theoretical and empirical rate of convergence for geometric branch-and-bound methods ⋮ Balanced random interval arithmetic in market model estimation ⋮ Theoretical rate of convergence for interval inclusion functions ⋮ New interval methods for constrained global optimization ⋮ A fast memoryless interval-based algorithm for global optimization ⋮ Lipschitz continuity and the termination of interval methods for global optimization

Uses Software

• minpack

Cites Work

• Global optimization using interval analysis - the multi-dimensional case
• The impact of accelerating tools on the interval subdivision algorithm for global optimization
• Efficiency of a Global Optimization Algorithm
• Testing Unconstrained Optimization Software
• Computation of rational interval functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item