ICOS: a branch and bound based solver for rigorous global optimization
From MaRDI portal
Publication:3396393
DOI10.1080/10556780902753452zbMath1179.90265OpenAlexW2097130079MaRDI QIDQ3396393
Publication date: 18 September 2009
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780902753452
Nonconvex programming, global optimization (90C26) General methods in interval analysis (65G40) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) General topics in the theory of software (68N01)
Related Items (8)
Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ Global optimization ⋮ \textsc{AbsTaylor}: upper bounding with inner regions in nonlinear continuous global optimization problems ⋮ \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers ⋮ Rigorous Estimation of Floating-Point Round-off Errors with Symbolic Taylor Expansions ⋮ Exploiting Binary Floating-Point Representations for Constraint Propagation ⋮ ICOS
Uses Software
This page was built for publication: ICOS: a branch and bound based solver for rigorous global optimization
