Empirical investigation of the convergence speed of inclusion functions in a global otimization context

DOI10.1007/s11155-005-6890-zzbMath1078.65547MaRDI QIDQ2572918

Tibor Csendes, Boglárka G.-Tóth

Publication date: 7 November 2005

Published in: Reliable Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11155-005-6890-z

zbMATH Keywords

global optimization; convergence; interval methods; centered forms; inclusion functions

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C30: Nonlinear programming

65G30: Interval and finite arithmetic

Related Items

The theoretical and empirical rate of convergence for geometric branch-and-bound methods, Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods, A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms, Theoretical rate of convergence for interval inclusion functions, Empirical convergence speed of inclusion functions for facility location problems, Solving a huff-like competitive location and design model for profit maximization in the plane, Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure, The GLOBAL optimization method revisited, Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models, A computationally inexpensive algorithm for determining outer and inner enclosures of nonlinear mappings of ellipsoidal domains, On interval branch-and-bound for additively separable functions with common variables, Obtaining an outer approximation of the efficient set of nonlinear biobjective problems

Uses Software

• C-XSC
• C-XSC 2.0

Cites Work

• Optimal centered forms
• Die zentrische Form in der Intervallarithmetik, ihre quadratische Konvergenz und ihre Inklusionsisotonie
• Computation and application of Taylor polynomials with interval remainder bounds
• Multisection in interval branch-and-bound methods for global optimization. II: Numerical tests
• Numerical experiences with a new generalized subinterval selection criterion for interval global optimization
• Taylor forms -- use and limits.
• On an efficient use of gradient information for accelerating interval global optimization algorithms
• A new inclusion function for optimization: kite -- the one-dimensional case
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item