An algorithm for global optimization using the Taylor-Bernstein form as inclusion function
From MaRDI portal
Publication:1810873
DOI10.1023/A:1021296315884zbMath1046.90065OpenAlexW1572241460MaRDI QIDQ1810873
Ketan Kotecha, Paluri S. V. Nataraj
Publication date: 9 June 2003
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1021296315884
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Related Items (5)
Automatic dynamic parallelotope bundles for reachability analysis of nonlinear systems ⋮ Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach ⋮ Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach ⋮ Global optimization of nonlinear sum of ratios problem ⋮ An improved interval global optimization algorithm using higher-order inclusion function forms
Uses Software
This page was built for publication: An algorithm for global optimization using the Taylor-Bernstein form as inclusion function
