Interval computations, rigour and non-rigour in deterministic continuous global optimization
From MaRDI portal
Publication:3093044
DOI10.1080/10556781003636851zbMath1228.90080OpenAlexW2133982567MaRDI QIDQ3093044
Publication date: 12 October 2011
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556781003636851
branch and bounddeterministic global optimizationinterval computationsrelaxationsmathematical rigour
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items
A general framework for convexity analysis in deterministic global optimization, A branch and bound algorithm for quantified quadratic programming, On smooth reformulations and direct non-smooth computations for minimax problems, Solving set-valued constraint satisfaction problems, (Global) optimization: historical notes and recent developments, On rigorous upper bounds to a global optimum, First order rejection tests for multiple-objective optimization, Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces, On the efficient Gerschgorin inclusion usage in the global optimization \(\alpha\)BB method, Linear interval parametric approach to testing pseudoconvexity, Testing pseudoconvexity via interval computation, An extension of the \(\alpha\mathrm{BB}\)-type underestimation to linear parametric Hessian matrices
Uses Software
