{"id":"https://openalex.org/W2546569438","doi":"https://doi.org/10.1080/10556788.2016.1245732","title":"Inner approximations of completely positive reformulations of mixed binary quadratic programs: a unified analysis","display_name":"Inner approximations of completely positive reformulations of mixed binary quadratic programs: a unified analysis","publication_year":2016,"publication_date":"2016-11-02","ids":{"openalex":"https://openalex.org/W2546569438","doi":"https://doi.org/10.1080/10556788.2016.1245732","mag":"2546569438"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2016.1245732","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2016.1245732","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/A5057209882","display_name":"E. Alper Y\u0131ld\u0131r\u0131m","orcid":"https://orcid.org/0000-0003-4141-3189"},"institutions":[{"id":"https://openalex.org/I1351752","display_name":"Ko\u00e7 University","ror":"https://ror.org/00jzwgz36","country_code":"TR","type":"education","lineage":["https://openalex.org/I1351752"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"E. Alper Y\u0131ld\u0131r\u0131m","raw_affiliation_strings":["Department of Industrial Engineering, Ko\u00e7 University, 34450 Sar\u0131yer, Istanbul, Turkey"],"raw_orcid":"https://orcid.org/0000-0003-4141-3189","affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Ko\u00e7 University, 34450 Sar\u0131yer, Istanbul, Turkey","institution_ids":["https://openalex.org/I1351752"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5057209882"],"corresponding_institution_ids":["https://openalex.org/I1351752"],"apc_list":null,"apc_paid":null,"fwci":0.4605,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.668809,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"32","issue":"6","first_page":"1163","last_page":"1186"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9977999925613403,"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.9977999925613403,"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.9973999857902527,"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/T12288","display_name":"Optimization and Search Problems","score":0.9969000220298767,"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/mathematics","display_name":"Mathematics","score":0.7069978713989258},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.7064982056617737},{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.5990200042724609},{"id":"https://openalex.org/keywords/second-order-cone-programming","display_name":"Second-order cone programming","score":0.5767924785614014},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5478971004486084},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5358198285102844},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5296663641929626},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5221564769744873},{"id":"https://openalex.org/keywords/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.5129491686820984},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4800506830215454},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.4627179503440857},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4509921371936798},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.41082438826560974},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.326696515083313},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.15729480981826782}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7069978713989258},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.7064982056617737},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.5990200042724609},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.5767924785614014},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5478971004486084},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5358198285102844},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5296663641929626},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5221564769744873},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.5129491686820984},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4800506830215454},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4627179503440857},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4509921371936798},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.41082438826560974},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.326696515083313},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.15729480981826782},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556788.2016.1245732","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2016.1245732","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":22,"referenced_works":["https://openalex.org/W598314002","https://openalex.org/W828813279","https://openalex.org/W1481481825","https://openalex.org/W1518832340","https://openalex.org/W1526536257","https://openalex.org/W1549791526","https://openalex.org/W1999032440","https://openalex.org/W2018836677","https://openalex.org/W2018913147","https://openalex.org/W2025776604","https://openalex.org/W2027470314","https://openalex.org/W2047601391","https://openalex.org/W2049904561","https://openalex.org/W2078600458","https://openalex.org/W2079135578","https://openalex.org/W2106875569","https://openalex.org/W2114467398","https://openalex.org/W2124487034","https://openalex.org/W2126138717","https://openalex.org/W2136885855","https://openalex.org/W2161198298","https://openalex.org/W4248749630"],"related_works":["https://openalex.org/W4206704743","https://openalex.org/W4313119266","https://openalex.org/W2164807043","https://openalex.org/W3206492465","https://openalex.org/W2019128690","https://openalex.org/W4231448069","https://openalex.org/W2128461291","https://openalex.org/W2355907103","https://openalex.org/W2270789747","https://openalex.org/W4307933212"],"abstract_inverted_index":{"Every":[0],"quadratic":[1,70,160,168],"programming":[2,71],"problem":[3,27],"with":[4,170],"a":[5,17,24,75,92,108,126,171],"mix":[6],"of":[7,35,48,51,57,67,77,80,91,111,115,138,144,152],"continuous":[8],"and":[9,142,158],"binary":[10,69,167],"variables":[11],"can":[12],"be":[13],"equivalently":[14],"reformulated":[15],"as":[16,85,87,125,162,164],"completely":[18,36,52,58,118],"positive":[19,37,53,59,119],"optimization":[20,26,60,120],"problem,":[21],"that":[22,62,101,143],"is,":[23],"linear":[25],"over":[28],"the":[29,49,65,78,88,112,116,132,135,145,150],"convex":[30],"but":[31],"computationally":[32],"intractable":[33],"cone":[34,50],"matrices.":[38],"In":[39,96],"this":[40,153],"paper,":[41],"we":[42],"focus":[43],"on":[44,55,131],"general":[45,165],"inner":[46,83,94,103,140],"approximations":[47,104],"matrices":[54],"instances":[56],"problems":[61],"arise":[63],"from":[64],"reformulation":[66],"mixed":[68,166],"problems.":[72],"We":[73,148],"provide":[74],"characterization":[76,123],"feasibility":[79],"such":[81],"an":[82,128,139],"approximation":[84,141],"well":[86,163],"optimal":[89,136],"value":[90,137],"feasible":[93,113,173],"approximation.":[95],"particular,":[97],"our":[98],"results":[99],"imply":[100],"polyhedral":[102],"are":[105],"equivalent":[106],"to":[107],"finite":[109],"discretization":[110],"region":[114],"original":[117,146],"problem.":[121],"Our":[122],"yields,":[124],"byproduct,":[127],"upper":[129],"bound":[130,155],"gap":[133],"between":[134],"instance.":[147],"discuss":[149],"implications":[151],"error":[154],"for":[156],"standard":[157],"box-constrained":[159],"programs":[161,169],"bounded":[172],"region.":[174]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}