Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions

DOI10.1007/BF01096413zbMath0794.90062MaRDI QIDQ1310976

Pierre Hansen, Junjie Xiong, Brigitte Jaumard

Publication date: 13 January 1994

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

zbMATH Keywords

global optimizationdecompositioninterval arithmetic

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems, A branch-and-reduce approach to global optimization, A new two-level linear relaxed bound method for geometric programming problems, Comparison between Baumann and admissible simplex forms in interval analysis, An Adapted Branch and Bound Algorithm for Approximating Real Root of a Ploynomial, Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the range of values of real functions with accuracy higher than second order
• Bounding the slope of polynomial operators and some applications
• Reduction of indefinite quadratic programs to bilinear programs
• Unconstrained and constrained global optimization of polynomial functions in one variable
• Primal-relaxed dual global optimization approach
• Cord-slope form of Taylor's expansion in univariate global optimization
• Globally minimizing polynomials without evaluating derivatives
• On Descent from Local Minima