On an efficient use of gradient information for accelerating interval global optimization algorithms
From MaRDI portal
Publication:2387742
DOI10.1023/B:NUMA.0000049456.81410.fczbMath1078.65053MaRDI QIDQ2387742
Publication date: 5 September 2005
Published in: Numerical Algorithms (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) General methods in interval analysis (65G40)
Related Items (8)
A review of recent advances in global optimization ⋮ Empirical convergence speed of inclusion functions for facility location problems ⋮ An efficient interval computing technique for bound-constrained uncertain optimization problems ⋮ (Global) optimization: historical notes and recent developments ⋮ Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants ⋮ Interval oriented multi-section techniques for global optimization ⋮ Optimality and duality for second-order interval-valued variational problems ⋮ Empirical investigation of the convergence speed of inclusion functions in a global otimization context
Uses Software
This page was built for publication: On an efficient use of gradient information for accelerating interval global optimization algorithms
