A surprising approach in interval global optimization

DOI10.1023/A:1014754803382MaRDI QIDQ1597637zbMATH OpenFDO

Authors Sergey P. Shary

Publication date 30 May 2002

Published in Reliable Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1014754803382

zbMATH Keywords

branch-and-bound strategyglobal optimizationgraph subdivision methodsinterval arithmetic

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A new interval approach to global optimization
• Developing interval global optimzation algorithms on the basis of branch-and-bound and constraint propagation methods
• Interval analysis on directed acyclic graphs for global optimization
• Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
• The convergence speed of interval methods for global optimization

Cited in

(8)

• Identification of region of attraction for global optimization problem using interval symmetric operator
• A new subdivision strategy for range computations
• Meta-heuristic interval methods of search of optimal in average control of nonlinear determinate systems with incomplete information about its parameters
• Development of metaheuristic interval minimization methods for optimal program control design
• A class of problems that can be solved using interval algorithms
• A new interval approach to global optimization
• Algorithms for the numerical solution of fractional differential equations with interval parameters
• Interval analysis on directed acyclic graphs for global optimization

This page was built for publication: A surprising approach in interval global optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1597637)