{"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/block-simultaneous-direction-method-of","title":"Block-Simultaneous Direction Method of Multipliers: A proximal primal-dual splitting algorithm for nonconvex problems with multiple constraints","arxiv_id":"1708.09066","date":"2017-08-30","proceeding":null,"authors":["Fred Moolekamp","Peter Melchior"],"abstract":"We introduce a generalization of the linearized Alternating Direction Method\nof Multipliers to optimize a real-valued function $f$ of multiple arguments\nwith potentially multiple constraints $g_\\circ$ on each of them. The function\n$f$ may be nonconvex as long as it is convex in every argument, while the\nconstraints $g_\\circ$ need to be convex but not smooth. If $f$ is smooth, the\nproposed Block-Simultaneous Direction Method of Multipliers (bSDMM) can be\ninterpreted as a proximal analog to inexact coordinate descent methods under\nconstraints. Unlike alternative approaches for joint solvers of\nmultiple-constraint problems, we do not require linear operators $L$ of a\nconstraint function $g(L\\ \\cdot)$ to be invertible or linked between each\nother. bSDMM is well-suited for a range of optimization problems, in particular\nfor data analysis, where $f$ is the likelihood function of a model and $L$\ncould be a transformation matrix describing e.g. finite differences or basis\ntransforms. We apply bSDMM to the Non-negative Matrix Factorization task of a\nhyperspectral unmixing problem and demonstrate convergence and effectiveness of\nmultiple constraints on both matrix factors. The algorithms are implemented in\npython and released as an open-source package.","url_abs":"http://arxiv.org/abs/1708.09066v1","url_pdf":"http://arxiv.org/pdf/1708.09066v1.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":"block-simultaneous-direction-method-of","repo_url":"https://github.com/pmelchior/proxmin","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"block-simultaneous-direction-method-of","repo_url":"https://github.com/fred3m/scarlet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"block-simultaneous-direction-method-of","repo_url":"https://github.com/gcmshadow/proxmin","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"hyperspectral-unmixing","task_name":"Hyperspectral Unmixing"}],"methods":[],"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":"pmelchior/proxmin","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"fred3m/scarlet","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1802.10157"],"harvested_for_calls":[{"arxiv_id":"1802.10157","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1802.10157"},"call":"get_harvested_code_for_paper(arxiv_id=\"1802.10157\")"}]},{"repo":"gcmshadow/proxmin","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"805dcdc8f8f12138d521293e957e3661710cff2ae5194ccfebd21dc804b838a0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}