{"id":"https://openalex.org/W4407951176","doi":"https://doi.org/10.1109/cdc56724.2024.10886477","title":"Addressing Discrete Dynamic Optimization via a Logic-Based Discrete-Steepest Descent Algorithm","display_name":"Addressing Discrete Dynamic Optimization via a Logic-Based Discrete-Steepest Descent Algorithm","publication_year":2024,"publication_date":"2024-12-16","ids":{"openalex":"https://openalex.org/W4407951176","doi":"https://doi.org/10.1109/cdc56724.2024.10886477"},"language":"en","primary_location":{"id":"doi:10.1109/cdc56724.2024.10886477","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc56724.2024.10886477","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE 63rd Conference on Decision and Control (CDC)","raw_type":"proceedings-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/A5035222919","display_name":"Zedong Peng","orcid":"https://orcid.org/0000-0001-6001-1738"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Zedong Peng","raw_affiliation_strings":["Purdue University,Davidson School of Chemical Engineering,West Lafayette,IN,USA,47907"],"affiliations":[{"raw_affiliation_string":"Purdue University,Davidson School of Chemical Engineering,West Lafayette,IN,USA,47907","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100701961","display_name":"Albert Lee","orcid":"https://orcid.org/0000-0001-5156-0567"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Albert Lee","raw_affiliation_strings":["Purdue University,Davidson School of Chemical Engineering,West Lafayette,IN,USA,47907"],"affiliations":[{"raw_affiliation_string":"Purdue University,Davidson School of Chemical Engineering,West Lafayette,IN,USA,47907","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113277847","display_name":"David E. Bernal Neira","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David E. Bernal Neira","raw_affiliation_strings":["Purdue University,Davidson School of Chemical Engineering,West Lafayette,IN,USA,47907"],"affiliations":[{"raw_affiliation_string":"Purdue University,Davidson School of Chemical Engineering,West Lafayette,IN,USA,47907","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5035222919"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":0.7724,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.7882687,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1664","last_page":"1669"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10320","display_name":"Neural Networks and Applications","score":0.6887000203132629,"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"}},"topics":[{"id":"https://openalex.org/T10320","display_name":"Neural Networks and Applications","score":0.6887000203132629,"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/gradient-descent","display_name":"Gradient descent","score":0.6691305041313171},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6101252436637878},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5472776293754578},{"id":"https://openalex.org/keywords/discrete-optimization","display_name":"Discrete optimization","score":0.4968717396259308},{"id":"https://openalex.org/keywords/method-of-steepest-descent","display_name":"Method of steepest descent","score":0.4609999656677246},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4353838264942169},{"id":"https://openalex.org/keywords/optimization-algorithm","display_name":"Optimization algorithm","score":0.41778963804244995},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3224659860134125},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2525467574596405},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1835973560810089},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.10375377535820007}],"concepts":[{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.6691305041313171},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6101252436637878},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5472776293754578},{"id":"https://openalex.org/C145671259","wikidata":"https://www.wikidata.org/wiki/Q1493786","display_name":"Discrete optimization","level":3,"score":0.4968717396259308},{"id":"https://openalex.org/C158847443","wikidata":"https://www.wikidata.org/wiki/Q1997812","display_name":"Method of steepest descent","level":2,"score":0.4609999656677246},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4353838264942169},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.41778963804244995},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3224659860134125},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2525467574596405},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1835973560810089},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.10375377535820007}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc56724.2024.10886477","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc56724.2024.10886477","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE 63rd Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1515641485","https://openalex.org/W1963932222","https://openalex.org/W2002373919","https://openalex.org/W2007591867","https://openalex.org/W2032804413","https://openalex.org/W2039724594","https://openalex.org/W2414767203","https://openalex.org/W2902723719","https://openalex.org/W3009831772","https://openalex.org/W3105952231","https://openalex.org/W3152386239","https://openalex.org/W3158222010","https://openalex.org/W4235623249","https://openalex.org/W4243401948","https://openalex.org/W4288908571","https://openalex.org/W4289878158","https://openalex.org/W4293118011","https://openalex.org/W4385420611"],"related_works":["https://openalex.org/W2393439324","https://openalex.org/W2081157561","https://openalex.org/W131846159","https://openalex.org/W3197592642","https://openalex.org/W2155993847","https://openalex.org/W2914176832","https://openalex.org/W2088010696","https://openalex.org/W2386196923","https://openalex.org/W2027078210","https://openalex.org/W2368086325"],"abstract_inverted_index":{"Dynamic":[0,60],"optimization":[1,13,32,82,135,195],"problems":[2,14,64,144,196],"involving":[3],"discrete":[4,21,193],"decisions":[5],"have":[6],"several":[7],"applications,":[8],"yet":[9],"lead":[10],"to":[11,57,85,111,127,156,174,190],"challenging":[12],"that":[15,70,80,148],"must":[16],"be":[17,43],"addressed":[18],"efficiently.":[19],"Combining":[20],"variables":[22,69,120],"with":[23,96,142],"potentially":[24],"nonlinear":[25,162],"constraints":[26,75,79],"stemming":[27],"from":[28,145],"dynamics":[29],"within":[30,99,201],"an":[31,186],"model":[33],"results":[34],"in":[35,133,168],"mathematical":[36],"programs":[37],"for":[38],"which":[39],"off-the-shelf":[40],"techniques":[41],"might":[42],"insufficient.":[44],"This":[45,178],"work":[46,179],"uses":[47],"a":[48,92,181],"novel":[49],"approach,":[50],"the":[51,81,89,100,102,107,114,118,129,140,146,199],"Logic-based":[52],"Discrete-Steepest":[53],"Descent":[54],"Algorithm":[55],"(LD-SDA),":[56],"solve":[58],"Discrete":[59],"Optimization":[61],"problems.":[62],"The":[63],"are":[65],"formulated":[66],"using":[67],"Boolean":[68,119],"enforce":[71],"differential":[72,125],"systems":[73],"of":[74,106,117,170],"and":[76,121,153,163,172,184],"encode":[77],"logic":[78],"problem":[83,90],"needs":[84],"satisfy.":[86],"By":[87],"posing":[88],"as":[91],"generalized":[93,164],"disjunctive":[94,165],"program":[95],"dynamic":[97,134,150,176,194],"equations":[98,126],"disjunctions,":[101],"LD-SDA":[103,141],"takes":[104],"advantage":[105],"problem\u2019s":[108],"inherent":[109,132],"structure":[110],"efficiently":[112],"explore":[113],"combinatorial":[115],"space":[116],"selectively":[122],"include":[123,149],"relevant":[124],"mitigate":[128],"computational":[130],"complexity":[131],"scenarios.":[136,177],"We":[137],"rigorously":[138],"evaluate":[139],"benchmark":[143],"literature":[147],"transitioning":[151],"modes":[152],"find":[154],"it":[155],"outperform":[157],"traditional":[158],"methods,":[159],"i.e.,":[160],"mixed-integer":[161],"programming":[166],"solvers,":[167],"terms":[169],"efficiency":[171],"capability":[173],"handle":[175],"presents":[180],"systematic":[182],"method":[183],"provides":[185],"open-source":[187],"software":[188],"implementation":[189],"address":[191],"these":[192],"by":[197],"harnessing":[198],"information":[200],"its":[202],"logical-differential":[203],"structure.":[204]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2025-12-28T23:10:05.387466","created_date":"2025-10-10T00:00:00"}