{"id":"https://openalex.org/W2460537821","doi":"https://doi.org/10.1007/978-3-319-38884-7_4","title":"Solving an Infinite-Horizon Discounted Markov Decision Process by DC Programming and DCA","display_name":"Solving an Infinite-Horizon Discounted Markov Decision Process by DC Programming and DCA","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2460537821","doi":"https://doi.org/10.1007/978-3-319-38884-7_4","mag":"2460537821"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-38884-7_4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-319-38884-7_4","pdf_url":null,"source":{"id":"https://openalex.org/S2764905038","display_name":"Advances in intelligent systems and computing","issn_l":"2194-5357","issn":["2194-5357","2194-5365"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"book series"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Intelligent Systems and Computing","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1007/978-3-319-38884-7_4","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013801164","display_name":"Vinh Thanh Ho","orcid":"https://orcid.org/0009-0009-1416-5360"},"institutions":[{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Vinh Thanh Ho","raw_affiliation_strings":["Laboratory of Theoretical and Applied Computer Science EA 3097, University of Lorraine, Ile du Saulcy, 57045, Metz, France"],"affiliations":[{"raw_affiliation_string":"Laboratory of Theoretical and Applied Computer Science EA 3097, University of Lorraine, Ile du Saulcy, 57045, Metz, France","institution_ids":["https://openalex.org/I90183372"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042936176","display_name":"Hoai An Le Thi","orcid":"https://orcid.org/0000-0002-2239-2100"},"institutions":[{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Hoai An Le Thi","raw_affiliation_strings":["Laboratory of Theoretical and Applied Computer Science (LITA), UFR MIM, University of Lorraine, Ile du Saulcy, Metz, France","Laboratory of Theoretical and Applied Computer Science EA 3097, University of Lorraine, Ile du Saulcy, 57045, Metz, France"],"affiliations":[{"raw_affiliation_string":"Laboratory of Theoretical and Applied Computer Science (LITA), UFR MIM, University of Lorraine, Ile du Saulcy, Metz, France","institution_ids":["https://openalex.org/I90183372"]},{"raw_affiliation_string":"Laboratory of Theoretical and Applied Computer Science EA 3097, University of Lorraine, Ile du Saulcy, 57045, Metz, France","institution_ids":["https://openalex.org/I90183372"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5013801164"],"corresponding_institution_ids":["https://openalex.org/I90183372"],"apc_list":null,"apc_paid":null,"fwci":0.6773,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.65708134,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"43","last_page":"55"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9991999864578247,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9991999864578247,"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/T12288","display_name":"Optimization and Search Problems","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10328","display_name":"Supply Chain and Inventory Management","score":0.9939000010490417,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.8395035266876221},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7626616954803467},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5504110455513},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.5288509130477905},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5252582430839539},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5166481137275696},{"id":"https://openalex.org/keywords/bellman-equation","display_name":"Bellman equation","score":0.46810173988342285},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.442261278629303},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.38651537895202637},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.370268315076828},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.2864643335342407}],"concepts":[{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.8395035266876221},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7626616954803467},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5504110455513},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.5288509130477905},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5252582430839539},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5166481137275696},{"id":"https://openalex.org/C14646407","wikidata":"https://www.wikidata.org/wiki/Q1430750","display_name":"Bellman equation","level":2,"score":0.46810173988342285},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.442261278629303},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.38651537895202637},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.370268315076828},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.2864643335342407},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-319-38884-7_4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-319-38884-7_4","pdf_url":null,"source":{"id":"https://openalex.org/S2764905038","display_name":"Advances in intelligent systems and computing","issn_l":"2194-5357","issn":["2194-5357","2194-5365"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"book series"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Intelligent Systems and Computing","raw_type":"book-chapter"},{"id":"pmh:oai:HAL:hal-03213139v1","is_oa":false,"landing_page_url":"https://hal.univ-lorraine.fr/hal-03213139","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Advanced Computational Methods for Knowledge Engineering. Advances in Intelligent Systems and Computing, 453, pp.43-55, 2016, ⟨10.1007/978-3-319-38884-7_4⟩","raw_type":"Book sections"},{"id":"pmh:oai:oskar-bordeaux.fr:20.500.12278/35881","is_oa":false,"landing_page_url":"https://oskar-bordeaux.fr/handle/20.500.12278/35881","pdf_url":null,"source":{"id":"https://openalex.org/S4306402569","display_name":"Oskar-Bordeaux (Universite de Bordeaux)","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":"Advanced Computational Methods for Knowledge Engineering. Advances in Intelligent Systems and Computing","raw_type":"Chapitre d'ouvrage"}],"best_oa_location":{"id":"doi:10.1007/978-3-319-38884-7_4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-319-38884-7_4","pdf_url":null,"source":{"id":"https://openalex.org/S2764905038","display_name":"Advances in intelligent systems and computing","issn_l":"2194-5357","issn":["2194-5357","2194-5365"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"book series"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Intelligent Systems and Computing","raw_type":"book-chapter"},"sustainable_development_goals":[{"score":0.7300000190734863,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W139596442","https://openalex.org/W187184694","https://openalex.org/W1515851193","https://openalex.org/W1545148916","https://openalex.org/W1589133845","https://openalex.org/W1974136583","https://openalex.org/W1979651953","https://openalex.org/W1979657638","https://openalex.org/W1984754588","https://openalex.org/W1987507268","https://openalex.org/W1990494141","https://openalex.org/W1994123361","https://openalex.org/W2012383525","https://openalex.org/W2012547817","https://openalex.org/W2023797067","https://openalex.org/W2051664786","https://openalex.org/W2057797006","https://openalex.org/W2061504687","https://openalex.org/W2100100236","https://openalex.org/W2100348027","https://openalex.org/W2100401322","https://openalex.org/W2107726111","https://openalex.org/W2130399617","https://openalex.org/W2162152253","https://openalex.org/W2198485769","https://openalex.org/W2340859457","https://openalex.org/W2341171179","https://openalex.org/W2500156833","https://openalex.org/W2507840378","https://openalex.org/W2737668828","https://openalex.org/W2963769561","https://openalex.org/W6634528131","https://openalex.org/W7001894244"],"related_works":["https://openalex.org/W4255265352","https://openalex.org/W4239477580","https://openalex.org/W4389475841","https://openalex.org/W2152670157","https://openalex.org/W4241327272","https://openalex.org/W2903299703","https://openalex.org/W4281791088","https://openalex.org/W4385342861","https://openalex.org/W1574958246","https://openalex.org/W2100100236"],"abstract_inverted_index":{"In":[0,36,60,83,117,143],"this":[1,84,98],"paper,":[2,85],"we":[3,41,86,100,146],"consider":[4],"a":[5,17,25,28,33,73,124,148,153],"decision":[6,11,19],"problem":[7,20],"modeled":[8],"by":[9,105],"Markov":[10,18],"processes":[12],"(written":[13],"as":[14,123],"MDPs).":[15],"Solving":[16],"amounts":[21],"to":[22,69,93],"searching":[23],"for":[24,131,157,179],"policy,":[26],"in":[27,89,190],"given":[29],"set,":[30],"which":[31,53,132],"optimizes":[32],"performance":[34],"criterion.":[35],"the":[37,43,47,51,55,61,90,94,107,110,133,158,167,175,180,184,193,196],"considered":[38],"MDP":[39],"problem,":[40],"address":[42],"discounted":[44,74,95,181],"criterion":[45],"with":[46,72,174],"aim":[48],"of":[49,58,109,113,127,160,186,192,195],"characterizing":[50],"policies":[52],"provide":[54],"best":[56],"sequence":[57],"rewards.":[59],"literature,":[62],"there":[63],"are":[64,87,141,164],"three":[65],"main":[66],"approaches":[67],"applied":[68],"solve":[70],"MDPs":[71,182],"criterion:":[75],"linear":[76,176],"programming,":[77],"value":[78],"iteration":[79],"and":[80,137,152],"policy":[81],"iteration.":[82],"interested":[88],"optimization":[91,103,150],"approach":[92,189],"MDPs.":[96,161],"Along":[97],"line,":[99],"describe":[101],"an":[102],"model":[104,151,159],"studying":[106],"minimization":[108],"different":[111],"norms":[112],"Optimal":[114],"Bellman":[115],"Residual.":[116],"general,":[118],"it":[119],"can":[120],"be":[121],"formulated":[122],"DC":[125,135,155],"(Difference":[126],"Convex":[128],"functions)":[129],"program":[130],"unified":[134],"programming":[136,177],"DCA":[138],"(DC":[139],"Algorithms)":[140],"applied.":[142],"our":[144,187],"works,":[145],"propose":[147],"new":[149],"suitable":[154],"decomposition":[156],"Numerical":[162],"experiments":[163],"performed":[165],"on":[166],"stationary":[168],"Garnet":[169],"problems.":[170],"The":[171],"comparative":[172],"results":[173],"method":[178],"illustrate":[183],"efficiency":[185],"proposed":[188],"terms":[191],"quality":[194],"obtained":[197],"solutions.":[198]},"counts_by_year":[{"year":2018,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}