The cluster problem revisited

DOI10.1007/s10898-013-0059-9zbMath1297.49046OpenAlexW2112958202MaRDI QIDQ742132

Spencer D. Schaber, Achim Wechsung, Paul I. Barton

Publication date: 18 September 2014

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

Full work available at URL: http://hdl.handle.net/1721.1/103614

zbMATH Keywords

global optimizationconvex relaxationsbranch-and-bound algorithmsconvergence ordercluster problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Numerical methods based on nonlinear programming (49M37) Numerical methods of relaxation type (49M20)

Related Items

Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ 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 ⋮ Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded ⋮ How to solve a design centering problem ⋮ Chebyshev model arithmetic for factorable functions ⋮ The cluster problem in constrained global optimization ⋮ Tighter \(\alpha \mathrm{BB}\) relaxations through a refinement scheme for the scaled Gerschgorin theorem ⋮ Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ 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 ⋮ Differentiable McCormick relaxations ⋮ Convergence analysis of multivariate McCormick relaxations ⋮ Tighter McCormick relaxations through subgradient propagation ⋮ On tightness and anchoring of McCormick and other relaxations ⋮ A standard branch-and-bound approach for nonlinear semi-infinite problems ⋮ Reachability Analysis and Deterministic Global Optimization of DAE Models ⋮ Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations ⋮ Unified framework for the propagation of continuous-time enclosures for parametric nonlinear ODEs

Cites Work

• Unnamed Item
• Unnamed Item
• The theoretical and empirical rate of convergence for geometric branch-and-bound methods
• Convergence rate of McCormick relaxations
• Generalized McCormick relaxations
• Global minimum potential energy conformations of small molecules
• The cluster problem in multivariate global optimization
• Taylor forms -- use and limits.
• Epsilon-inflation in verification algorithms
• \(\alpha BB\): A global optimization method for general constrained nonconvex problems
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Complete search in continuous global optimization and constraint satisfaction
• An Algorithm for Separable Nonconvex Programming Problems