{"id":"https://openalex.org/W2012929693","doi":"https://doi.org/10.1080/00207169908804802","title":"Iteration grain sized asynchronous parallel algorithms in optimization","display_name":"Iteration grain sized asynchronous parallel algorithms in optimization","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2012929693","doi":"https://doi.org/10.1080/00207169908804802","mag":"2012929693"},"language":"en","primary_location":{"id":"doi:10.1080/00207169908804802","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169908804802","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"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":"International Journal of Computer Mathematics","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/A5071287376","display_name":"Istv\u00e1n De\u00e1k","orcid":null},"institutions":[{"id":"https://openalex.org/I4210161853","display_name":"Budapest Institute","ror":"https://ror.org/050hvq478","country_code":"HU","type":"facility","lineage":["https://openalex.org/I4210161853"]},{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"Istv\u00e1n De\u00e1k","raw_affiliation_strings":["Operations Research Group, Dept. of Differential Equations , Technical University of Budapest , Budapest, H-1111 E-mail: deak@math.bme.hu"],"affiliations":[{"raw_affiliation_string":"Operations Research Group, Dept. of Differential Equations , Technical University of Budapest , Budapest, H-1111 E-mail: deak@math.bme.hu","institution_ids":["https://openalex.org/I4210161853","https://openalex.org/I106118109"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5071287376"],"corresponding_institution_ids":["https://openalex.org/I106118109","https://openalex.org/I4210161853"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1697731,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"71","issue":"2","first_page":"183","last_page":"196"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998999834060669,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9962999820709229,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6935270428657532},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.6583954095840454},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6319938898086548},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4885154962539673},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4633524715900421},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4249637722969055}],"concepts":[{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6935270428657532},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.6583954095840454},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6319938898086548},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4885154962539673},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4633524715900421},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4249637722969055},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207169908804802","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169908804802","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"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":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321038","display_name":"Fonds National de la Recherche Luxembourg","ror":"https://ror.org/039z13y21"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1536391780","https://openalex.org/W1603765807","https://openalex.org/W1752175949","https://openalex.org/W1964442600","https://openalex.org/W1969750929","https://openalex.org/W1982079894","https://openalex.org/W2006569536","https://openalex.org/W2027037608","https://openalex.org/W2031756167","https://openalex.org/W2033534863","https://openalex.org/W2038614136","https://openalex.org/W2055717497","https://openalex.org/W2078566378","https://openalex.org/W2135700564","https://openalex.org/W2157972117","https://openalex.org/W2266946488","https://openalex.org/W2787523326","https://openalex.org/W2802627035","https://openalex.org/W4300592003"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2116677773","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2600246793","https://openalex.org/W4238204885"],"abstract_inverted_index":{"A":[0],"general":[1],"framework":[2],"for":[3],"large-grained":[4],"parallelization":[5],"of":[6,15,26,44,48],"optimization":[7],"methods":[8],"is":[9,23],"presented,":[10],"together":[11],"with":[12],"a":[13],"proof":[14],"convergence,":[16],"For":[17],"comparison":[18],"Bertsekas'":[19],"and":[20,52,55],"Tsitsiklis":[21],"method":[22,37,51],"recalled:":[24],"both":[25],"these":[27],"algorithms":[28],"have":[29],"iteration":[30],"grain":[31],"size,":[32],"but":[33],"the":[34,41,45,49],"presented":[35],"new":[36,50],"does":[38],"not":[39],"require":[40],"independent":[42],"evaluation":[43],"components.":[46],"Variants":[47],"respective":[53],"merits":[54],"disadvantages":[56],"are":[57],"discussed":[58]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}