The cluster problem in multivariate global optimization
From MaRDI portal
Publication:1338540
DOI10.1007/BF01096455zbMATH Open0824.90121OpenAlexW2046480531MaRDI QIDQ1338540FDOQ1338540
Authors: Kaisheng Du, Ralph Baker Kearfott 
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
Recommendations
Cites Work
- Algorithm 681: INTBIS, a portable interval Newton/bisection package
- Title not available (Why is that?)
- Interval Methods for Systems of Equations
- Title not available (Why is that?)
- Global optimization using interval analysis - the multi-dimensional case
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- FORTRAN-SC. A study of a FORTRAN extension for engineering/scientific computation with access to ACRITH
- Computing the range of values of real functions with accuracy higher than second order
Cited In (47)
- Exclusion regions for optimization problems
- Convergence-order analysis of branch-and-bound algorithms for constrained problems
- Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations
- A branch and bound algorithm for quantified quadratic programming
- A comparison of verified distance computation between implicit objects using different arithmetics for range enclosure
- Optimal deterministic algorithm generation
- Tighter McCormick relaxations through subgradient propagation
- A branch-and-bound algorithm with growing datasets for large-scale parameter estimation
- Whitney differentiability of optimal-value functions for bound-constrained convex programming problems
- Reachability Analysis and Deterministic Global Optimization of DAE Models
- Unified framework for the propagation of continuous-time enclosures for parametric nonlinear ODEs
- Feature cluster: recent advances in exact methods for multi-objective optimisation
- Some observations on exclusion regions in branch and bound algorithms
- On tightness and anchoring of McCormick and other relaxations
- Global optimization in clustering using hyperbolic cross points
- Reliability and performance of UEGO, a clustering-based global optimizer
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- Bound constrained interval global optimization in the COCONUT environment
- A reliable affine relaxation method for global optimization
- Constraint aggregation for rigorous global optimization
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Mathematically Rigorous Global Optimization and Fuzzy Optimization
- Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded
- An approach to multi-start clustering for global optimization with non-linear constraints
- A computational study of global optimization solvers on two trust region subproblems
- Convergence rate of McCormick relaxations
- The cluster problem in constrained global optimization
- The cluster problem revisited
- Subdivision strategies for boxes in branch-and-bound nonlinear solvers and verification
- Chebyshev model arithmetic for factorable functions
- Efficient computation of spectral bounds for Hessian matrices on hyperrectangles for global optimization
- Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains
- On dealing with minima at the border of a simplicial feasible area in simplicial branch and bound
- On interval branch-and-bound for additively separable functions with common variables
- First order rejection tests for multiple-objective optimization
- Title not available (Why is that?)
- Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization
- Convergence analysis of Taylor models and McCormick-Taylor models
- How to solve a design centering problem
- Tighter \(\alpha \mathrm{BB}\) relaxations through a refinement scheme for the scaled Gerschgorin theorem
- Domain reduction techniques for global NLP and MINLP optimization
- On the complexity of exclusion algorithms for optimization
- Convergence-order analysis for differential-inequalities-based bounds and relaxations of the solutions of ODEs
- On smooth reformulations and direct non-smooth computations for minimax problems
- Algorithmic differentiation techniques for global optimization in the COCONUT environment
- Differentiable McCormick relaxations
- Convergence analysis of multivariate McCormick relaxations
Uses Software
This page was built for publication: The cluster problem in multivariate global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1338540)
