An improved interval global optimization algorithm using higher-order inclusion function forms

DOI10.1007/s10898-004-5906-2zbMath1119.90042OpenAlexW2062143526MaRDI QIDQ2569148

Paluri S. V. Nataraj, Ketan Kotecha

Publication date: 18 October 2005

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-004-5906-2

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical computation of solutions to systems of equations (65H10)

Related Items

Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm ⋮ Matrix methods for the tensorial Bernstein form ⋮ An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions ⋮ An efficient algorithm for range computation of polynomials using the Bernstein form

Uses Software

• INTOPT_90
• minpack

Cites Work

• Unnamed Item
• Inclusion functions and global optimization. II
• Computation and application of Taylor polynomials with interval remainder bounds
• Global optimization with higher order inclusion function forms. I: A combined Taylor-Bernstein form
• An algorithm for global optimization using the Taylor-Bernstein form as inclusion function
• Investigation of a subdivision based algorithm for solving systems of polynomial equations.
• Interval approximation of higher order to the ranges of functions
• Inclusion functions and global optimization
• Testing Unconstrained Optimization Software
• Subdivision Direction Selection in Interval Methods for Global Optimization
• Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion
• Verified high-order inversion of functional dependencies and interval Newton methods