{"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/a-fast-semidefinite-approach-to-solving","title":"A Fast Semidefinite Approach to Solving Binary Quadratic Problems","arxiv_id":"1304.0840","date":"2013-04-03","proceeding":"CVPR 2013 6","authors":["Peng Wang","Chunhua Shen","Anton Van Den Hengel"],"abstract":"Many computer vision problems can be formulated as binary quadratic programs\n(BQPs). Two classic relaxation methods are widely used for solving BQPs,\nnamely, spectral methods and semidefinite programming (SDP), each with their\nown advantages and disadvantages. Spectral relaxation is simple and easy to\nimplement, but its bound is loose. Semidefinite relaxation has a tighter bound,\nbut its computational complexity is high for large scale problems. We present a\nnew SDP formulation for BQPs, with two desirable properties. First, it has a\nsimilar relaxation bound to conventional SDP formulations. Second, compared\nwith conventional SDP methods, the new SDP formulation leads to a significantly\nmore efficient and scalable dual optimization approach, which has the same\ndegree of complexity as spectral methods. Extensive experiments on various\napplications including clustering, image segmentation, co-segmentation and\nregistration demonstrate the usefulness of our SDP formulation for solving\nlarge-scale BQPs.","url_abs":"http://arxiv.org/abs/1304.0840v1","url_pdf":"http://arxiv.org/pdf/1304.0840v1.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":"a-fast-semidefinite-approach-to-solving","repo_url":"https://github.com/Axeldnahcram/biconvex_relaxation","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"image-segmentation","task_name":"Image Segmentation"},{"task_slug":"segmentation","task_name":"Segmentation"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"}],"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":"Axeldnahcram/biconvex_relaxation","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":"dade3f840914a398745af7b1a3a913d8157e1a38245fa53b598ead3b900fb512","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}