Optimal centers in branch-and-prune algorithms for univariate global optimization

DOI10.1016/j.amc.2004.10.050zbMath1091.65058OpenAlexW2015011887MaRDI QIDQ2572338

T. N. Grapsa, D. G. Sotiropoulos

Publication date: 16 November 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2004.10.050

zbMATH Keywords

global optimizationnumerical examplesbranch-and-boundbranch-and-prune algorithmoptimal centersoptimal mean value formpruning steps

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30)

Related Items (2)

Combination of two underestimators for univariate global optimization ⋮ Optimal centers in branch-and-prune algorithms for univariate global optimization

Uses Software

• C-XSC
• C-XSC 2.0
• INTOPT_90

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Derived eigenvalues of symmetric matrices, with applications to distance geometry
• An improved interval Newton operator
• Optimal centered forms
• Mean value forms in interval analysis
• A nonsmooth global optimization technique using slopes: The one-dimensional case
• Cord-slope form of Taylor's expansion in univariate global optimization
• Rigorous global search: continuous problems
• New interval analysis support functions using gradient information in a global minimization algorithm
• Formulas for the width of interval products
• Interval arithmetic, affine arithmetic, Taylor series methods: Why, what next?
• Optimal centers in branch-and-prune algorithms for univariate global optimization
• A new inclusion function for optimization: kite -- the one-dimensional case
• Mean Value and Taylor Forms in Interval Analysis
• Representations of Intervals and Optimal Error Bounds
• Interval Slopes for Rational Functions and Associated Centered Forms
• Numerical Software with Result Verification
• Experiments with a new selection criterion in a fast interval optimization algorithm
• New subinterval selection criteria for interval global optimization

This page was built for publication: Optimal centers in branch-and-prune algorithms for univariate global optimization