New diagonal bundle method for clustering problems in large data sets
From MaRDI portal
Recommendations
- An incremental clustering algorithm based on hyperbolic smoothing
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- An algorithm for minimizing clustering functions
- Clustering via d. c. optimization.
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3846333 (Why is no real title available?)
- scientific article; zbMATH DE number 3972657 (Why is no real title available?)
- scientific article; zbMATH DE number 50640 (Why is no real title available?)
- scientific article; zbMATH DE number 53965 (Why is no real title available?)
- scientific article; zbMATH DE number 872150 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- A clustering search metaheuristic for the point-feature cartographic label placement problem
- A heuristic algorithm for solving the minimum sum-of-squares clustering problems
- A model for clustering data from heterogeneous dissimilarities
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- A new efficient algorithm based on DC programming and DCA for clustering
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- An algorithm for minimizing clustering functions
- An incremental clustering algorithm based on hyperbolic smoothing
- Computational results of a semidefinite branch-and-bound algorithm for k-cluster
- Diagonal bundle method for nonsmooth sparse optimization
- Evaluation of a Branch and Bound Algorithm for Clustering
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- Gradient set splitting in nonconvex nonsmooth numerical optimization
- Introduction to nonsmooth optimization. Theory, practice and software
- Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
- New and efficient DCA based algorithms for minimum sum-of-squares clustering
- New limited memory bundle method for large-scale nonsmooth optimization
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- Representations of quasi-Newton matrices and their use in limited memory methods
- Simulated annealing based automatic fuzzy clustering combined with ANN classification for analyzing microarray data
- Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions
- The hyperbolic smoothing clustering method
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
- Variable neighborhood decomposition search
- Variable neighborhood search for minimum sum-of-squares clustering on networks
Cited in
(8)- A novel optimization approach towards improving separability of clusters
- A derivative-free \(\mathcal{V} \mathcal{U}\)-algorithm for convex finite-max problems
- Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization
- Optimization problems for machine learning: a survey
- SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
- Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering
- K-means clustering via a nonconvex optimization approach
- An incremental clustering algorithm based on hyperbolic smoothing
This page was built for publication: New diagonal bundle method for clustering problems in large data sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1694910)
