{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/splitting-methods-for-convex-clustering","title":"Splitting Methods for Convex Clustering","arxiv_id":"1304.0499","date":"2013-04-01","proceeding":null,"authors":["Eric C. Chi","Kenneth Lange"],"abstract":"Clustering is a fundamental problem in many scientific applications. Standard\nmethods such as $k$-means, Gaussian mixture models, and hierarchical\nclustering, however, are beset by local minima, which are sometimes drastically\nsuboptimal. Recently introduced convex relaxations of $k$-means and\nhierarchical clustering shrink cluster centroids toward one another and ensure\na unique global minimizer. In this work we present two splitting methods for\nsolving the convex clustering problem. The first is an instance of the\nalternating direction method of multipliers (ADMM); the second is an instance\nof the alternating minimization algorithm (AMA). In contrast to previously\nconsidered algorithms, our ADMM and AMA formulations provide simple and unified\nframeworks for solving the convex clustering problem under the previously\nstudied norms and open the door to potentially novel norms. We demonstrate the\nperformance of our algorithm on both simulated and real data examples. While\nthe differences between the two algorithms appear to be minor on the surface,\ncomplexity analysis and numerical experiments show AMA to be significantly more\nefficient.","url_abs":"http://arxiv.org/abs/1304.0499v2","url_pdf":"http://arxiv.org/pdf/1304.0499v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"splitting-methods-for-convex-clustering","repo_url":"https://github.com/echi/cvxclustr","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"}],"methods":[{"method_slug":"admm","method_name":"ADMM"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"echi/cvxclustr","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"3539d2a812a06a46c736c05557df097c30f32da803d0930a6b506ca3447f89bf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}