An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms

DOI10.3934/jimo.2019079zbMath1476.90367OpenAlexW3093135157MaRDI QIDQ2244241

Burak Ordin, Ehsan Mohebi, Adil M. Bagirov

Publication date: 12 November 2021

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2019079

zbMATH Keywords

nonsmooth optimizationnonconvex optimizationcluster analysisunsupervised learningincremental algorithm

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26)

Uses Software

• Global Optimization Toolbox For Maple
• TSPLIB
• UCI-ml
• DGM
• k-means++
• clusfind

Cites Work

• A clustering method based on the \(L_ 1\)-norm
• Fast modified global \(k\)-means algorithm for incremental cluster construction
• Optimal covering of plane domains by circles via hyperbolic smoothing
• Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
• Discrete gradient method: Derivative-free method for nonsmooth optimization
• Correction to: Algorithm 39. Clusterwise linear regression
• \(L_1\) cluster analysis
• Lipschitzian optimization without the Lipschitz constant
• Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
• A global optimization approach to classification
• Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
• One-dimensional center-based l 1-clustering method
• A heuristic algorithm for solving the minimum sum-of-squares clustering problems
• An incremental clustering algorithm based on hyperbolic smoothing
• Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization
• A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
• Hyperbolic smoothing function method for minimax problems
• Introduction to Nonsmooth Optimization
• Optimization and nonsmooth analysis
• c-means clustering with the l/sub l/ and l/sub infinity / norms
• Finding Groups in Data
• TSPLIB—A Traveling Salesman Problem Library
• Variable Neighborhood Search
• Smoothing method for minimax problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item