Nonlinear Perturbation-based Non-Convex Optimization over Time-Varying Networks Article Swipe
Mohammadreza Doostmohammadian
,
Z. R. Gabidullina
,
Hamid R. Rabiee
·
YOU?
·
· 2024
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2408.02269
YOU?
·
· 2024
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2408.02269
Decentralized optimization strategies are helpful for various applications, from networked estimation to distributed machine learning. This paper studies finite-sum minimization problems described over a network of nodes and proposes a computationally efficient algorithm that solves distributed convex problems and optimally finds the solution to locally non-convex objective functions. In contrast to batch gradient optimization in some literature, our algorithm is on a single-time scale with no extra inner consensus loop. It evaluates one gradient entry per node per time. Further, the algorithm addresses link-level nonlinearity representing, for example, logarithmic quantization of the exchanged data or clipping of the exchanged data bits. Leveraging perturbation-based theory and algebraic Laplacian network analysis proves optimal convergence and dynamics stability over time-varying and switching networks. The time-varying network setup might be due to packet drops or link failures. Despite the nonlinear nature of the dynamics, we prove exact convergence in the face of odd sign-preserving sector-bound nonlinear data transmission over the links. Illustrative numerical simulations further highlight our contributions.
Related Topics
Concepts
Metadata
- Type
- preprint
- Language
- en
- Landing Page
- http://arxiv.org/abs/2408.02269
- https://arxiv.org/pdf/2408.02269
- OA Status
- green
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4406490370
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4406490370Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.48550/arxiv.2408.02269Digital Object Identifier
- Title
-
Nonlinear Perturbation-based Non-Convex Optimization over Time-Varying NetworksWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2024Year of publication
- Publication date
-
2024-08-05Full publication date if available
- Authors
-
Mohammadreza Doostmohammadian, Z. R. Gabidullina, Hamid R. RabieeList of authors in order
- Landing page
-
https://arxiv.org/abs/2408.02269Publisher landing page
- PDF URL
-
https://arxiv.org/pdf/2408.02269Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://arxiv.org/pdf/2408.02269Direct OA link when available
- Concepts
-
Nonlinear system, Perturbation (astronomy), Regular polygon, Convex optimization, Mathematical optimization, Computer science, Control theory (sociology), Mathematics, Physics, Geometry, Artificial intelligence, Quantum mechanics, Control (management)Top concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4406490370 |
|---|---|
| doi | https://doi.org/10.48550/arxiv.2408.02269 |
| ids.doi | https://doi.org/10.48550/arxiv.2408.02269 |
| ids.openalex | https://openalex.org/W4406490370 |
| fwci | |
| type | preprint |
| title | Nonlinear Perturbation-based Non-Convex Optimization over Time-Varying Networks |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T10249 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9843000173568726 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1705 |
| topics[0].subfield.display_name | Computer Networks and Communications |
| topics[0].display_name | Distributed Control Multi-Agent Systems |
| topics[1].id | https://openalex.org/T10080 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9829999804496765 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1705 |
| topics[1].subfield.display_name | Computer Networks and Communications |
| topics[1].display_name | Energy Efficient Wireless Sensor Networks |
| topics[2].id | https://openalex.org/T11347 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9783999919891357 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1705 |
| topics[2].subfield.display_name | Computer Networks and Communications |
| topics[2].display_name | Neural Networks Stability and Synchronization |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C158622935 |
| concepts[0].level | 2 |
| concepts[0].score | 0.6629083156585693 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q660848 |
| concepts[0].display_name | Nonlinear system |
| concepts[1].id | https://openalex.org/C177918212 |
| concepts[1].level | 2 |
| concepts[1].score | 0.6271597146987915 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q803623 |
| concepts[1].display_name | Perturbation (astronomy) |
| concepts[2].id | https://openalex.org/C112680207 |
| concepts[2].level | 2 |
| concepts[2].score | 0.5491403341293335 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q714886 |
| concepts[2].display_name | Regular polygon |
| concepts[3].id | https://openalex.org/C157972887 |
| concepts[3].level | 3 |
| concepts[3].score | 0.5313620567321777 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q463359 |
| concepts[3].display_name | Convex optimization |
| concepts[4].id | https://openalex.org/C126255220 |
| concepts[4].level | 1 |
| concepts[4].score | 0.4514337182044983 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[4].display_name | Mathematical optimization |
| concepts[5].id | https://openalex.org/C41008148 |
| concepts[5].level | 0 |
| concepts[5].score | 0.4401014745235443 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[5].display_name | Computer science |
| concepts[6].id | https://openalex.org/C47446073 |
| concepts[6].level | 3 |
| concepts[6].score | 0.3926406502723694 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q5165890 |
| concepts[6].display_name | Control theory (sociology) |
| concepts[7].id | https://openalex.org/C33923547 |
| concepts[7].level | 0 |
| concepts[7].score | 0.3466629385948181 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[7].display_name | Mathematics |
| concepts[8].id | https://openalex.org/C121332964 |
| concepts[8].level | 0 |
| concepts[8].score | 0.2776033878326416 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q413 |
| concepts[8].display_name | Physics |
| concepts[9].id | https://openalex.org/C2524010 |
| concepts[9].level | 1 |
| concepts[9].score | 0.09293708205223083 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q8087 |
| concepts[9].display_name | Geometry |
| concepts[10].id | https://openalex.org/C154945302 |
| concepts[10].level | 1 |
| concepts[10].score | 0.06711679697036743 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q11660 |
| concepts[10].display_name | Artificial intelligence |
| concepts[11].id | https://openalex.org/C62520636 |
| concepts[11].level | 1 |
| concepts[11].score | 0.0 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q944 |
| concepts[11].display_name | Quantum mechanics |
| concepts[12].id | https://openalex.org/C2775924081 |
| concepts[12].level | 2 |
| concepts[12].score | 0.0 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q55608371 |
| concepts[12].display_name | Control (management) |
| keywords[0].id | https://openalex.org/keywords/nonlinear-system |
| keywords[0].score | 0.6629083156585693 |
| keywords[0].display_name | Nonlinear system |
| keywords[1].id | https://openalex.org/keywords/perturbation |
| keywords[1].score | 0.6271597146987915 |
| keywords[1].display_name | Perturbation (astronomy) |
| keywords[2].id | https://openalex.org/keywords/regular-polygon |
| keywords[2].score | 0.5491403341293335 |
| keywords[2].display_name | Regular polygon |
| keywords[3].id | https://openalex.org/keywords/convex-optimization |
| keywords[3].score | 0.5313620567321777 |
| keywords[3].display_name | Convex optimization |
| keywords[4].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[4].score | 0.4514337182044983 |
| keywords[4].display_name | Mathematical optimization |
| keywords[5].id | https://openalex.org/keywords/computer-science |
| keywords[5].score | 0.4401014745235443 |
| keywords[5].display_name | Computer science |
| keywords[6].id | https://openalex.org/keywords/control-theory |
| keywords[6].score | 0.3926406502723694 |
| keywords[6].display_name | Control theory (sociology) |
| keywords[7].id | https://openalex.org/keywords/mathematics |
| keywords[7].score | 0.3466629385948181 |
| keywords[7].display_name | Mathematics |
| keywords[8].id | https://openalex.org/keywords/physics |
| keywords[8].score | 0.2776033878326416 |
| keywords[8].display_name | Physics |
| keywords[9].id | https://openalex.org/keywords/geometry |
| keywords[9].score | 0.09293708205223083 |
| keywords[9].display_name | Geometry |
| keywords[10].id | https://openalex.org/keywords/artificial-intelligence |
| keywords[10].score | 0.06711679697036743 |
| keywords[10].display_name | Artificial intelligence |
| language | en |
| locations[0].id | pmh:oai:arXiv.org:2408.02269 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306400194 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | arXiv (Cornell University) |
| locations[0].source.host_organization | https://openalex.org/I205783295 |
| locations[0].source.host_organization_name | Cornell University |
| locations[0].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[0].license | cc-by |
| locations[0].pdf_url | https://arxiv.org/pdf/2408.02269 |
| locations[0].version | submittedVersion |
| locations[0].raw_type | text |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | False |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | http://arxiv.org/abs/2408.02269 |
| locations[1].id | doi:10.48550/arxiv.2408.02269 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306400194 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | True |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | arXiv (Cornell University) |
| locations[1].source.host_organization | https://openalex.org/I205783295 |
| locations[1].source.host_organization_name | Cornell University |
| locations[1].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[1].license | cc-by |
| locations[1].pdf_url | |
| locations[1].version | |
| locations[1].raw_type | article |
| locations[1].license_id | https://openalex.org/licenses/cc-by |
| locations[1].is_accepted | False |
| locations[1].is_published | |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | https://doi.org/10.48550/arxiv.2408.02269 |
| indexed_in | arxiv, datacite |
| authorships[0].author.id | https://openalex.org/A5085550621 |
| authorships[0].author.orcid | https://orcid.org/0000-0003-0959-6608 |
| authorships[0].author.display_name | Mohammadreza Doostmohammadian |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Doostmohammadian, Mohammadreza |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5049973137 |
| authorships[1].author.orcid | https://orcid.org/0000-0003-3573-3979 |
| authorships[1].author.display_name | Z. R. Gabidullina |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Gabidullina, Zulfiya R. |
| authorships[1].is_corresponding | False |
| authorships[2].author.id | https://openalex.org/A5063512925 |
| authorships[2].author.orcid | https://orcid.org/0000-0002-9835-4493 |
| authorships[2].author.display_name | Hamid R. Rabiee |
| authorships[2].author_position | last |
| authorships[2].raw_author_name | Rabiee, Hamid R. |
| authorships[2].is_corresponding | False |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://arxiv.org/pdf/2408.02269 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Nonlinear Perturbation-based Non-Convex Optimization over Time-Varying Networks |
| has_fulltext | True |
| is_retracted | False |
| updated_date | 2025-11-06T06:51:31.235846 |
| primary_topic.id | https://openalex.org/T10249 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9843000173568726 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1705 |
| primary_topic.subfield.display_name | Computer Networks and Communications |
| primary_topic.display_name | Distributed Control Multi-Agent Systems |
| related_works | https://openalex.org/W2154204858, https://openalex.org/W3209622820, https://openalex.org/W2382250648, https://openalex.org/W2367363545, https://openalex.org/W2586383879, https://openalex.org/W2067895158, https://openalex.org/W4379507409, https://openalex.org/W2066331732, https://openalex.org/W2561874146, https://openalex.org/W2119556180 |
| cited_by_count | 0 |
| locations_count | 2 |
| best_oa_location.id | pmh:oai:arXiv.org:2408.02269 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | https://arxiv.org/pdf/2408.02269 |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | text |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | http://arxiv.org/abs/2408.02269 |
| primary_location.id | pmh:oai:arXiv.org:2408.02269 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306400194 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | arXiv (Cornell University) |
| primary_location.source.host_organization | https://openalex.org/I205783295 |
| primary_location.source.host_organization_name | Cornell University |
| primary_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| primary_location.license | cc-by |
| primary_location.pdf_url | https://arxiv.org/pdf/2408.02269 |
| primary_location.version | submittedVersion |
| primary_location.raw_type | text |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | http://arxiv.org/abs/2408.02269 |
| publication_date | 2024-08-05 |
| publication_year | 2024 |
| referenced_works_count | 0 |
| abstract_inverted_index.a | 23, 29, 61 |
| abstract_inverted_index.In | 48 |
| abstract_inverted_index.It | 70 |
| abstract_inverted_index.be | 125 |
| abstract_inverted_index.in | 54, 144 |
| abstract_inverted_index.is | 59 |
| abstract_inverted_index.no | 65 |
| abstract_inverted_index.of | 25, 90, 96, 137, 147 |
| abstract_inverted_index.on | 60 |
| abstract_inverted_index.or | 94, 130 |
| abstract_inverted_index.to | 11, 43, 50, 127 |
| abstract_inverted_index.we | 140 |
| abstract_inverted_index.The | 120 |
| abstract_inverted_index.and | 27, 38, 104, 112, 117 |
| abstract_inverted_index.are | 3 |
| abstract_inverted_index.due | 126 |
| abstract_inverted_index.for | 5, 86 |
| abstract_inverted_index.odd | 148 |
| abstract_inverted_index.one | 72 |
| abstract_inverted_index.our | 57, 162 |
| abstract_inverted_index.per | 75, 77 |
| abstract_inverted_index.the | 41, 80, 91, 97, 134, 138, 145, 155 |
| abstract_inverted_index.This | 15 |
| abstract_inverted_index.data | 93, 99, 152 |
| abstract_inverted_index.face | 146 |
| abstract_inverted_index.from | 8 |
| abstract_inverted_index.link | 131 |
| abstract_inverted_index.node | 76 |
| abstract_inverted_index.over | 22, 115, 154 |
| abstract_inverted_index.some | 55 |
| abstract_inverted_index.that | 33 |
| abstract_inverted_index.with | 64 |
| abstract_inverted_index.batch | 51 |
| abstract_inverted_index.bits. | 100 |
| abstract_inverted_index.drops | 129 |
| abstract_inverted_index.entry | 74 |
| abstract_inverted_index.exact | 142 |
| abstract_inverted_index.extra | 66 |
| abstract_inverted_index.finds | 40 |
| abstract_inverted_index.inner | 67 |
| abstract_inverted_index.loop. | 69 |
| abstract_inverted_index.might | 124 |
| abstract_inverted_index.nodes | 26 |
| abstract_inverted_index.paper | 16 |
| abstract_inverted_index.prove | 141 |
| abstract_inverted_index.scale | 63 |
| abstract_inverted_index.setup | 123 |
| abstract_inverted_index.time. | 78 |
| abstract_inverted_index.convex | 36 |
| abstract_inverted_index.links. | 156 |
| abstract_inverted_index.nature | 136 |
| abstract_inverted_index.packet | 128 |
| abstract_inverted_index.proves | 109 |
| abstract_inverted_index.solves | 34 |
| abstract_inverted_index.theory | 103 |
| abstract_inverted_index.Despite | 133 |
| abstract_inverted_index.further | 160 |
| abstract_inverted_index.helpful | 4 |
| abstract_inverted_index.locally | 44 |
| abstract_inverted_index.machine | 13 |
| abstract_inverted_index.network | 24, 107, 122 |
| abstract_inverted_index.optimal | 110 |
| abstract_inverted_index.studies | 17 |
| abstract_inverted_index.various | 6 |
| abstract_inverted_index.Further, | 79 |
| abstract_inverted_index.analysis | 108 |
| abstract_inverted_index.clipping | 95 |
| abstract_inverted_index.contrast | 49 |
| abstract_inverted_index.dynamics | 113 |
| abstract_inverted_index.example, | 87 |
| abstract_inverted_index.gradient | 52, 73 |
| abstract_inverted_index.problems | 20, 37 |
| abstract_inverted_index.proposes | 28 |
| abstract_inverted_index.solution | 42 |
| abstract_inverted_index.Laplacian | 106 |
| abstract_inverted_index.addresses | 82 |
| abstract_inverted_index.algebraic | 105 |
| abstract_inverted_index.algorithm | 32, 58, 81 |
| abstract_inverted_index.consensus | 68 |
| abstract_inverted_index.described | 21 |
| abstract_inverted_index.dynamics, | 139 |
| abstract_inverted_index.efficient | 31 |
| abstract_inverted_index.evaluates | 71 |
| abstract_inverted_index.exchanged | 92, 98 |
| abstract_inverted_index.failures. | 132 |
| abstract_inverted_index.highlight | 161 |
| abstract_inverted_index.learning. | 14 |
| abstract_inverted_index.networked | 9 |
| abstract_inverted_index.networks. | 119 |
| abstract_inverted_index.nonlinear | 135, 151 |
| abstract_inverted_index.numerical | 158 |
| abstract_inverted_index.objective | 46 |
| abstract_inverted_index.optimally | 39 |
| abstract_inverted_index.stability | 114 |
| abstract_inverted_index.switching | 118 |
| abstract_inverted_index.Leveraging | 101 |
| abstract_inverted_index.estimation | 10 |
| abstract_inverted_index.finite-sum | 18 |
| abstract_inverted_index.functions. | 47 |
| abstract_inverted_index.link-level | 83 |
| abstract_inverted_index.non-convex | 45 |
| abstract_inverted_index.strategies | 2 |
| abstract_inverted_index.convergence | 111, 143 |
| abstract_inverted_index.distributed | 12, 35 |
| abstract_inverted_index.literature, | 56 |
| abstract_inverted_index.logarithmic | 88 |
| abstract_inverted_index.simulations | 159 |
| abstract_inverted_index.single-time | 62 |
| abstract_inverted_index.Illustrative | 157 |
| abstract_inverted_index.minimization | 19 |
| abstract_inverted_index.nonlinearity | 84 |
| abstract_inverted_index.optimization | 1, 53 |
| abstract_inverted_index.quantization | 89 |
| abstract_inverted_index.sector-bound | 150 |
| abstract_inverted_index.time-varying | 116, 121 |
| abstract_inverted_index.transmission | 153 |
| abstract_inverted_index.Decentralized | 0 |
| abstract_inverted_index.applications, | 7 |
| abstract_inverted_index.representing, | 85 |
| abstract_inverted_index.contributions. | 163 |
| abstract_inverted_index.computationally | 30 |
| abstract_inverted_index.sign-preserving | 149 |
| abstract_inverted_index.perturbation-based | 102 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 3 |
| citation_normalized_percentile |