Pages that link to "Item:Q1338540"

The following pages link to The cluster problem in multivariate global optimization (Q1338540):

Displaying 46 items.

• Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490) (← links)
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• Convergence analysis of Taylor models and McCormick-Taylor models (Q367158) (← links)
• On smooth reformulations and direct non-smooth computations for minimax problems (Q386469) (← links)
• A comparison of verified distance computation between implicit objects using different arithmetics for range enclosure (Q411447) (← links)
• Subdivision strategies for boxes in branch-and-bound nonlinear solvers and verification (Q475422) (← links)
• Bound constrained interval global optimization in the COCONUT environment (Q475813) (← links)
• A reliable affine relaxation method for global optimization (Q496103) (← links)
• Differentiable McCormick relaxations (Q522264) (← links)
• Convergence analysis of multivariate McCormick relaxations (Q524904) (← links)
• Convergence rate of McCormick relaxations (Q656830) (← links)
• Convergence-order analysis for differential-inequalities-based bounds and relaxations of the solutions of ODEs (Q670661) (← links)
• On the complexity of exclusion algorithms for optimization (Q700180) (← links)
• The cluster problem revisited (Q742132) (← links)
• Global optimization in clustering using hyperbolic cross points (Q877116) (← links)
• Convergence-order analysis of branch-and-bound algorithms for constrained problems (Q1668796) (← links)
• Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains (Q1668799) (← links)
• Optimal deterministic algorithm generation (Q1668803) (← links)
• A computational study of global optimization solvers on two trust region subproblems (Q1668805) (← links)
• Chebyshev model arithmetic for factorable functions (Q1675562) (← links)
• The cluster problem in constrained global optimization (Q1683326) (← links)
• Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
• Feature cluster: recent advances in exact methods for multi-objective optimisation (Q1753499) (← links)
• Tighter McCormick relaxations through subgradient propagation (Q2010084) (← links)
• Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations (Q2097651) (← links)
• Exclusion regions for optimization problems (Q2250096) (← links)
• Efficient computation of spectral bounds for Hessian matrices on hyperrectangles for global optimization (Q2250109) (← links)
• First order rejection tests for multiple-objective optimization (Q2250111) (← links)
• On tightness and anchoring of McCormick and other relaxations (Q2274852) (← links)
• Some observations on exclusion regions in branch and bound algorithms (Q2349518) (← links)
• Unified framework for the propagation of continuous-time enclosures for parametric nonlinear ODEs (Q2351531) (← links)
• On interval branch-and-bound for additively separable functions with common variables (Q2392130) (← links)
• A branch and bound algorithm for quantified quadratic programming (Q2397427) (← links)
• How to solve a design centering problem (Q2408900) (← links)
• Tighter \(\alpha \mathrm{BB}\) relaxations through a refinement scheme for the scaled Gerschgorin theorem (Q2416572) (← links)
• Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization (Q2689856) (← links)
• Reachability Analysis and Deterministic Global Optimization of DAE Models (Q2795640) (← links)
• Algorithmic differentiation techniques for global optimization in the COCONUT environment (Q2885482) (← links)
• An approach to multi-start clustering for global optimization with non-linear constraints (Q4530126) (← links)
• Whitney differentiability of optimal-value functions for bound-constrained convex programming problems (Q4634171) (← links)
• Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded (Q5085481) (← links)
• Mathematically Rigorous Global Optimization and Fuzzy Optimization (Q5153504) (← links)
• Reliability and performance of UEGO, a clustering-based global optimizer (Q5940043) (← links)
• Constraint aggregation for rigorous global optimization (Q5962722) (← links)
• A branch-and-bound algorithm with growing datasets for large-scale parameter estimation (Q6586253) (← links)
• On dealing with minima at the border of a simplicial feasible area in simplicial branch and bound (Q6644263) (← links)