{"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/hybrid-inexact-bcd-for-coupled-structured","title":"Hybrid Inexact BCD for Coupled Structured Matrix Factorization in Hyperspectral Super-Resolution","arxiv_id":"1909.09183","date":"2020-02-20","proceeding":null,"authors":[],"abstract":"This paper develops a first-order optimization method for coupled structured\nmatrix factorization (CoSMF) problems that arise in the context of\nhyperspectral super-resolution (HSR) in remote sensing. To best leverage the\nproblem structures for computational efficiency, we introduce a hybrid inexact\nblock coordinate descent (HiBCD) scheme wherein one coordinate is updated via\nthe fast proximal gradient (FPG) method, while another via the Frank-Wolfe (FW)\nmethod. The FPG-type methods are known to take less number of iterations to\nconverge, by numerical experience, while the FW-type methods can offer lower\nper-iteration complexity in certain cases; and we wish to take the best of\nboth. We show that the limit points of this HiBCD scheme are stationary. Our\nproof treats HiBCD as an optimization framework for a class of multi-block\nstructured optimization problems, and our stationarity claim is applicable not\nonly to CoSMF but also to many other problems. Previous optimization research\nshowed the same stationarity result for inexact block coordinate descent with\neither FPG or FW updates only. Numerical results indicate that the proposed\nHiBCD scheme is computationally much more efficient than the state-of-the-art\nCoSMF schemes in HSR.","url_abs":"http://arxiv.org/abs/1909.09183v3","url_pdf":"http://arxiv.org/pdf/1909.09183v3.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":"hybrid-inexact-bcd-for-coupled-structured","repo_url":"https://github.com/REIYANG/HiBCD","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"computational-efficiency","task_name":"Computational Efficiency"},{"task_slug":"super-resolution","task_name":"Super-Resolution"}],"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":"REIYANG/HiBCD","kind":"official","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":"381eb142a2ae8ec394b5f8853f0180436c0de0a87a05798f64cb19bcff374805","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}