Global optimization for cardinality-constrained minimum sum-of-squares clustering via semidefinite programming
出版年份 2023 全文链接
标题
Global optimization for cardinality-constrained minimum sum-of-squares clustering via semidefinite programming
作者
关键词
-
出版物
MATHEMATICAL PROGRAMMING
Volume -, Issue -, Pages -
出版商
Springer Science and Business Media LLC
发表日期
2023-10-12
DOI
10.1007/s10107-023-02021-8
参考文献
相关参考文献
注意:仅列出部分参考文献,下载原文获取全部文献信息。- Mixed-Integer Nonlinear Programming for State-based Non-Intrusive Load Monitoring
- (2022) Marco Balletti et al. IEEE Transactions on Smart Grid
- The Ratio-Cut Polytope and K-Means Clustering
- (2022) Antonio De Rosa et al. SIAM JOURNAL ON OPTIMIZATION
- An exact algorithm for semi-supervised minimum sum-of-squares clustering
- (2022) Veronica Piccialli et al. COMPUTERS & OPERATIONS RESEARCH
- A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem
- (2021) Xinxin Li et al. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
- A machine learning approach for forecasting hierarchical time series
- (2021) Paolo Mancuso et al. EXPERT SYSTEMS WITH APPLICATIONS
- A matheuristic for large-scale capacitated clustering
- (2021) Mario Gnägi et al. COMPUTERS & OPERATIONS RESEARCH
- A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering
- (2021) Rodrigo Randel et al. DATA MINING AND KNOWLEDGE DISCOVERY
- Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections
- (2021) Leo Liberti et al. JOURNAL OF GLOBAL OPTIMIZATION
- Improving ADMMs for solving doubly nonnegative programs through dual factorization
- (2020) Martina Cerulli et al. 4OR-A Quarterly Journal of Operations Research
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
- (2019) Defeng Sun et al. OPTIMIZATION METHODS & SOFTWARE
- How much can k-means be improved by using better initialization and repeats?
- (2019) Pasi Fränti et al. PATTERN RECOGNITION
- On semidefinite relaxations for the block model
- (2018) Arash A. Amini et al. ANNALS OF STATISTICS
- When do birds of a feather flock together? k-Means, proximity, and conic programming
- (2018) Xiaodong Li et al. MATHEMATICAL PROGRAMMING
- Less is more: basic variable neighborhood search heuristic for balanced minimum sum-of-squares clustering
- (2017) Leandro R. Costa et al. INFORMATION SCIENCES
- Computational results of a semidefinite branch-and-bound algorithm for k-cluster
- (2016) Nathan Krislock et al. COMPUTERS & OPERATIONS RESEARCH
- Probably certifiably correct k-means clustering
- (2016) Takayuki Iguchi et al. MATHEMATICAL PROGRAMMING
- A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
- (2015) Defeng Sun et al. SIAM JOURNAL ON OPTIMIZATION
- On a decomposition lemma for positive semi-definite block-matrices
- (2012) Jean-Christophe Bourin et al. LINEAR ALGEBRA AND ITS APPLICATIONS
- On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming
- (2011) Yichuan Ding et al. MATHEMATICS OF OPERATIONS RESEARCH
- Data clustering with size constraints
- (2010) Shunzhi Zhu et al. KNOWLEDGE-BASED SYSTEMS
- An improved column generation algorithm for minimum sum-of-squares clustering
- (2010) Daniel Aloise et al. MATHEMATICAL PROGRAMMING
- Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinite Programming
- (2010) Hans Mittelmann et al. SIAM JOURNAL ON OPTIMIZATION
- NP-hardness of Euclidean sum-of-squares clustering
- (2009) Daniel Aloise et al. MACHINE LEARNING
- A global optimization method for semi-supervised clustering
- (2008) Yu Xia DATA MINING AND KNOWLEDGE DISCOVERY
- Towards effective document clustering: A constrained K-means based approach
- (2008) Guobiao Hu et al. INFORMATION PROCESSING & MANAGEMENT
- Rigorous Error Bounds for the Optimal Value in Semidefinite Programming
- (2007) Christian Jansson et al. SIAM JOURNAL ON NUMERICAL ANALYSIS
Find Funding. Review Successful Grants.
Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.
ExploreFind the ideal target journal for your manuscript
Explore over 38,000 international journals covering a vast array of academic fields.
Search