{"id":"https://openalex.org/W2963330758","doi":"https://doi.org/10.1109/tac.2017.2747405","title":"Solving the Dual Problems of Dynamic Programs via Regression","display_name":"Solving the Dual Problems of Dynamic Programs via Regression","publication_year":2017,"publication_date":"2017-08-30","ids":{"openalex":"https://openalex.org/W2963330758","doi":"https://doi.org/10.1109/tac.2017.2747405","mag":"2963330758"},"language":"en","primary_location":{"id":"doi:10.1109/tac.2017.2747405","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2017.2747405","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","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/A5071590581","display_name":"Helin Zhu","orcid":"https://orcid.org/0000-0003-4106-6367"},"institutions":[{"id":"https://openalex.org/I2946016260","display_name":"Uber AI (United States)","ror":"https://ror.org/05vm0ed18","country_code":"US","type":"company","lineage":["https://openalex.org/I2946016260"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Helin Zhu","raw_affiliation_strings":["Uber, San Francisco, CA, USA"],"raw_orcid":"https://orcid.org/0000-0003-4106-6367","affiliations":[{"raw_affiliation_string":"Uber, San Francisco, CA, USA","institution_ids":["https://openalex.org/I2946016260"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100405475","display_name":"Fan Ye","orcid":"https://orcid.org/0000-0001-7620-0875"},"institutions":[{"id":"https://openalex.org/I2802755631","display_name":"Morgan Stanley (United States)","ror":"https://ror.org/00aphdz18","country_code":"US","type":"company","lineage":["https://openalex.org/I2802755631"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Fan Ye","raw_affiliation_strings":["Morgan Stanley, New York, NY, USA"],"raw_orcid":"https://orcid.org/0000-0001-7620-0875","affiliations":[{"raw_affiliation_string":"Morgan Stanley, New York, NY, USA","institution_ids":["https://openalex.org/I2802755631"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083807807","display_name":"Enlu Zhou","orcid":"https://orcid.org/0000-0001-5399-6508"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Enlu Zhou","raw_affiliation_strings":["School of Industrial & Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA"],"raw_orcid":"https://orcid.org/0000-0001-5399-6508","affiliations":[{"raw_affiliation_string":"School of Industrial & Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3774,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.73738244,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"63","issue":"5","first_page":"1340","last_page":"1355"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10328","display_name":"Supply Chain and Inventory Management","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10328","display_name":"Supply Chain and Inventory Management","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12137","display_name":"Economic theories and models","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9950000047683716,"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/dual","display_name":"Dual (grammatical number)","score":0.8072737455368042},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7196909785270691},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.6768572926521301},{"id":"https://openalex.org/keywords/strong-duality","display_name":"Strong duality","score":0.5738078355789185},{"id":"https://openalex.org/keywords/bellman-equation","display_name":"Bellman equation","score":0.5696597695350647},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5359371900558472},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5337454080581665},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.5336151123046875},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.48167097568511963},{"id":"https://openalex.org/keywords/dual-function","display_name":"Dual function","score":0.448533833026886},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4324984848499298},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.43010270595550537},{"id":"https://openalex.org/keywords/duality-gap","display_name":"Duality gap","score":0.41941037774086},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4100750684738159},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36869579553604126},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26373180747032166},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.2308894693851471}],"concepts":[{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.8072737455368042},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7196909785270691},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.6768572926521301},{"id":"https://openalex.org/C163863214","wikidata":"https://www.wikidata.org/wiki/Q7624553","display_name":"Strong duality","level":3,"score":0.5738078355789185},{"id":"https://openalex.org/C14646407","wikidata":"https://www.wikidata.org/wiki/Q1430750","display_name":"Bellman equation","level":2,"score":0.5696597695350647},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5359371900558472},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5337454080581665},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.5336151123046875},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.48167097568511963},{"id":"https://openalex.org/C3019659684","wikidata":"https://www.wikidata.org/wiki/Q2275559","display_name":"Dual function","level":3,"score":0.448533833026886},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4324984848499298},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.43010270595550537},{"id":"https://openalex.org/C5274546","wikidata":"https://www.wikidata.org/wiki/Q5310264","display_name":"Duality gap","level":3,"score":0.41941037774086},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4100750684738159},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36869579553604126},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26373180747032166},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2308894693851471},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C2779104521","wikidata":"https://www.wikidata.org/wiki/Q23058469","display_name":"Contouring","level":2,"score":0.0},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tac.2017.2747405","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2017.2747405","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.7099999785423279,"display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G7170988589","display_name":null,"funder_award_id":"YIP FA-9550-14-1-0059","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"}],"funders":[{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1601081659","https://openalex.org/W1838526237","https://openalex.org/W2017001821","https://openalex.org/W2035357342","https://openalex.org/W2040838698","https://openalex.org/W2048166500","https://openalex.org/W2085130871","https://openalex.org/W2098432798","https://openalex.org/W2100857832","https://openalex.org/W2137824542","https://openalex.org/W2143026125","https://openalex.org/W2144787803","https://openalex.org/W2151786492","https://openalex.org/W2154463167","https://openalex.org/W2156040550","https://openalex.org/W2339568487","https://openalex.org/W2542637644","https://openalex.org/W3122113998","https://openalex.org/W3123718809","https://openalex.org/W3124696154","https://openalex.org/W3125890251","https://openalex.org/W4253577938","https://openalex.org/W6729528033"],"related_works":["https://openalex.org/W2155425983","https://openalex.org/W2089042254","https://openalex.org/W4220928172","https://openalex.org/W2725387418","https://openalex.org/W2201555914","https://openalex.org/W2025430946","https://openalex.org/W2614523486","https://openalex.org/W4390810132","https://openalex.org/W3213165575","https://openalex.org/W1985743726"],"abstract_inverted_index":{"In":[0,99],"recent":[1],"years,":[2],"information":[3],"relaxation":[4],"and":[5,14,83,144,164],"duality":[6],"in":[7,24,57,117,190],"dynamic":[8,26,183,197],"programs":[9,27],"have":[10],"been":[11],"studied":[12],"extensively,":[13],"the":[15,33,39,45,68,92,96,113,123,126,151,158,165,178,192],"resulted":[16,136,166],"primal-dual":[17],"approach":[18,110],"has":[19,86],"become":[20],"a":[21,105,108,118,181],"powerful":[22],"procedure":[23],"solving":[25,191],"by":[28,121],"providing":[29],"lower-upper":[30],"bounds":[31,62,149],"on":[32,150],"optimal":[34,42,46,69,114,152],"value":[35,47,153],"function.":[36,154],"Theoretically,":[37],"with":[38],"so-called":[40],"value-based":[41],"dual":[43,61,70,97,115,133,142,148,167,173,193],"penalty,":[44,71],"function":[48,127],"could":[49,73],"be":[50,74,88,140],"recovered":[51],"exactly":[52],"via":[53],"strong":[54],"duality.":[55],"However,":[56],"practice,":[58],"obtaining":[59],"tight":[60],"usually":[63],"requires":[64],"good":[65],"approximations":[66,137],"of":[67,107,125,130,195],"which":[72],"time":[75],"consuming":[76],"if":[77],"analytical":[78],"computation":[79],"is":[80,161],"not":[81],"possible":[82],"nested":[84],"simulation":[85],"to":[87,90,111,139,170,180,186],"used":[89],"estimate":[91],"conditional":[93],"expectations":[94],"inside":[95],"penalty.":[98],"this":[100],"paper,":[101],"we":[102,176],"will":[103],"develop":[104],"framework":[106,160,179],"regression":[109],"approximating":[112],"penalty":[116],"nonnested":[119],"manner,":[120],"exploring":[122],"structure":[124],"space":[128],"consisting":[129],"all":[131],"feasible":[132,141],"penalties.":[134],"The":[135],"maintain":[138],"penalties,":[143],"thus":[145],"yielding":[146],"valid":[147],"We":[155],"show":[156],"that":[157],"proposed":[159],"computationally":[162],"efficient,":[163],"penalties":[168],"lead":[169],"numerically":[171],"tractable":[172],"problems.":[174],"Finally,":[175],"apply":[177],"high-dimensional":[182],"trading":[184],"problem":[185],"demonstrate":[187],"its":[188],"effectiveness":[189],"problems":[194],"complex":[196],"programs.":[198]},"counts_by_year":[{"year":2024,"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"}