New diagonal bundle method for clustering problems in large data sets
From MaRDI portal
Publication:1694910
DOI10.1016/j.ejor.2017.06.010zbMath1380.90226OpenAlexW2623902172WikidataQ109595611 ScholiaQ109595611MaRDI QIDQ1694910
Sona Taheri, Adil M. Bagirov, Napsu Karmitsa
Publication date: 6 February 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.06.010
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items
Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering ⋮ SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering ⋮ A novel optimization approach towards improving separability of clusters ⋮ A derivative-free 𝒱𝒰-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 ⋮ K-means clustering via a nonconvex optimization approach
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A model for clustering data from heterogeneous dissimilarities
- Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster
- Diagonal bundle method for nonsmooth sparse optimization
- Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- New and efficient DCA based algorithms for minimum sum-of-squares clustering
- Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
- Representations of quasi-Newton matrices and their use in limited memory methods
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- Variable neighborhood decomposition search
- A heuristic algorithm for solving the minimum sum-of-squares clustering problems
- An incremental clustering algorithm based on hyperbolic smoothing
- Variable neighborhood search for minimum sum-of-squares clustering on networks
- Simulated annealing based automatic fuzzy clustering combined with ANN classification for analyzing microarray data
- A new efficient algorithm based on DC programming and DCA for clustering
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- A clustering search metaheuristic for the point-feature cartographic label placement problem
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- The hyperbolic smoothing clustering method
- Introduction to Nonsmooth Optimization
- Gradient set splitting in nonconvex nonsmooth numerical optimization
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- Evaluation of a Branch and Bound Algorithm for Clustering
- An algorithm for minimizing clustering functions
- New limited memory bundle method for large-scale nonsmooth optimization
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
