A dual reformulation and solution framework for regularized convex clustering problems
type: Item
instance of: scholarly article
title: A dual reformulation and solution framework for regularized convex clustering problems
zbMATH Open document ID: 1487.62072
author: Panos M. Pardalos
author: Jiaxing Pi
author: Hong-gang Wang
published in: European Journal of Operational Research
publication date: 2021-06-04T00:00:00Z
Mathematics Subject Classification ID: 62H30
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 7355300
zbMATH Keywords: global optimization
zbMATH Keywords: convex clustering
zbMATH Keywords: mathematical programming
zbMATH Keywords: gradient descent
zbMATH Keywords: duality
describes a project that uses: clusterpath
describes a project that uses: fda (R)
describes a project that uses: homals
describes a project that uses: CVX
describes a project that uses: TFOCS
describes a project that uses: sparcl
describes a project that uses: Gifi
MaRDI profile type: Publication
full work available at URL: j.ejor.2020.09.010
OpenAlex ID: W3084810813
cites work: NP-hardness of Euclidean sum-of-squares clustering
cites work: Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
cites work: Smoothing and first order methods: a unified framework
cites work: Templates for convex cone problems with applications to sparse signal recovery
cites work: Functional-bandwidth kernel for support vector machine with functional data: an alternating optimization algorithm
cites work: Variable selection in classification for multivariate functional data
cites work: An algorithm for total variation minimization and applications
cites work: Convex biclustering
cites work: Q3994557
cites work: NP-hard problems in hierarchical-tree clustering
cites work: Biclustering via Sparse Singular Value Decomposition
cites work: The Planar k-Means Problem is NP-Hard
cites work: Comparing clusterings -- an information based distance
cites work: Smooth minimization of non-smooth functions
cites work: Smoothing technique and its applications in semidefinite optimization
cites work: Adaptive restart for accelerated gradient schemes
cites work: Applied functional data analysis. Methods and case studies
cites work: Nonlinear total variation based noise removal algorithms
cites work: Graph dual regularization non-negative matrix factorization for co-clustering
cites work: Regularized \(k\)-means clustering of high-dimensional data and its asymptotic consistency
cites work: Q4864293
cites work: Approximation accuracy, gradient methods, and error bound for structured convex optimization
cites work: Sparse Convex Clustering
cites work: A Framework for Feature Selection in Clustering
cites work: The Adaptive Lasso and Its Oracle Properties
DOI: 10.1016/J.EJOR.2020.09.010
Recommended article: Convex programming based spectral clustering
Recommended article: Q4998873
Recommended article: Convex Clustering via l 1 Fusion Penalization
Recommended article: A Dimension Reduction Technique for Large-Scale Structured Sparse Optimization Problems with Application to Convex Clustering
Recommended article: Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularization
Recommended article: Efficient Semidefinite Spectral Clustering via Lagrange Duality
Recommended article: Q5866396
description: scientific article; zbMATH DE number 7355300