{"id":"https://openalex.org/W3044994834","doi":"https://doi.org/10.1109/tpami.2020.3010811","title":"A Fast Binary Quadratic Programming Solver Based on Stochastic Neighborhood Search","display_name":"A Fast Binary Quadratic Programming Solver Based on Stochastic Neighborhood Search","publication_year":2020,"publication_date":"2020-07-21","ids":{"openalex":"https://openalex.org/W3044994834","doi":"https://doi.org/10.1109/tpami.2020.3010811","mag":"3044994834","pmid":"https://pubmed.ncbi.nlm.nih.gov/32750824"},"language":"en","primary_location":{"id":"doi:10.1109/tpami.2020.3010811","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpami.2020.3010811","pdf_url":null,"source":{"id":"https://openalex.org/S199944782","display_name":"IEEE Transactions on Pattern Analysis and Machine Intelligence","issn_l":"0162-8828","issn":["0162-8828","1939-3539","2160-9292"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Pattern Analysis and Machine Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043480077","display_name":"Benson S. Y. Lam","orcid":null},"institutions":[{"id":"https://openalex.org/I47605537","display_name":"Hang Seng University of Hong Kong","ror":"https://ror.org/04fa64g55","country_code":"HK","type":"education","lineage":["https://openalex.org/I47605537"]},{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"Benson Shu Yan Lam","raw_affiliation_strings":["Department of Mathematics, Statistics, and Insurance, Hang Seng University of Hong Kong, Siu Lek Yuen, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Statistics, and Insurance, Hang Seng University of Hong Kong, Siu Lek Yuen, Hong Kong","institution_ids":["https://openalex.org/I47605537","https://openalex.org/I889458895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091254555","display_name":"Alan Wee\u2010Chung Liew","orcid":"https://orcid.org/0000-0001-6718-7584"},"institutions":[{"id":"https://openalex.org/I11701301","display_name":"Griffith University","ror":"https://ror.org/02sc3r913","country_code":"AU","type":"education","lineage":["https://openalex.org/I11701301"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Alan Wee-Chung Liew","raw_affiliation_strings":["School of Information and Communication Technology, Griffith University, Queensland, Australia"],"affiliations":[{"raw_affiliation_string":"School of Information and Communication Technology, Griffith University, Queensland, Australia","institution_ids":["https://openalex.org/I11701301"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5043480077"],"corresponding_institution_ids":["https://openalex.org/I47605537","https://openalex.org/I889458895"],"apc_list":null,"apc_paid":null,"fwci":0.2958,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.51675978,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"44","issue":"1","first_page":"32","last_page":"49"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6242879629135132},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5777161717414856},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5151373147964478},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4955404996871948},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4892003536224365},{"id":"https://openalex.org/keywords/binary-search-algorithm","display_name":"Binary search algorithm","score":0.4303331971168518},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42335325479507446},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.3941187560558319},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38085877895355225}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6242879629135132},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5777161717414856},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5151373147964478},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4955404996871948},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4892003536224365},{"id":"https://openalex.org/C121610932","wikidata":"https://www.wikidata.org/wiki/Q243754","display_name":"Binary search algorithm","level":3,"score":0.4303331971168518},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42335325479507446},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3941187560558319},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38085877895355225}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tpami.2020.3010811","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpami.2020.3010811","pdf_url":null,"source":{"id":"https://openalex.org/S199944782","display_name":"IEEE Transactions on Pattern Analysis and Machine Intelligence","issn_l":"0162-8828","issn":["0162-8828","1939-3539","2160-9292"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Pattern Analysis and Machine Intelligence","raw_type":"journal-article"},{"id":"pmid:32750824","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/32750824","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE transactions on pattern analysis and machine intelligence","raw_type":null},{"id":"pmh:oai:research-repository.griffith.edu.au:10072/397169","is_oa":false,"landing_page_url":"http://hdl.handle.net/10072/397169","pdf_url":null,"source":{"id":"https://openalex.org/S4306402548","display_name":"Griffith Research Online (Griffith University, Queensland, Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I11701301","host_organization_name":"Griffith University","host_organization_lineage":["https://openalex.org/I11701301"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6399999856948853,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320318339","display_name":"Hang Seng University of Hong Kong","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":55,"referenced_works":["https://openalex.org/W96473315","https://openalex.org/W1507964143","https://openalex.org/W1539726260","https://openalex.org/W1603839367","https://openalex.org/W1849003108","https://openalex.org/W1979554463","https://openalex.org/W1980985059","https://openalex.org/W1985123706","https://openalex.org/W1985476702","https://openalex.org/W1997388944","https://openalex.org/W1999913571","https://openalex.org/W2002507586","https://openalex.org/W2005126631","https://openalex.org/W2024060531","https://openalex.org/W2034331023","https://openalex.org/W2041348403","https://openalex.org/W2045756072","https://openalex.org/W2053060496","https://openalex.org/W2064569891","https://openalex.org/W2066459185","https://openalex.org/W2067612530","https://openalex.org/W2079013783","https://openalex.org/W2097571405","https://openalex.org/W2098651744","https://openalex.org/W2104670598","https://openalex.org/W2106315703","https://openalex.org/W2107884096","https://openalex.org/W2110187141","https://openalex.org/W2121947440","https://openalex.org/W2135762244","https://openalex.org/W2135904200","https://openalex.org/W2137137397","https://openalex.org/W2146807782","https://openalex.org/W2151416140","https://openalex.org/W2160236242","https://openalex.org/W2165450509","https://openalex.org/W2166098345","https://openalex.org/W2413751586","https://openalex.org/W2470330074","https://openalex.org/W2529352582","https://openalex.org/W2546325542","https://openalex.org/W2552652233","https://openalex.org/W2605355993","https://openalex.org/W2750950678","https://openalex.org/W2963128943","https://openalex.org/W2964233346","https://openalex.org/W2964333506","https://openalex.org/W3099955943","https://openalex.org/W4246598646","https://openalex.org/W4249057613","https://openalex.org/W4250589301","https://openalex.org/W6636296250","https://openalex.org/W6675201032","https://openalex.org/W6734664650","https://openalex.org/W7073850106"],"related_works":["https://openalex.org/W2582091787","https://openalex.org/W2998661990","https://openalex.org/W2811435312","https://openalex.org/W4213195198","https://openalex.org/W843542728","https://openalex.org/W2354443135","https://openalex.org/W3181093338","https://openalex.org/W2382626982","https://openalex.org/W4200565068","https://openalex.org/W1576773757"],"abstract_inverted_index":{"Many":[0],"image":[1,181],"processing":[2,182],"and":[3,27,109,183],"pattern":[4,184],"recognition":[5,185],"problems":[6],"can":[7,89],"be":[8,90],"formulated":[9],"as":[10,65],"binary":[11],"quadratic":[12],"programming":[13],"(BQP)":[14],"problems.":[15,186],"However,":[16,57],"solving":[17],"a":[18,23,33,46,53,73,84,91,100,106,110,146,178],"large":[19],"BQP":[20,101],"problem":[21],"with":[22,173,203],"good":[24,74],"quality":[25,121,200],"solution":[26,82,120,143,158,199],"low":[28],"computational":[29,206],"time":[30],"is":[31,159],"still":[32],"challenging":[34],"unsolved":[35],"problem.":[36],"Current":[37],"methodologies":[38],"either":[39],"adopt":[40],"an":[41],"independent":[42,59],"random":[43],"search":[44,51,60,78,108,116,131],"in":[45,52,83,198],"semi-definite":[47],"space":[48],"or":[49],"perform":[50],"relaxed":[54],"biconvex":[55,77],"space.":[56],"the":[58,81,119,125,136,141,156,170,191,204],"has":[61],"great":[62],"computation":[63],"cost":[64],"many":[66,162],"different":[67],"trials":[68],"are":[69,153],"needed":[70],"to":[71,135,144],"get":[72],"solution.":[75,94],"The":[76,114,129],"only":[79,195],"searches":[80],"local":[85,92],"convex":[86],"ball,":[87],"which":[88],"optimal":[93],"In":[95],"this":[96],"paper,":[97],"we":[98],"propose":[99],"solver":[102,172,193],"that":[103,190],"alternatingly":[104],"applies":[105],"deterministic":[107,115],"stochastic":[111,130,147,165],"neighborhood":[112,148,166],"search.":[113],"iteratively":[117],"improves":[118],"until":[122,155],"it":[123],"satisfies":[124],"KKT":[126],"optimality":[127],"conditions.":[128],"performs":[132],"bootstrapping":[133],"sampling":[134],"objective":[137],"function":[138],"constructed":[139],"from":[140],"potential":[142],"find":[145],"vector.":[149],"These":[150],"two":[151],"steps":[152],"repeated":[154],"obtained":[157],"better":[160],"than":[161],"of":[163,180],"its":[164],"vectors.":[167],"We":[168],"compare":[169],"proposed":[171,192],"several":[174],"state-of-the-art":[175],"methods":[176],"for":[177],"range":[179],"Experimental":[187],"results":[188],"showed":[189],"not":[194],"outperformed":[196],"them":[197],"but":[201],"also":[202],"lowest":[205],"complexity.":[207]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1}],"updated_date":"2026-03-27T14:29:43.386196","created_date":"2025-10-10T00:00:00"}