New subinterval selection criteria for interval global optimization

DOI10.1023/A:1011228208051zbMath1030.90091OpenAlexW1607173467MaRDI QIDQ5940045

Tibor Csendes

Publication date: 24 February 2004

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011228208051

zbMATH Keywords

convergence propertiesinterval methodsinterval selection

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Interval and finite arithmetic (65G30)

Related Items

Optimal circle covering problems and their applications, Two acceleration mechanisms in verified global optimization, Solving a huff-like competitive location and design model for profit maximization in the plane, Theoretical convergence analysis of a general division-deletion algorithm for solving global search problems, New interval methods for constrained global optimization, Probabilistic subproblem selection in branch-and-bound algorithms, Node selection strategies in interval branch and bound algorithms, Optimal centers in branch-and-prune algorithms for univariate global optimization, A new pruning test for finding all global minimizers of nonsmooth functions, A new inclusion function for optimization: kite -- the one-dimensional case

Uses Software

• INTOPT_90