{"id":"https://openalex.org/W3136201123","doi":"https://doi.org/10.1007/s10898-021-01006-1","title":"Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT","display_name":"Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT","publication_year":2021,"publication_date":"2021-03-20","ids":{"openalex":"https://openalex.org/W3136201123","doi":"https://doi.org/10.1007/s10898-021-01006-1","mag":"3136201123"},"language":"en","primary_location":{"id":"doi:10.1007/s10898-021-01006-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10898-021-01006-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10898-021-01006-1.pdf","source":{"id":"https://openalex.org/S115925768","display_name":"Journal of Global Optimization","issn_l":"0925-5001","issn":["0925-5001","1573-2916"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Global Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10898-021-01006-1.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030912699","display_name":"Andreas Lundell","orcid":"https://orcid.org/0000-0002-1548-1893"},"institutions":[{"id":"https://openalex.org/I130217899","display_name":"\u00c5bo Akademi University","ror":"https://ror.org/029pk6x14","country_code":"FI","type":"education","lineage":["https://openalex.org/I130217899"]}],"countries":["FI"],"is_corresponding":true,"raw_author_name":"Andreas Lundell","raw_affiliation_strings":["Department of Information Technologies / Department of Mathematics, Faculty Science and Engineering, \u00c5bo Akademi University, Turku, Finland"],"raw_orcid":"https://orcid.org/0000-0002-1548-1893","affiliations":[{"raw_affiliation_string":"Department of Information Technologies / Department of Mathematics, Faculty Science and Engineering, \u00c5bo Akademi University, Turku, Finland","institution_ids":["https://openalex.org/I130217899"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006006057","display_name":"Jan Kronqvist","orcid":"https://orcid.org/0000-0003-0299-5745"},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Jan Kronqvist","raw_affiliation_strings":["Department of Computing, Imperial College London, London, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0003-0299-5745","affiliations":[{"raw_affiliation_string":"Department of Computing, Imperial College London, London, United Kingdom","institution_ids":["https://openalex.org/I47508984"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5006006057","https://openalex.org/A5030912699"],"corresponding_institution_ids":["https://openalex.org/I130217899","https://openalex.org/I47508984"],"apc_list":{"value":2780,"currency":"USD","value_usd":2780},"apc_paid":{"value":2780,"currency":"USD","value_usd":2780},"fwci":1.7662,"has_fulltext":true,"cited_by_count":16,"citation_normalized_percentile":{"value":0.81150643,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"82","issue":"4","first_page":"863","last_page":"896"},"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"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/T11053","display_name":"Process Optimization and Integration","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7436564564704895},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7116894721984863},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.6888430118560791},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6739530563354492},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5626057982444763},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.5558611750602722},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5431181788444519},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.540814220905304},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.506079375743866},{"id":"https://openalex.org/keywords/hyperplane","display_name":"Hyperplane","score":0.49083906412124634},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.43575167655944824},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4296572208404541},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3272457420825958},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.0650622546672821}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7436564564704895},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7116894721984863},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.6888430118560791},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6739530563354492},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5626057982444763},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.5558611750602722},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5431181788444519},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.540814220905304},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.506079375743866},{"id":"https://openalex.org/C68693459","wikidata":"https://www.wikidata.org/wiki/Q657586","display_name":"Hyperplane","level":2,"score":0.49083906412124634},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.43575167655944824},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4296572208404541},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3272457420825958},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0650622546672821},{"id":"https://openalex.org/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10898-021-01006-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10898-021-01006-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10898-021-01006-1.pdf","source":{"id":"https://openalex.org/S115925768","display_name":"Journal of Global Optimization","issn_l":"0925-5001","issn":["0925-5001","1573-2916"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Global Optimization","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/0e5e8599-4451-4f74-b2fb-0984dd77fa3f","is_oa":true,"landing_page_url":"https://research.abo.fi/en/publications/0e5e8599-4451-4f74-b2fb-0984dd77fa3f","pdf_url":null,"source":{"id":"https://openalex.org/S4406923060","display_name":"\u00c5bo Akademi University Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lundell, A & Kronqvist, J 2021, 'Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT', Journal of Global Optimization. https://doi.org/10.1007/s10898-021-01006-1","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:RePEc:spr:jglopt:v:82:y:2022:i:4:d:10.1007_s10898-021-01006-1","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10898-021-01006-1","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s10898-021-01006-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10898-021-01006-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10898-021-01006-1.pdf","source":{"id":"https://openalex.org/S115925768","display_name":"Journal of Global Optimization","issn_l":"0925-5001","issn":["0925-5001","1573-2916"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Global Optimization","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3038228801","display_name":null,"funder_award_id":"NIF\\R1\\182194","funder_id":"https://openalex.org/F4320320006","funder_display_name":"Royal Society"}],"funders":[{"id":"https://openalex.org/F4320320006","display_name":"Royal Society","ror":"https://ror.org/03wnrjx87"},{"id":"https://openalex.org/F4320322400","display_name":"Magnus Ehrnroothin S\u00e4\u00e4ti\u00f6","ror":"https://ror.org/02cdzet69"},{"id":"https://openalex.org/F4320324257","display_name":"Svenska Kulturfonden","ror":"https://ror.org/04a31ep84"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W3136201123.pdf"},"referenced_works_count":71,"referenced_works":["https://openalex.org/W10227180","https://openalex.org/W38115229","https://openalex.org/W54096403","https://openalex.org/W114465074","https://openalex.org/W805566928","https://openalex.org/W1132658092","https://openalex.org/W1481924060","https://openalex.org/W1515641485","https://openalex.org/W1825288209","https://openalex.org/W1855884329","https://openalex.org/W1918578756","https://openalex.org/W1918816242","https://openalex.org/W1966205829","https://openalex.org/W1967559983","https://openalex.org/W1972459914","https://openalex.org/W1997215277","https://openalex.org/W2001445580","https://openalex.org/W2001741445","https://openalex.org/W2004407575","https://openalex.org/W2007231110","https://openalex.org/W2007967264","https://openalex.org/W2017151271","https://openalex.org/W2033735555","https://openalex.org/W2045982444","https://openalex.org/W2050339136","https://openalex.org/W2054137436","https://openalex.org/W2057338659","https://openalex.org/W2057443868","https://openalex.org/W2057586259","https://openalex.org/W2061962896","https://openalex.org/W2067569795","https://openalex.org/W2068965055","https://openalex.org/W2071334094","https://openalex.org/W2072881663","https://openalex.org/W2073135589","https://openalex.org/W2084006722","https://openalex.org/W2091593675","https://openalex.org/W2095476732","https://openalex.org/W2123871098","https://openalex.org/W2127022339","https://openalex.org/W2135151510","https://openalex.org/W2218945732","https://openalex.org/W2219010958","https://openalex.org/W2242422634","https://openalex.org/W2410936218","https://openalex.org/W2411933627","https://openalex.org/W2418368257","https://openalex.org/W2745993358","https://openalex.org/W2766511395","https://openalex.org/W2767791580","https://openalex.org/W2767914269","https://openalex.org/W2790736634","https://openalex.org/W2793437242","https://openalex.org/W2798425997","https://openalex.org/W2801755592","https://openalex.org/W2811067097","https://openalex.org/W2894871027","https://openalex.org/W2902723719","https://openalex.org/W2904818131","https://openalex.org/W2915825623","https://openalex.org/W2916638179","https://openalex.org/W2943368153","https://openalex.org/W2950287709","https://openalex.org/W2963990227","https://openalex.org/W2975229626","https://openalex.org/W3007543531","https://openalex.org/W3100769578","https://openalex.org/W3103379443","https://openalex.org/W3105558219","https://openalex.org/W3113220933","https://openalex.org/W4297688559"],"related_works":["https://openalex.org/W2478592842","https://openalex.org/W2047956094","https://openalex.org/W1980522505","https://openalex.org/W2003270086","https://openalex.org/W1967430243","https://openalex.org/W4378552474","https://openalex.org/W2094042442","https://openalex.org/W156299565","https://openalex.org/W2018296860","https://openalex.org/W2108682989"],"abstract_inverted_index":{"Abstract":[0],"Different":[1],"versions":[2],"of":[3,53,58,72,115,159,164,176,180],"polyhedral":[4,51],"outer":[5],"approximation":[6],"are":[7],"used":[8],"by":[9],"many":[10],"algorithms":[11],"for":[12,27,78,104,112,119,130,167],"mixed-integer":[13],"nonlinear":[14,55],"programming":[15],"(MINLP).":[16],"While":[17],"it":[18],"has":[19,36],"been":[20,38],"demonstrated":[21],"that":[22,90,172],"such":[23],"methods":[24,148],"work":[25],"well":[26],"convex":[28,79],"MINLP,":[29],"extending":[30],"them":[31],"to":[32,88,95,108,126,139,153],"solve":[33],"nonconvex":[34,96,157,168,181],"problems":[35],"traditionally":[37],"challenging.":[39],"The":[40,98],"Supporting":[41],"Hyperplane":[42],"Optimization":[43],"Toolkit":[44],"(SHOT)":[45],"is":[46,62,69,136,170],"a":[47,174],"solver":[48],"based":[49],"on":[50],"approximations":[52],"the":[54,73,106,128,155,177],"feasible":[56,132],"set":[57],"MINLP":[59,169],"problems.":[60,97],"SHOT":[61,89],"an":[63,161],"open":[64],"source":[65],"COIN-OR":[66],"project,":[67],"and":[68,122],"currently":[70],"one":[71],"most":[74],"efficient":[75],"global":[76],"solvers":[77,166],"MINLP.":[80,182],"In":[81,151],"this":[82],"paper,":[83],"we":[84],"discuss":[85],"some":[86],"extensions":[87],"significantly":[91],"extend":[92],"its":[93],"applicability":[94],"functionality":[99,135,158],"include":[100],"utilizing":[101],"convexity":[102],"detection":[103],"selecting":[105],"nonlinearities":[107],"linearize,":[109],"lifting":[110],"reformulations":[111],"special":[113],"classes":[114],"functions,":[116],"feasibility":[117],"relaxations":[118],"infeasible":[120],"subproblems":[121],"adding":[123],"objective":[124],"cuts":[125],"force":[127],"search":[129],"better":[131],"solutions.":[133],"This":[134],"not":[137],"unique":[138],"SHOT,":[140,160],"but":[141],"can":[142],"be":[143],"implemented":[144],"in":[145],"other":[146],"similar":[147],"as":[149],"well.":[150],"addition":[152],"discussing":[154],"new":[156],"extensive":[162],"benchmark":[163],"deterministic":[165],"performed":[171],"provides":[173],"snapshot":[175],"current":[178],"state":[179]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}