scientific article; zbMATH DE number 524102

MaRDI QIDQ4284590zbMATH OpenFDO

Authors Kaisheng Du, Ralph Baker Kearfott

Publication date 24 March 1994

zbMATH Keywords

convergenceglobal optimizationinterval arithmeticbranch and bound algorithmscluster problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Nonlinear programming (90C30) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• The cluster problem in multivariate global optimization
• Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
• On an efficient use of gradient information for accelerating interval global optimization algorithms
• Efficiency of a Global Optimization Algorithm
• Interval-arithmetic-oriented interval computing technique for global optimization

Cited in

(13)

• Piecewise linear bounding functions for univariate global optimization
• Tighter McCormick relaxations through subgradient propagation
• On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems
• A branch-and-bound algorithm for bound constrained optimization problems without derivatives
• Global optimization in clustering using hyperbolic cross points
• Reliability and performance of UEGO, a clustering-based global optimizer
• Mathematically Rigorous Global Optimization and Fuzzy Optimization
• The cluster problem in constrained global optimization
• An approach to multi-start clustering for global optimization with non-linear constraints
• The cluster problem revisited
• The cluster problem in multivariate global optimization
• Convergence analysis of Taylor models and McCormick-Taylor models
• Quasiconvex relaxations based on interval arithmetic

This page was built for publication:

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