{"id":"https://openalex.org/W2019713176","doi":"https://doi.org/10.1080/10556780500286582","title":"Computational enhancements in low-rank semidefinite programming","display_name":"Computational enhancements in low-rank semidefinite programming","publication_year":2006,"publication_date":"2006-01-13","ids":{"openalex":"https://openalex.org/W2019713176","doi":"https://doi.org/10.1080/10556780500286582","mag":"2019713176"},"language":"en","primary_location":{"id":"doi:10.1080/10556780500286582","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780500286582","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"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/A5002663715","display_name":"Samuel Burer","orcid":"https://orcid.org/0000-0001-5886-458X"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Samuel Burer","raw_affiliation_strings":["University of Iowa, S210 Pappajohn Business Building, Iowa City, IA, 52242-1000, USA","University of Iowa , S210 Pappajohn Business Building, Iowa City, IA, 52242-1000, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Iowa, S210 Pappajohn Business Building, Iowa City, IA, 52242-1000, USA","institution_ids":["https://openalex.org/I126307644"]},{"raw_affiliation_string":"University of Iowa , S210 Pappajohn Business Building, Iowa City, IA, 52242-1000, USA","institution_ids":["https://openalex.org/I126307644"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011541383","display_name":"Changhui Choi","orcid":null},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Changhui Choi","raw_affiliation_strings":["University of Iowa, S210 Pappajohn Business Building, Iowa City, IA, 52242-1000, USA","University of Iowa , S210 Pappajohn Business Building, Iowa City, IA, 52242-1000, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Iowa, S210 Pappajohn Business Building, Iowa City, IA, 52242-1000, USA","institution_ids":["https://openalex.org/I126307644"]},{"raw_affiliation_string":"University of Iowa , S210 Pappajohn Business Building, Iowa City, IA, 52242-1000, USA","institution_ids":["https://openalex.org/I126307644"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5002663715"],"corresponding_institution_ids":["https://openalex.org/I126307644"],"apc_list":null,"apc_paid":null,"fwci":2.582,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.88228792,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"21","issue":"3","first_page":"493","last_page":"512"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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.9997000098228455,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.984499990940094,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/semidefinite-programming","display_name":"Semidefinite programming","score":0.906286358833313},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.7531955242156982},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.6077236533164978},{"id":"https://openalex.org/keywords/semidefinite-embedding","display_name":"Semidefinite embedding","score":0.5652801990509033},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5415220260620117},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.495644211769104},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.49223557114601135},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4915381371974945},{"id":"https://openalex.org/keywords/large-margin-nearest-neighbor","display_name":"Large margin nearest neighbor","score":0.46906161308288574},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.43277984857559204},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4298771321773529},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4252711832523346},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3836210072040558},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.12189221382141113},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11060816049575806},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08918902277946472}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.906286358833313},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.7531955242156982},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.6077236533164978},{"id":"https://openalex.org/C206818286","wikidata":"https://www.wikidata.org/wiki/Q7449403","display_name":"Semidefinite embedding","level":4,"score":0.5652801990509033},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5415220260620117},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.495644211769104},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.49223557114601135},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4915381371974945},{"id":"https://openalex.org/C94475309","wikidata":"https://www.wikidata.org/wiki/Q6489154","display_name":"Large margin nearest neighbor","level":3,"score":0.46906161308288574},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.43277984857559204},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4298771321773529},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4252711832523346},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3836210072040558},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.12189221382141113},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11060816049575806},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08918902277946472},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.0},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556780500286582","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780500286582","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W171072194","https://openalex.org/W1480928214","https://openalex.org/W1506690472","https://openalex.org/W1964681401","https://openalex.org/W1967073510","https://openalex.org/W1972015017","https://openalex.org/W1993000710","https://openalex.org/W1995421692","https://openalex.org/W1999613943","https://openalex.org/W2002576503","https://openalex.org/W2005102197","https://openalex.org/W2007157764","https://openalex.org/W2007421997","https://openalex.org/W2013621063","https://openalex.org/W2015131279","https://openalex.org/W2024457515","https://openalex.org/W2049371785","https://openalex.org/W2051306216","https://openalex.org/W2058360119","https://openalex.org/W2061607408","https://openalex.org/W2064980127","https://openalex.org/W2065110770","https://openalex.org/W2069313750","https://openalex.org/W2090084096","https://openalex.org/W2092162155","https://openalex.org/W2106315703","https://openalex.org/W2107501462","https://openalex.org/W2138505091","https://openalex.org/W2143075842","https://openalex.org/W2149454052","https://openalex.org/W2156722294","https://openalex.org/W2164948865","https://openalex.org/W2167628558","https://openalex.org/W2323980249","https://openalex.org/W2890534020","https://openalex.org/W3029645440","https://openalex.org/W4229666556","https://openalex.org/W4285719527","https://openalex.org/W4293775970"],"related_works":["https://openalex.org/W2051421841","https://openalex.org/W2391916929","https://openalex.org/W2362452378","https://openalex.org/W2364528045","https://openalex.org/W2385886188","https://openalex.org/W2544939111","https://openalex.org/W2524928742","https://openalex.org/W2737505353","https://openalex.org/W121484681","https://openalex.org/W2351113357"],"abstract_inverted_index":{"We":[0],"discuss":[1],"computational":[2],"enhancements":[3,44],"for":[4],"the":[5,11,56],"low-rank":[6],"semidefinite":[7,15],"programming":[8],"algorithm,":[9],"including":[10],"extension":[12],"to":[13,61],"block":[14],"programs":[16],"(SDPs),":[17],"an":[18],"exact":[19],"linesearch":[20],"procedure,":[21],"and":[22,34],"a":[23,48],"dynamic":[24],"rank":[25],"reduction":[26],"scheme.":[27],"A":[28],"truncated-Newton":[29,57],"method":[30],"is":[31,59],"also":[32],"introduced,":[33],"several":[35],"preconditioning":[36],"strategies":[37],"are":[38,45],"proposed.":[39],"Numerical":[40],"experiments":[41],"illustrating":[42],"these":[43],"provided":[46],"on":[47,70],"wide":[49],"class":[50],"of":[51,68],"test":[52],"problems.":[53],"In":[54],"particular,":[55],"variant":[58],"able":[60],"achieve":[62],"high":[63],"accuracy":[64],"in":[65],"modest":[66],"amounts":[67],"time":[69],"maximum-cut-type":[71],"SDPs.":[72]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}