Global optimization with higher order inclusion function forms. I: A combined Taylor-Bernstein form

DOI10.1023/B:REOM.0000003995.08805.2azbMath1038.65052MaRDI QIDQ1424801

Paluri S. V. Nataraj, Ketan Kotecha

Publication date: 15 March 2004

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

zbMATH Keywords

global optimizationconvergencenumerical examplesrange enclosuresTaylor-Bernstein form

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Related Items (7)

Robustness and Randomness ⋮ Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach ⋮ Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm ⋮ Global optimization for the sum of generalized polynomial fractional functions ⋮ Global optimization for the generalized polynomial sum of ratios problem ⋮ Global optimization for sum of geometric fractional functions ⋮ An improved interval global optimization algorithm using higher-order inclusion function forms

This page was built for publication: Global optimization with higher order inclusion function forms. I: A combined Taylor-Bernstein form