The cluster problem in multivariate global optimization

DOI10.1007/BF01096455zbMath0824.90121OpenAlexW2046480531MaRDI QIDQ1338540

Publication date: 9 November 1995

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

Full work available at URL: https://doi.org/10.1007/bf01096455

zbMATH Keywords

global optimization interval arithmetic branch-and-bound algorithms

Mathematics Subject Classification ID

Nonlinear programming (90C30) Interval and finite arithmetic (65G30)

Related Items

Algorithmic differentiation techniques for global optimization in the COCONUT environment, Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, On interval branch-and-bound for additively separable functions with common variables, A branch and bound algorithm for quantified quadratic programming, Convergence analysis of Taylor models and McCormick-Taylor models, Convergence-order analysis of branch-and-bound algorithms for constrained problems, Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains, Optimal deterministic algorithm generation, A computational study of global optimization solvers on two trust region subproblems, Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded, How to solve a design centering problem, Chebyshev model arithmetic for factorable functions, On smooth reformulations and direct non-smooth computations for minimax problems, The cluster problem in constrained global optimization, Tighter \(\alpha \mathrm{BB}\) relaxations through a refinement scheme for the scaled Gerschgorin theorem, A comparison of verified distance computation between implicit objects using different arithmetics for range enclosure, Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization, Domain reduction techniques for global NLP and MINLP optimization, Convergence rate of McCormick relaxations, Subdivision strategies for boxes in branch-and-bound nonlinear solvers and verification, Bound constrained interval global optimization in the COCONUT environment, Whitney differentiability of optimal-value functions for bound-constrained convex programming problems, Convergence-order analysis for differential-inequalities-based bounds and relaxations of the solutions of ODEs, A reliable affine relaxation method for global optimization, Mathematically Rigorous Global Optimization and Fuzzy Optimization, Differentiable McCormick relaxations, Exclusion regions for optimization problems, Efficient computation of spectral bounds for Hessian matrices on hyperrectangles for global optimization, First order rejection tests for multiple-objective optimization, Convergence analysis of multivariate McCormick relaxations, On the complexity of exclusion algorithms for optimization, Tighter McCormick relaxations through subgradient propagation, On tightness and anchoring of McCormick and other relaxations, Reachability Analysis and Deterministic Global Optimization of DAE Models, Constraint aggregation for rigorous global optimization, The cluster problem revisited, Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations, Some observations on exclusion regions in branch and bound algorithms, Unified framework for the propagation of continuous-time enclosures for parametric nonlinear ODEs

Uses Software

INTBIS

Cites Work