A dual reformulation and solution framework for regularized convex clustering problems

DOI10.1016/j.ejor.2020.09.010zbMath1487.62072MaRDI QIDQ2029898

Panos M. Pardalos, Jiaxing Pi, Hong-gang Wang

Publication date: 4 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2020.09.010

zbMATH Keywords

global optimization; duality; mathematical programming; gradient descent; convex clustering

Mathematics Subject Classification ID

62H30: Classification and discrimination; cluster analysis (statistical aspects)

90C25: Convex programming

90C46: Optimality conditions and duality in mathematical programming

Uses Software

• fda (R)
• CVX
• TFOCS
• homals
• sparcl
• Gifi
• clusterpath

Cites Work

• Unnamed Item
• Unnamed Item
• Nonlinear total variation based noise removal algorithms
• Smooth minimization of non-smooth functions
• The Adaptive Lasso and Its Oracle Properties
• Graph dual regularization non-negative matrix factorization for co-clustering
• Approximation accuracy, gradient methods, and error bound for structured convex optimization
• Smoothing technique and its applications in semidefinite optimization
• NP-hardness of Euclidean sum-of-squares clustering
• NP-hard problems in hierarchical-tree clustering
• An algorithm for total variation minimization and applications
• Applied functional data analysis. Methods and case studies
• Functional-bandwidth kernel for support vector machine with functional data: an alternating optimization algorithm
• Templates for convex cone problems with applications to sparse signal recovery
• Regularized \(k\)-means clustering of high-dimensional data and its asymptotic consistency
• Variable selection in classification for multivariate functional data
• Adaptive restart for accelerated gradient schemes
• Comparing clusterings -- an information based distance
• Smoothing and First Order Methods: A Unified Framework
• Biclustering via Sparse Singular Value Decomposition
• Sparse Convex Clustering
• The Planar k-Means Problem is NP-Hard
• A Framework for Feature Selection in Clustering
• Convex biclustering
• Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems