Generalized subinterval selection criteria for interval global optimization

DOI10.1023/B:NUMA.0000049489.44154.02zbMath1090.90177MaRDI QIDQ2387747

Tibor Csendes

Publication date: 5 September 2005

Published in: Numerical Algorithms (Search for Journal in Brave)

zbMATH Keywords

global optimizationconvergence propertiesinterval methodsinterval selection

Mathematics Subject Classification ID

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

Related Items (7)

A new multi-section based technique for constrained optimization problems with interval-valued objective function ⋮ An efficient interval computing technique for bound-constrained uncertain optimization problems ⋮ Gradient-based descent linesearch to solve interval-valued optimization problems under gH-differentiability with application to finance ⋮ A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms ⋮ On constrained optimization by interval arithmetic and interval order relations ⋮ Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds ⋮ Interval oriented multi-section techniques for global optimization

Uses Software

• INTOPT_90

This page was built for publication: Generalized subinterval selection criteria for interval global optimization