{"id":"https://openalex.org/W4383736991","doi":"https://doi.org/10.1080/10556788.2023.2222429","title":"Sparse convex optimization toolkit: a mixed-integer framework","display_name":"Sparse convex optimization toolkit: a mixed-integer framework","publication_year":2023,"publication_date":"2023-07-10","ids":{"openalex":"https://openalex.org/W4383736991","doi":"https://doi.org/10.1080/10556788.2023.2222429"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2023.2222429","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2023.2222429","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/A5046031441","display_name":"Alireza Olama","orcid":"https://orcid.org/0000-0002-1787-3487"},"institutions":[{"id":"https://openalex.org/I4104125","display_name":"Universidade Federal de Santa Catarina","ror":"https://ror.org/041akq887","country_code":"BR","type":"education","lineage":["https://openalex.org/I4104125"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Alireza Olama","raw_affiliation_strings":["Automation and System Engineering Department, Federal University of Santa Catarina, Florian\u00f3polis, Brazil"],"raw_orcid":"https://orcid.org/0000-0002-1787-3487","affiliations":[{"raw_affiliation_string":"Automation and System Engineering Department, Federal University of Santa Catarina, Florian\u00f3polis, Brazil","institution_ids":["https://openalex.org/I4104125"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065625026","display_name":"Eduardo Camponogara","orcid":"https://orcid.org/0000-0002-0236-0689"},"institutions":[{"id":"https://openalex.org/I4104125","display_name":"Universidade Federal de Santa Catarina","ror":"https://ror.org/041akq887","country_code":"BR","type":"education","lineage":["https://openalex.org/I4104125"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Eduardo Camponogara","raw_affiliation_strings":["Automation and System Engineering Department, Federal University of Santa Catarina, Florian\u00f3polis, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Automation and System Engineering Department, Federal University of Santa Catarina, Florian\u00f3polis, Brazil","institution_ids":["https://openalex.org/I4104125"]}]},{"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":false,"raw_author_name":"Jan Kronqvist","raw_affiliation_strings":["Department of Mathematics, KTH Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5046031441"],"corresponding_institution_ids":["https://openalex.org/I4104125"],"apc_list":null,"apc_paid":null,"fwci":0.7344,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.63924256,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"38","issue":"6","first_page":"1269","last_page":"1295"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998999834060669,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9954000115394592,"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.9941999912261963,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.78255295753479},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6304407715797424},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5584810376167297},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.55157870054245},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5409989356994629},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.5387791991233826},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5091227889060974},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.46265631914138794},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4545229971408844},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.41439008712768555},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3611198663711548},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.35375258326530457},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30535656213760376},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.05762118101119995}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.78255295753479},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6304407715797424},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5584810376167297},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.55157870054245},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5409989356994629},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.5387791991233826},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5091227889060974},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.46265631914138794},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4545229971408844},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.41439008712768555},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3611198663711548},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.35375258326530457},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30535656213760376},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.05762118101119995},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/10556788.2023.2222429","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2023.2222429","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"},{"id":"pmh:oai:pure.atira.dk:publications/d3cd2b1b-d4d5-403f-91f1-1d5017a41ea9","is_oa":false,"landing_page_url":"https://dx.doi.org/10.1080/10556788.2023.2222429","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Olama, A, Camponogara, E & Kronqvist, J 2023, 'Sparse convex optimization toolkit: a mixed-integer framework', Optimization Methods and Software, vol. 38, no. 6, pp. 1269-1295. https://doi.org/10.1080/10556788.2023.2222429","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6460580657","display_name":null,"funder_award_id":"2021TR2265","funder_id":"https://openalex.org/F4320323349","funder_display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa e Inova\u00e7\u00e3o do Estado de Santa Catarina"},{"id":"https://openalex.org/G7695245903","display_name":null,"funder_award_id":"698503P1","funder_id":"https://openalex.org/F4320321091","funder_display_name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior"}],"funders":[{"id":"https://openalex.org/F4320321091","display_name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","ror":"https://ror.org/00x0ma614"},{"id":"https://openalex.org/F4320323349","display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa e Inova\u00e7\u00e3o do Estado de Santa Catarina","ror":"https://ror.org/0503xdx77"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W128066468","https://openalex.org/W180478659","https://openalex.org/W205433031","https://openalex.org/W1531340371","https://openalex.org/W1993528080","https://openalex.org/W2004407575","https://openalex.org/W2028781966","https://openalex.org/W2057338659","https://openalex.org/W2066875914","https://openalex.org/W2071334094","https://openalex.org/W2078204800","https://openalex.org/W2082471977","https://openalex.org/W2083137236","https://openalex.org/W2123871098","https://openalex.org/W2135046866","https://openalex.org/W2166029977","https://openalex.org/W2166797227","https://openalex.org/W2170213261","https://openalex.org/W2589196350","https://openalex.org/W2751275235","https://openalex.org/W2769646558","https://openalex.org/W2793437242","https://openalex.org/W2807424650","https://openalex.org/W2902723719","https://openalex.org/W2904818131","https://openalex.org/W2907560147","https://openalex.org/W2944929400","https://openalex.org/W2951869637","https://openalex.org/W2955008915","https://openalex.org/W2963351303","https://openalex.org/W2963374044","https://openalex.org/W3038000482","https://openalex.org/W3101798601","https://openalex.org/W3147003781","https://openalex.org/W3181408577","https://openalex.org/W3208154528","https://openalex.org/W3209928754","https://openalex.org/W4205423034","https://openalex.org/W4211090019","https://openalex.org/W4246367117","https://openalex.org/W4292363360","https://openalex.org/W4300263211","https://openalex.org/W4301014524","https://openalex.org/W4312118294"],"related_works":["https://openalex.org/W1925942709","https://openalex.org/W2047683846","https://openalex.org/W2044902158","https://openalex.org/W4238307458","https://openalex.org/W2082154838","https://openalex.org/W2109912052","https://openalex.org/W1711527768","https://openalex.org/W6367512","https://openalex.org/W2478592842","https://openalex.org/W2047956094"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"an":[3,55],"open-source":[4],"distributed":[5,118,151],"solver":[6,142],"for":[7,96,117],"solving":[8],"Sparse":[9,26],"Convex":[10,27],"Optimization":[11,28],"(SCO)":[12],"problems":[13,149],"over":[14],"computational":[15,134],"networks.":[16],"Motivated":[17],"by":[18],"past":[19],"algorithmic":[20],"advances":[21],"in":[22],"mixed-integer":[23,33,76],"optimization,":[24],"the":[25,50,74,80,90,105,138,155],"Toolkit":[29],"(SCOT)":[30],"adopts":[31],"a":[32,114],"approach":[34],"to":[35,39,48,167],"find":[36],"exact":[37],"solutions":[38],"SCO":[40,52,148],"problems.":[41],"In":[42],"particular,":[43],"SCOT":[44,159,166],"combines":[45,104],"various":[46],"techniques":[47,125],"transform":[49],"original":[51],"problem":[53,62,99],"into":[54],"equivalent":[56,75],"convex":[57,119],"Mixed-Integer":[58],"Nonlinear":[59],"Programming":[60],"(MINLP)":[61],"that":[63,87,136],"can":[64],"benefit":[65,139],"from":[66],"high-performance":[67],"and":[68,93,108,122],"parallel":[69],"computing":[70],"platforms.":[71],"To":[72,153],"solve":[73],"problem,":[77],"we":[78,131,160],"present":[79,132],"Distributed":[81],"Hybrid":[82],"Outer":[83],"Approximation":[84],"(DiHOA)":[85],"algorithm":[86,103,116],"builds":[88],"upon":[89],"LP/NLP-based":[91],"branch-and-bound":[92],"is":[94],"tailored":[95],"this":[97],"specific":[98],"structure.":[100],"The":[101],"DiHOA":[102],"so-called":[106],"single-":[107],"multi-tree":[109],"outer":[110],"approximation,":[111],"naturally":[112],"integrates":[113],"decentralized":[115],"nonlinear":[120],"subproblems,":[121],"employs":[123],"enhancement":[124],"such":[126],"as":[127],"quadratic":[128],"cuts.":[129],"Finally,":[130],"detailed":[133],"experiments":[135],"show":[137,154],"of":[140,158],"our":[141],"through":[143],"numerical":[144],"benchmarks":[145],"on":[146],"140":[147],"with":[150],"datasets.":[152],"overall":[156],"efficiency":[157],"also":[161],"provide":[162],"solution":[163],"profiles":[164],"comparing":[165],"other":[168],"state-of-the-art":[169],"MINLP":[170],"solvers.":[171]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}