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

DOI10.1007/S10898-004-5906-2MaRDI QIDQ2569148zbMATH OpenOpenAlexFDO

Authors P. 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 computation of solutions to systems of equations (65H10) Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)

Recommendations

• An algorithm for global optimization using the Taylor-Bernstein form as inclusion function
• Global optimization with higher order inclusion function forms. I: A combined Taylor-Bernstein form
• Interval tools for global optimization
• Inclusion functions and global optimization. II
• Inclusion functions and global optimization

Cites work

• An algorithm for global optimization using the Taylor-Bernstein form as inclusion function
• Computation and application of Taylor polynomials with interval remainder bounds
• Global optimization with higher order inclusion function forms. I: A combined Taylor-Bernstein form
• scientific article; zbMATH DE number 54095 (Why is no real title available?)
• Inclusion functions and global optimization
• Inclusion functions and global optimization. II
• Interval approximation of higher order to the ranges of functions
• Investigation of a subdivision based algorithm for solving systems of polynomial equations.
• Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion
• Subdivision Direction Selection in Interval Methods for Global Optimization
• Testing Unconstrained Optimization Software
• Verified high-order inversion of functional dependencies and interval Newton methods

Cited in

(7)

• An efficient algorithm for range computation of polynomials using the Bernstein form
• 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
• Matrix methods for the tensorial Bernstein form
• The extrapolated interval global optimization algorithm
• Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm
• An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions

Describes a project that uses

Uses Software

• minpack
• INTOPT_90

This page was built for publication: An improved interval global optimization algorithm using higher-order inclusion function forms

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