{"id":"https://openalex.org/W2023349184","doi":"https://doi.org/10.1080/10556780500065283","title":"A unifying framework for several cutting plane methods for semidefinite programming","display_name":"A unifying framework for several cutting plane methods for semidefinite programming","publication_year":2005,"publication_date":"2005-11-17","ids":{"openalex":"https://openalex.org/W2023349184","doi":"https://doi.org/10.1080/10556780500065283","mag":"2023349184"},"language":"en","primary_location":{"id":"doi:10.1080/10556780500065283","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780500065283","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/A5047545042","display_name":"Kartik Krishnan","orcid":null},"institutions":[{"id":"https://openalex.org/I98251732","display_name":"McMaster University","ror":"https://ror.org/02fa3aq29","country_code":"CA","type":"education","lineage":["https://openalex.org/I98251732"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Kartik Krishnan","raw_affiliation_strings":["Department of Computing & Software, McMaster University, Hamilton, Ontario, L8S 4K1, Canada","Department of Computing and Software, McMaster University, Hamilton, Ontario, L8S 4K1, Canada#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing & Software, McMaster University, Hamilton, Ontario, L8S 4K1, Canada","institution_ids":["https://openalex.org/I98251732"]},{"raw_affiliation_string":"Department of Computing and Software, McMaster University, Hamilton, Ontario, L8S 4K1, Canada#TAB#","institution_ids":["https://openalex.org/I98251732"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074563047","display_name":"John E. Mitchell","orcid":"https://orcid.org/0000-0001-5087-4679"},"institutions":[{"id":"https://openalex.org/I165799507","display_name":"Rensselaer Polytechnic Institute","ror":"https://ror.org/01rtyzb94","country_code":"US","type":"education","lineage":["https://openalex.org/I165799507"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John E. Mitchell","raw_affiliation_strings":["Mathematical Sciences, Rensselaer Polytechnic Institute, Troy, NY, 12180, USA","Mathematical Sciences , Rensselaer Polytechnic Institute , Troy, NY 12180, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematical Sciences, Rensselaer Polytechnic Institute, Troy, NY, 12180, USA","institution_ids":["https://openalex.org/I165799507"]},{"raw_affiliation_string":"Mathematical Sciences , Rensselaer Polytechnic Institute , Troy, NY 12180, USA","institution_ids":["https://openalex.org/I165799507"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047545042"],"corresponding_institution_ids":["https://openalex.org/I98251732"],"apc_list":null,"apc_paid":null,"fwci":3.6904,"has_fulltext":false,"cited_by_count":40,"citation_normalized_percentile":{"value":0.93207196,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"21","issue":"1","first_page":"57","last_page":"74"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9997000098228455,"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.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9933000206947327,"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"}},{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9714000225067139,"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/cutting-plane-method","display_name":"Cutting-plane method","score":0.9185644388198853},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.6902502775192261},{"id":"https://openalex.org/keywords/differentiable-function","display_name":"Differentiable function","score":0.6113126277923584},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6036176681518555},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.5701614022254944},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.5422654151916504},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.5222785472869873},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5046049356460571},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.445556640625},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4346780776977539},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.4214043915271759},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35629791021347046},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32232677936553955},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.22049090266227722},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.19153109192848206},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.14804646372795105},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.12576788663864136}],"concepts":[{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.9185644388198853},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.6902502775192261},{"id":"https://openalex.org/C202615002","wikidata":"https://www.wikidata.org/wiki/Q783507","display_name":"Differentiable function","level":2,"score":0.6113126277923584},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6036176681518555},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.5701614022254944},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.5422654151916504},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.5222785472869873},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5046049356460571},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.445556640625},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4346780776977539},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.4214043915271759},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35629791021347046},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32232677936553955},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.22049090266227722},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19153109192848206},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.14804646372795105},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12576788663864136},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556780500065283","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780500065283","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":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320311526","display_name":"McMaster University","ror":"https://ror.org/02fa3aq29"},{"id":"https://openalex.org/F4320320939","display_name":"Swedish Foundation for International Cooperation in Research and Higher Education","ror":"https://ror.org/0561xc723"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W572922989","https://openalex.org/W581935970","https://openalex.org/W1512175223","https://openalex.org/W1553702074","https://openalex.org/W1595045940","https://openalex.org/W1857841162","https://openalex.org/W1969873426","https://openalex.org/W1980610004","https://openalex.org/W1982511487","https://openalex.org/W1982604350","https://openalex.org/W1992404387","https://openalex.org/W2005102197","https://openalex.org/W2015681706","https://openalex.org/W2027810472","https://openalex.org/W2034914387","https://openalex.org/W2051306216","https://openalex.org/W2062068908","https://openalex.org/W2069313750","https://openalex.org/W2069314331","https://openalex.org/W2069808690","https://openalex.org/W2085822045","https://openalex.org/W2091371007","https://openalex.org/W2100440346","https://openalex.org/W2118295943","https://openalex.org/W2153543949","https://openalex.org/W2164948865","https://openalex.org/W2234551864","https://openalex.org/W2495457432","https://openalex.org/W2610857016","https://openalex.org/W2911911537","https://openalex.org/W2912522929","https://openalex.org/W4210953350","https://openalex.org/W4243140258","https://openalex.org/W4243539849","https://openalex.org/W4247489173","https://openalex.org/W4291439952","https://openalex.org/W4293860921"],"related_works":["https://openalex.org/W2362705850","https://openalex.org/W2185826091","https://openalex.org/W2048470382","https://openalex.org/W2477407501","https://openalex.org/W2384679317","https://openalex.org/W2078979423","https://openalex.org/W2911215968","https://openalex.org/W1570109187","https://openalex.org/W1583787753","https://openalex.org/W2491692165"],"abstract_inverted_index":{"Cutting":[0],"plane":[1,42,51,65,90,121],"methods":[2,101],"provide":[3],"the":[4,23,30,75,96,129],"means":[5],"to":[6,87],"solve":[7],"large":[8],"scale":[9],"semidefinite":[10],"programs":[11],"(SDP)":[12],"cheaply":[13],"and":[14,57,69],"quickly.":[15],"They":[16],"can":[17],"also":[18],"conceivably":[19],"be":[20],"employed":[21],"for":[22,44,78],"purposes":[24],"of":[25,32,39,116,128],"re-optimization":[26],"after":[27],"branching":[28],"or":[29],"addition":[31],"cutting":[33,41,50,64,89,120],"planes.":[34],"We":[35,82,98],"give":[36],"a":[37,103,113,117,125],"survey":[38],"various":[40,55,88],"approaches":[43,52,91],"SDP":[45],"in":[46,95,102],"this":[47],"paper.":[48],"These":[49],"arise":[53],"from":[54],"perspectives,":[56],"include":[58],"techniques":[59],"based":[60,123],"on":[61,124],"interior":[62],"point":[63],"approaches,":[66],"non-differentiable":[67],"optimization,":[68],"finally":[70],"an":[71,84],"approach":[72,110],"which":[73,106],"mimics":[74],"simplex":[76],"method":[77],"linear":[79],"programming":[80],"(LP).":[81],"present":[83],"accessible":[85],"introduction":[86],"that":[92],"have":[93],"appeared":[94],"literature.":[97],"place":[99],"these":[100],"unifying":[104],"framework":[105],"illustrates":[107],"how":[108],"each":[109],"arises":[111],"as":[112],"natural":[114],"enhancement":[115],"primordial":[118],"LP":[119],"scheme":[122],"semi-infinite":[126],"formulation":[127],"SDP.":[130]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}