{"id":"https://openalex.org/W7164368068","doi":"https://doi.org/10.1016/j.ejco.2026.100130","title":"Warm-starting outer approximation for parameterized convex MINLP","display_name":"Warm-starting outer approximation for parameterized convex MINLP","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7164368068","doi":"https://doi.org/10.1016/j.ejco.2026.100130"},"language":"en","primary_location":{"id":"doi:10.1016/j.ejco.2026.100130","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.ejco.2026.100130","pdf_url":null,"source":{"id":"https://openalex.org/S4210171502","display_name":"EURO Journal on Computational Optimization","issn_l":"2192-4406","issn":["2192-4406","2192-4414"],"is_oa":true,"is_in_doaj":true,"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":"EURO Journal on Computational Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1016/j.ejco.2026.100130","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5138433963","display_name":"Erik Tamm","orcid":"https://orcid.org/0009-0008-2878-1458"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Erik Tamm","raw_affiliation_strings":["Department of Mathematics, KTH Royal Institute of Technology, Lindstedtsv\u00e4gen 25, Stockholm, SE-10044, Sweden"],"raw_orcid":"https://orcid.org/0009-0008-2878-1458","affiliations":[{"raw_affiliation_string":"Department of Mathematics, KTH Royal Institute of Technology, Lindstedtsv\u00e4gen 25, Stockholm, SE-10044, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020142332","display_name":"Gabriele Eichfelder","orcid":"https://orcid.org/0000-0002-1938-6316"},"institutions":[{"id":"https://openalex.org/I119449181","display_name":"Technische Universit\u00e4t Ilmenau","ror":"https://ror.org/01weqhp73","country_code":"DE","type":"education","lineage":["https://openalex.org/I119449181"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Gabriele Eichfelder","raw_affiliation_strings":["Institute of Mathematics, Technische Universit\u00e4t Ilmenau, Weimarer Strasse 25, Ilmenau, DE-98693, Germany"],"raw_orcid":"https://orcid.org/0000-0002-1938-6316","affiliations":[{"raw_affiliation_string":"Institute of Mathematics, Technische Universit\u00e4t Ilmenau, Weimarer Strasse 25, Ilmenau, DE-98693, Germany","institution_ids":["https://openalex.org/I119449181"]}]},{"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/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Jan Kronqvist","raw_affiliation_strings":["Department of Mathematics, KTH Royal Institute of Technology, Lindstedtsv\u00e4gen 25, Stockholm, SE-10044, Sweden"],"raw_orcid":"https://orcid.org/0000-0003-0299-5745","affiliations":[{"raw_affiliation_string":"Department of Mathematics, KTH Royal Institute of Technology, Lindstedtsv\u00e4gen 25, Stockholm, SE-10044, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5006006057"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":{"value":1400,"currency":"USD","value_usd":1400},"apc_paid":{"value":1400,"currency":"USD","value_usd":1400},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.71514036,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":null,"first_page":"100130","last_page":"100130"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.6046000123023987,"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.6046000123023987,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.03880000114440918,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.03550000116229057,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4397999942302704},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.31049999594688416},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.2689000070095062},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.26249998807907104},{"id":"https://openalex.org/keywords/work","display_name":"Work (physics)","score":0.2583000063896179}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47209998965263367},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.46320000290870667},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4397999942302704},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3174999952316284},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.31049999594688416},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.290800005197525},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.28690001368522644},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2689000070095062},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.26249998807907104},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.2583000063896179},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2547999918460846},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.25459998846054077},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.25279998779296875},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.25119999051094055}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/j.ejco.2026.100130","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.ejco.2026.100130","pdf_url":null,"source":{"id":"https://openalex.org/S4210171502","display_name":"EURO Journal on Computational Optimization","issn_l":"2192-4406","issn":["2192-4406","2192-4414"],"is_oa":true,"is_in_doaj":true,"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":"EURO Journal on Computational Optimization","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2507.08595","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2507.08595","pdf_url":"https://arxiv.org/pdf/2507.08595","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"}],"best_oa_location":{"id":"doi:10.1016/j.ejco.2026.100130","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.ejco.2026.100130","pdf_url":null,"source":{"id":"https://openalex.org/S4210171502","display_name":"EURO Journal on Computational Optimization","issn_l":"2192-4406","issn":["2192-4406","2192-4414"],"is_oa":true,"is_in_doaj":true,"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":"EURO Journal on Computational Optimization","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Climate action","score":0.5013058185577393,"id":"https://metadata.un.org/sdg/13"}],"awards":[{"id":"https://openalex.org/G5094820288","display_name":"Utilizing disjunctive structures in optimization: new algorithms and methods","funder_award_id":"2022-03502","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"}],"funders":[{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W120556424","https://openalex.org/W1984657305","https://openalex.org/W1992656579","https://openalex.org/W1997215277","https://openalex.org/W2033735555","https://openalex.org/W2054137436","https://openalex.org/W2057338659","https://openalex.org/W2061962896","https://openalex.org/W2071334094","https://openalex.org/W2073135589","https://openalex.org/W2083092552","https://openalex.org/W2086315840","https://openalex.org/W2120575449","https://openalex.org/W2124515075","https://openalex.org/W2133304166","https://openalex.org/W2170213261","https://openalex.org/W2219010958","https://openalex.org/W2902723719","https://openalex.org/W3006889477","https://openalex.org/W3208749876","https://openalex.org/W4240374930","https://openalex.org/W4248948761","https://openalex.org/W4379162539"],"related_works":[],"abstract_inverted_index":{"We":[0,19],"address":[1],"the":[2,31,73,86,90,104,111,116,120,123,128,138,171,188,201,207,211,220,240],"challenge":[3],"of":[4,9,42,47,75,82,89,103,137,210,243],"efficiently":[5],"solving":[6,40,244],"parametrized":[7,245],"sequences":[8,41,49],"convex":[10,43,246],"Mixed-Integer":[11],"Nonlinear":[12],"Programming":[13],"(MINLP)":[14],"problems":[15,186,196,199,218],"through":[16],"warm-starting":[17,37,92,140,172,236],"techniques.":[18],"focus":[20],"on":[21,127],"an":[22,150],"outer":[23],"approximation":[24],"(OA)":[25],"approach,":[26],"for":[27,39,94,184,195,216],"which":[28,97],"we":[29,130],"develop":[30],"theoretical":[32],"foundation":[33],"and":[34,153,168,205,232],"present":[35],"two":[36,164],"techniques":[38,141],"MINLPs.":[44,247],"These":[45],"types":[46],"problem":[48,77,109],"arise":[50],"in":[51,71,143,175,178,187,200,219,230],"several":[52,185,217],"important":[53],"applications,":[54],"such":[55],"as,":[56],"multiobjective":[57],"MINLPs":[58],"using":[59],"scalarization":[60],"techniques,":[61],"sparse":[62],"linear":[63,105],"regression,":[64],"hybrid":[65],"model":[66],"predictive":[67],"control,":[68],"or":[69],"simply":[70],"analyzing":[72],"impact":[74],"certain":[76],"parameters.":[78],"The":[79,222],"main":[80],"contribution":[81],"this":[83],"paper":[84],"is":[85,227],"mathematical":[87],"analysis":[88],"proposed":[91,139],"framework":[93],"OA-based":[95],"algorithms,":[96],"shows":[98],"that":[99,122,135,170,225],"a":[100,179],"simple":[101],"adaptation":[102],"relaxation":[106],"from":[107],"one":[108,136,145],"to":[110,148,163,182,234,237],"next":[112],"can":[113,173],"greatly":[114],"improve":[115],"computational":[117,241],"performance.":[118],"In":[119],"case":[121],"parameters":[124],"depend":[125],"linearly":[126],"parameter,":[129],"prove":[131],"under":[132],"some":[133],"assumptions":[134],"results":[142,157,223],"only":[144],"OA":[146],"iteration":[147,181],"find":[149],"optimal":[151,212],"solution":[152],"verify":[154],"optimality.":[155],"Numerical":[156],"demonstrate":[158],"noticeable":[159],"performance":[160],"improvements":[161],"compared":[162],"common":[165],"initialization":[166],"approaches,":[167],"show":[169,224],"also":[174],"practice":[176],"result":[177],"single":[180],"converge":[183],"sequences.":[189],"Our":[190],"methods":[191],"are":[192,203,214],"especially":[193],"effective":[194],"where":[197,206],"consecutive":[198],"sequence":[202],"similar,":[204],"integer":[208],"part":[209],"solutions":[213],"constant":[215],"sequence.":[221],"it":[226],"possible,":[228],"both":[229],"theory":[231],"practice,":[233],"perform":[235],"significantly":[238],"enhance":[239],"efficiency":[242]},"counts_by_year":[],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2026-06-12T00:00:00"}