The cluster problem in constrained global optimization
From MaRDI portal
branch-and-boundcluster problemconstrained optimizationconvergence orderconvex relaxationglobal optimizationlower bounding scheme
Numerical methods of relaxation type (49M20) Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Recommendations
Cites work
- Complete search in continuous global optimization and constraint satisfaction
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Constraint qualification failure in action
- Convergence analysis of multivariate McCormick relaxations
- Convergence analysis of Taylor models and McCormick-Taylor models
- Convergence rate of McCormick relaxations
- Die zentrische Form in der Intervallarithmetik, ihre quadratische Konvergenz und ihre Inklusionsisotonie
- Differentiable McCormick relaxations
- Epsilon-inflation in verification algorithms
- Erratum to: ``Multivariate McCormick relaxations
- First order rejection tests for multiple-objective optimization
- Handbook of test problems in local and global optimization
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 3539473 (Why is no real title available?)
- scientific article; zbMATH DE number 524102 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- Introduction to Interval Analysis
- Introduction to Piecewise Differentiable Equations
- Multivariate McCormick relaxations
- Nonlinear Programming
- On Sensitivity Analysis of Nonlinear Programs in Banach Spaces: The Approach via Composite Unconstrained Optimization
- Rigorous convex underestimators for general twice-differentiable problems
- Second-order Sufficiency and Quadratic Growth for Nonisolated Minima
- The cluster problem in multivariate global optimization
- The cluster problem revisited
- The theoretical and empirical rate of convergence for geometric branch-and-bound methods
- Theoretical rate of convergence for interval inclusion functions
Cited in
(18)- The cluster problem in multivariate global optimization
- Convergence-order analysis of branch-and-bound algorithms for constrained problems
- Tighter McCormick relaxations through subgradient propagation
- Exclusion regions for optimization problems
- On tightness and anchoring of McCormick and other relaxations
- A standard branch-and-bound approach for nonlinear semi-infinite problems
- Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization
- Improved convex and concave relaxations of composite bilinear forms
- scientific article; zbMATH DE number 2079516 (Why is no real title available?)
- An approach to multi-start clustering for global optimization with non-linear constraints
- EAGO.jl: easy advanced global optimization in Julia
- Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded
- A Global Constraint for the Exact Cover Problem: Application to Conceptual Clustering
- MUSE-BB: a decomposition algorithm for nonconvex two-stage problems using strong multisection branching
- On the convergence order of value function relaxations used in decomposition-based global optimization of nonconvex stochastic programs
- Data-driven Lipschitz-informed convex underestimators for branch-and-bound optimization of black-box functions
- The cluster problem revisited
- Global optimization in clustering using hyperbolic cross points
This page was built for publication: The cluster problem in constrained global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1683326)
