A surprising approach in interval global optimization

DOI10.1023/A:1014754803382zbMATH Open0993.65069MaRDI QIDQ1597637FDOQ1597637

Authors: Sergey P. Shary 

Publication date: 30 May 2002

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

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

zbMATH Keywords

global optimizationinterval arithmeticbranch-and-bound strategygraph subdivision methods

Mathematics Subject Classification ID

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

Cited In (8)

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

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)