Box-bisection for solving second-degree systems and the problem of clustering
From MaRDI portal
Recommendations
- The cluster problem revisited
- A biased Kaczmarz algorithm for clustered equations
- A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem
- An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors
- Partition problems in high dimensional boxes
- Robust clustering by double bisection crossing minimization
- A so-called cluster Benders decomposition approach for solving two-stage stochastic linear problems
- Numerical study of semidefinite bounds for the k-cluster problem
- Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem
Cited in
(10)- Computation of the solutions of nonlinear polynomial systems
- Lower bound functions for polynomials
- Mixed-volume computation by dynamic lifting applied to polynomial system solving
- Chaotic quantum behaved particle swarm optimization algorithm for solving nonlinear system of equations
- Abstract Generalized Bisection and a Cost Bound
- Some tests of generalized bisection
- Empirical Evaluation of Innovations in Interval Branch and Bound Algorithms for Nonlinear Systems
- Exclusion Regions for Systems of Equations
- Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm
- An algorithm for estimating non-convex volumes and other integrals in \(n\) dimensions
This page was built for publication: Box-bisection for solving second-degree systems and the problem of clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3776505)
