Interval computations, rigour and non-rigour in deterministic continuous global optimization

DOI10.1080/10556781003636851MaRDI QIDQ3093044zbMATH OpenOpenAlexFDO

Authors Ralph Baker Kearfott

Publication date 12 October 2011

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556781003636851

zbMATH Keywords

branch and bounddeterministic global optimizationinterval computationsmathematical rigourrelaxations

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• On rigorous upper bounds to a global optimum
• Rigorous global search: continuous problems
• Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
• scientific article; zbMATH DE number 714522
• scientific article; zbMATH DE number 2068059

Cited in

(16)

• Rigorous global search: continuous problems
• On the efficient Gerschgorin inclusion usage in the global optimization \(\alpha\)BB method
• Linear interval parametric approach to testing pseudoconvexity
• On rigorous upper bounds to a global optimum
• First order rejection tests for multiple-objective optimization
• A general framework for convexity analysis in deterministic global optimization
• A branch and bound algorithm for quantified quadratic programming
• Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization
• On smooth reformulations and direct non-smooth computations for minimax problems
• Solving set-valued constraint satisfaction problems
• scientific article; zbMATH DE number 714522 (Why is no real title available?)
• scientific article; zbMATH DE number 1440902 (Why is no real title available?)
• Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces
• An extension of the \(\alpha\mathrm{BB}\)-type underestimation to linear parametric Hessian matrices
• (Global) optimization: historical notes and recent developments
• Testing pseudoconvexity via interval computation

Describes a project that uses

Uses Software

• BARON
• INTLIB
• INTERVAL_ARITHMETIC
• Cosy
• Numerica
• Slatec
• INTOPT_90
• GlobSol

This page was built for publication: Interval computations, rigour and non-rigour in deterministic continuous global optimization

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