{"id":"https://openalex.org/W2027422493","doi":"https://doi.org/10.1080/01969720290040876","title":"IMPROVED CONVERGENCE THROUGH DYNAMIC PROGRAMMING APPROACH","display_name":"IMPROVED CONVERGENCE THROUGH DYNAMIC PROGRAMMING APPROACH","publication_year":2002,"publication_date":"2002-12-01","ids":{"openalex":"https://openalex.org/W2027422493","doi":"https://doi.org/10.1080/01969720290040876","mag":"2027422493"},"language":"en","primary_location":{"id":"doi:10.1080/01969720290040876","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01969720290040876","pdf_url":null,"source":{"id":"https://openalex.org/S117436046","display_name":"Cybernetics & Systems","issn_l":"0196-9722","issn":["0196-9722","1087-6553"],"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":"Cybernetics and Systems","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/A5019083173","display_name":"Angelica Calu","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Angelica Calu","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5019083173"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11297879,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"33","issue":"8","first_page":"863","last_page":"876"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10320","display_name":"Neural Networks and Applications","score":0.9994000196456909,"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.9994000196456909,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9865000247955322,"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/T10820","display_name":"Fuzzy Logic and Control Systems","score":0.9679999947547913,"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/computer-science","display_name":"Computer science","score":0.7974452972412109},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6455409526824951},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.5913554430007935},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5850159525871277},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5840457677841187},{"id":"https://openalex.org/keywords/perceptron","display_name":"Perceptron","score":0.5534809827804565},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4755929708480835},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.45611119270324707},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.42021340131759644},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3285260796546936},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32833927869796753},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1332988440990448}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7974452972412109},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6455409526824951},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.5913554430007935},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5850159525871277},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5840457677841187},{"id":"https://openalex.org/C60908668","wikidata":"https://www.wikidata.org/wiki/Q690207","display_name":"Perceptron","level":3,"score":0.5534809827804565},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4755929708480835},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.45611119270324707},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.42021340131759644},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3285260796546936},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32833927869796753},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1332988440990448},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/01969720290040876","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01969720290040876","pdf_url":null,"source":{"id":"https://openalex.org/S117436046","display_name":"Cybernetics & Systems","issn_l":"0196-9722","issn":["0196-9722","1087-6553"],"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":"Cybernetics and Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W92805021","https://openalex.org/W1966517492","https://openalex.org/W1968524744","https://openalex.org/W2009533501","https://openalex.org/W2051812123","https://openalex.org/W2087836750","https://openalex.org/W2100677568","https://openalex.org/W2104030629","https://openalex.org/W2109788599","https://openalex.org/W2160208155","https://openalex.org/W2167501416","https://openalex.org/W2432517183","https://openalex.org/W3207342693","https://openalex.org/W4214717370","https://openalex.org/W4300402905"],"related_works":["https://openalex.org/W2082756648","https://openalex.org/W3194278305","https://openalex.org/W2289648981","https://openalex.org/W1565459987","https://openalex.org/W45198419","https://openalex.org/W2001427828","https://openalex.org/W4293870204","https://openalex.org/W3037182899","https://openalex.org/W1532749398","https://openalex.org/W1970158899"],"abstract_inverted_index":{"New":[0],"hybrid":[1,74],"methods":[2,75,80],"for":[3,56],"solving":[4],"the":[5,14,25,32,44,47,52,57,72,77,86],"multiplayer":[6],"perceptron":[7],"optimization":[8,28,79],"problem":[9],"are":[10],"proposed":[11],"which":[12],"use":[13],"computation":[15],"capabilities":[16],"of":[17,34,40,46],"Bellman's":[18],"dynamic":[19],"programming":[20],"(DP)":[21],"method.":[22],"To":[23],"solve":[24],"neural":[26],"network":[27],"problem,":[29],"we":[30,50,60],"consider":[31],"case":[33],"output":[35,48],"neurons":[36,45,59],"differently":[37],"from":[38],"that":[39,71],"hidden":[41,58],"neurons.":[42],"For":[43],"layer":[49],"apply":[51,61],"conventional":[53],"DP":[54],"and":[55,84],"a":[62],"method":[63],"based":[64],"on":[65],"gradient":[66],"approach.":[67],"Computer":[68],"simulation":[69],"shows":[70],"new":[73],"outperform":[76],"gradient-based":[78],"in":[81],"converging":[82],"speed":[83],"avoiding":[85],"local":[87],"minimum.":[88]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}