{"id":"https://openalex.org/W4226400551","doi":"https://doi.org/10.14736/kyb-2022-1-0123","title":"Distributed aggregative optimization with quantized communication","display_name":"Distributed aggregative optimization with quantized communication","publication_year":2022,"publication_date":"2022-04-07","ids":{"openalex":"https://openalex.org/W4226400551","doi":"https://doi.org/10.14736/kyb-2022-1-0123"},"language":"en","primary_location":{"id":"doi:10.14736/kyb-2022-1-0123","is_oa":true,"landing_page_url":"https://doi.org/10.14736/kyb-2022-1-0123","pdf_url":"https://www.kybernetika.cz/content/2022/1/123/paper.pdf","source":{"id":"https://openalex.org/S158577884","display_name":"Kybernetika","issn_l":"0023-5954","issn":["0023-5954","1805-949X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310314340","host_organization_name":"Institute of Information Theory and Automation of the Czech Academy of Sciences","host_organization_lineage":["https://openalex.org/P4310314340","https://openalex.org/P4310314171"],"host_organization_lineage_names":["Institute of Information Theory and Automation of the Czech Academy of Sciences","Czech Academy of Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Kybernetika","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.kybernetika.cz/content/2022/1/123/paper.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058299116","display_name":"Ziqin Chen","orcid":"https://orcid.org/0000-0001-7836-6238"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ziqin Chen","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5101577623","display_name":"Liang Shu","orcid":"https://orcid.org/0000-0003-0948-4681"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shu Liang","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5058299116"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3608,"has_fulltext":true,"cited_by_count":17,"citation_normalized_percentile":{"value":0.89972416,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"123","last_page":"144"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.8924999833106995,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.8924999833106995,"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.5730273127555847},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3621427118778229},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26646390557289124}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5730273127555847},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3621427118778229},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26646390557289124}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.14736/kyb-2022-1-0123","is_oa":true,"landing_page_url":"https://doi.org/10.14736/kyb-2022-1-0123","pdf_url":"https://www.kybernetika.cz/content/2022/1/123/paper.pdf","source":{"id":"https://openalex.org/S158577884","display_name":"Kybernetika","issn_l":"0023-5954","issn":["0023-5954","1805-949X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310314340","host_organization_name":"Institute of Information Theory and Automation of the Czech Academy of Sciences","host_organization_lineage":["https://openalex.org/P4310314340","https://openalex.org/P4310314171"],"host_organization_lineage_names":["Institute of Information Theory and Automation of the Czech Academy of Sciences","Czech Academy of Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Kybernetika","raw_type":"journal-article"},{"id":"pmh:oai:oai.dml.cz:10338.dmlcz/149605","is_oa":true,"landing_page_url":"http://hdl.handle.net/10338.dmlcz/149605","pdf_url":"http://dml.cz/bitstream/handle/10338.dmlcz/149605/Kybernetika_58-2022-1_7.pdf","source":{"id":"https://openalex.org/S4406922294","display_name":"Czech digital mathematics library","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":null,"raw_type":"text:not_categorized"}],"best_oa_location":{"id":"doi:10.14736/kyb-2022-1-0123","is_oa":true,"landing_page_url":"https://doi.org/10.14736/kyb-2022-1-0123","pdf_url":"https://www.kybernetika.cz/content/2022/1/123/paper.pdf","source":{"id":"https://openalex.org/S158577884","display_name":"Kybernetika","issn_l":"0023-5954","issn":["0023-5954","1805-949X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310314340","host_organization_name":"Institute of Information Theory and Automation of the Czech Academy of Sciences","host_organization_lineage":["https://openalex.org/P4310314340","https://openalex.org/P4310314171"],"host_organization_lineage_names":["Institute of Information Theory and Automation of the Czech Academy of Sciences","Czech Academy of Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Kybernetika","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4226400551.pdf","grobid_xml":"https://content.openalex.org/works/W4226400551.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W1571416372","https://openalex.org/W1630241696","https://openalex.org/W1744305631","https://openalex.org/W1774067352","https://openalex.org/W1837707729","https://openalex.org/W2001027366","https://openalex.org/W2029080014","https://openalex.org/W2043791244","https://openalex.org/W2044212084","https://openalex.org/W2057873962","https://openalex.org/W2091863325","https://openalex.org/W2273484141","https://openalex.org/W2600005459","https://openalex.org/W2765412452","https://openalex.org/W2792176849","https://openalex.org/W2901460157","https://openalex.org/W2904079137","https://openalex.org/W2917189468","https://openalex.org/W2936553313","https://openalex.org/W2963855576","https://openalex.org/W2964191394","https://openalex.org/W2972071842","https://openalex.org/W3018129505","https://openalex.org/W3020195588","https://openalex.org/W3022064003","https://openalex.org/W3045131050","https://openalex.org/W3180881483","https://openalex.org/W3212704097","https://openalex.org/W3216230092","https://openalex.org/W4245409830"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W2350741829","https://openalex.org/W2530322880","https://openalex.org/W1596801655"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,96],"focus":[4],"on":[5,30,135],"an":[6,136],"aggregative":[7,15,52],"optimization":[8,16,53,94],"problem":[9,54,139],"under":[10],"the":[11,20,38,51,72,78,83,88,93,107,125,145,148],"communication":[12,61,89],"bottleneck.":[13],"The":[14,46],"is":[17,48,140],"to":[18,49,76,86,105,143],"minimize":[19],"sum":[21,39],"of":[22,40,42,65,147],"local":[23,33,59],"cost":[24,27,90],"functions.":[25],"Each":[26],"function":[28],"depends":[29],"not":[31],"only":[32],"state":[34,44,80],"variables":[35,81,109],"but":[36],"also":[37],"functions":[41],"global":[43,79],"variables.":[45],"goal":[47],"solve":[50],"through":[55],"distributed":[56,100],"computation":[57],"and":[58,82],"efficient":[60],"over":[62],"a":[63,68,98],"network":[64],"agents":[66],"without":[67],"central":[69],"coordinator.":[70],"Using":[71],"variable":[73],"tracking":[74],"method":[75],"seek":[77],"quantization":[84,115],"scheme":[85],"reduce":[87],"spent":[91],"in":[92],"process,":[95],"develop":[97],"novel":[99],"quantized":[101],"algorithm,":[102],"called":[103],"D-QAGT,":[104],"track":[106],"optimal":[108,127,137],"with":[110,129],"finite":[111],"bits":[112],"communication.":[113],"Although":[114],"may":[116],"lose":[117],"transmitting":[118],"information,":[119],"our":[120],"algorithm":[121],"can":[122],"still":[123],"achieve":[124],"exact":[126],"solution":[128],"linear":[130],"convergence":[131],"rate.":[132],"Simulation":[133],"experiments":[134],"placement":[138],"carried":[141],"out":[142],"verify":[144],"correctness":[146],"theoretical":[149],"results.":[150]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}