A New Scope and Domain Measure Comparison Method for Global Convergence Analysis in Evolutionary Computation Article Swipe
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2505.04089
Convergence analysis is a fundamental research topic in evolutionary computation (EC). The commonly used analysis method models the EC algorithm as a homogeneous Markov chain for analysis, which is not always suitable for different EC variants, and also sometimes causes misuse and confusion due to their complex process. In this article, we categorize the existing researches on convergence analysis in EC algorithms into stable convergence and global convergence, and then prove that the conditions for these two convergence properties are somehow mutually exclusive. Inspired by this proof, we propose a new scope and domain measure comparison (SDMC) method for analyzing the global convergence of EC algorithms and provide a rigorous proof of its necessity and sufficiency as an alternative condition. Unlike traditional methods, the SDMC method is straightforward, bypasses Markov chain modeling, and minimizes errors from misapplication as it only focuses on the measure of the algorithm's search scope. We apply SDMC to two algorithm types that are unsuitable for traditional methods, confirming its effectiveness in global convergence analysis. Furthermore, we apply the SDMC method to explore the gene targeting mechanism's impact on the global convergence in large-scale global optimization, deriving insights into how to design EC algorithms that guarantee global convergence and exploring how theoretical analysis can guide EC algorithm design.
Related Topics
- Type
- preprint
- Language
- en
- Landing Page
- http://arxiv.org/abs/2505.04089
- https://arxiv.org/pdf/2505.04089
- OA Status
- green
- OpenAlex ID
- https://openalex.org/W4416012253
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4416012253Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.48550/arxiv.2505.04089Digital Object Identifier
- Title
-
A New Scope and Domain Measure Comparison Method for Global Convergence Analysis in Evolutionary ComputationWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2025Year of publication
- Publication date
-
2025-05-07Full publication date if available
- Authors
-
Liu-Yue Luo, Zhi‐Hui Zhan, Kay Chen Tan, Jun ZhangList of authors in order
- Landing page
-
https://arxiv.org/abs/2505.04089Publisher landing page
- PDF URL
-
https://arxiv.org/pdf/2505.04089Direct 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/2505.04089Direct OA link when available
- Cited by
-
0Total citation count in OpenAlex
Full payload
| id | https://openalex.org/W4416012253 |
|---|---|
| doi | https://doi.org/10.48550/arxiv.2505.04089 |
| ids.doi | https://doi.org/10.48550/arxiv.2505.04089 |
| ids.openalex | https://openalex.org/W4416012253 |
| fwci | |
| type | preprint |
| title | A New Scope and Domain Measure Comparison Method for Global Convergence Analysis in Evolutionary Computation |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| language | en |
| locations[0].id | pmh:oai:arXiv.org:2505.04089 |
| 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 | |
| locations[0].pdf_url | https://arxiv.org/pdf/2505.04089 |
| locations[0].version | submittedVersion |
| locations[0].raw_type | text |
| locations[0].license_id | |
| locations[0].is_accepted | False |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | http://arxiv.org/abs/2505.04089 |
| locations[1].id | doi:10.48550/arxiv.2505.04089 |
| 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 | |
| locations[1].pdf_url | |
| locations[1].version | |
| locations[1].raw_type | article |
| locations[1].license_id | |
| 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.2505.04089 |
| indexed_in | arxiv, datacite |
| authorships[0].author.id | https://openalex.org/A5070246047 |
| authorships[0].author.orcid | |
| authorships[0].author.display_name | Liu-Yue Luo |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Luo, Liu-Yue |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5011145004 |
| authorships[1].author.orcid | https://orcid.org/0000-0003-0862-0514 |
| authorships[1].author.display_name | Zhi‐Hui Zhan |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Zhan, Zhi-Hui |
| authorships[1].is_corresponding | False |
| authorships[2].author.id | https://openalex.org/A5025285243 |
| authorships[2].author.orcid | https://orcid.org/0000-0002-6802-2463 |
| authorships[2].author.display_name | Kay Chen Tan |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Tan, Kay Chen |
| authorships[2].is_corresponding | False |
| authorships[3].author.id | https://openalex.org/A5100400217 |
| authorships[3].author.orcid | https://orcid.org/0000-0001-7835-9871 |
| authorships[3].author.display_name | Jun Zhang |
| authorships[3].author_position | last |
| authorships[3].raw_author_name | Zhang, Jun |
| authorships[3].is_corresponding | False |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://arxiv.org/pdf/2505.04089 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | A New Scope and Domain Measure Comparison Method for Global Convergence Analysis in Evolutionary Computation |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-08T23:21:52.890332 |
| primary_topic | |
| cited_by_count | 0 |
| locations_count | 2 |
| best_oa_location.id | pmh:oai:arXiv.org:2505.04089 |
| 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 | |
| best_oa_location.pdf_url | https://arxiv.org/pdf/2505.04089 |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | text |
| best_oa_location.license_id | |
| 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/2505.04089 |
| primary_location.id | pmh:oai:arXiv.org:2505.04089 |
| 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 | |
| primary_location.pdf_url | https://arxiv.org/pdf/2505.04089 |
| primary_location.version | submittedVersion |
| primary_location.raw_type | text |
| primary_location.license_id | |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | http://arxiv.org/abs/2505.04089 |
| publication_date | 2025-05-07 |
| publication_year | 2025 |
| referenced_works_count | 0 |
| abstract_inverted_index.a | 3, 21, 89, 108 |
| abstract_inverted_index.EC | 18, 34, 60, 104, 196, 209 |
| abstract_inverted_index.In | 48 |
| abstract_inverted_index.We | 149 |
| abstract_inverted_index.an | 117 |
| abstract_inverted_index.as | 20, 116, 137 |
| abstract_inverted_index.by | 84 |
| abstract_inverted_index.in | 7, 59, 165, 186 |
| abstract_inverted_index.is | 2, 28, 126 |
| abstract_inverted_index.it | 138 |
| abstract_inverted_index.of | 103, 111, 144 |
| abstract_inverted_index.on | 56, 141, 182 |
| abstract_inverted_index.to | 44, 152, 175, 194 |
| abstract_inverted_index.we | 51, 87, 170 |
| abstract_inverted_index.The | 11 |
| abstract_inverted_index.and | 36, 41, 65, 68, 92, 106, 114, 132, 202 |
| abstract_inverted_index.are | 79, 157 |
| abstract_inverted_index.can | 207 |
| abstract_inverted_index.due | 43 |
| abstract_inverted_index.for | 25, 32, 74, 98, 159 |
| abstract_inverted_index.how | 193, 204 |
| abstract_inverted_index.its | 112, 163 |
| abstract_inverted_index.new | 90 |
| abstract_inverted_index.not | 29 |
| abstract_inverted_index.the | 17, 53, 72, 100, 123, 142, 145, 172, 177, 183 |
| abstract_inverted_index.two | 76, 153 |
| abstract_inverted_index.SDMC | 124, 151, 173 |
| abstract_inverted_index.also | 37 |
| abstract_inverted_index.from | 135 |
| abstract_inverted_index.gene | 178 |
| abstract_inverted_index.into | 62, 192 |
| abstract_inverted_index.only | 139 |
| abstract_inverted_index.that | 71, 156, 198 |
| abstract_inverted_index.then | 69 |
| abstract_inverted_index.this | 49, 85 |
| abstract_inverted_index.used | 13 |
| abstract_inverted_index.(EC). | 10 |
| abstract_inverted_index.apply | 150, 171 |
| abstract_inverted_index.chain | 24, 130 |
| abstract_inverted_index.guide | 208 |
| abstract_inverted_index.proof | 110 |
| abstract_inverted_index.prove | 70 |
| abstract_inverted_index.scope | 91 |
| abstract_inverted_index.their | 45 |
| abstract_inverted_index.these | 75 |
| abstract_inverted_index.topic | 6 |
| abstract_inverted_index.types | 155 |
| abstract_inverted_index.which | 27 |
| abstract_inverted_index.(SDMC) | 96 |
| abstract_inverted_index.Markov | 23, 129 |
| abstract_inverted_index.Unlike | 120 |
| abstract_inverted_index.always | 30 |
| abstract_inverted_index.causes | 39 |
| abstract_inverted_index.design | 195 |
| abstract_inverted_index.domain | 93 |
| abstract_inverted_index.errors | 134 |
| abstract_inverted_index.global | 66, 101, 166, 184, 188, 200 |
| abstract_inverted_index.impact | 181 |
| abstract_inverted_index.method | 15, 97, 125, 174 |
| abstract_inverted_index.misuse | 40 |
| abstract_inverted_index.models | 16 |
| abstract_inverted_index.proof, | 86 |
| abstract_inverted_index.scope. | 148 |
| abstract_inverted_index.search | 147 |
| abstract_inverted_index.stable | 63 |
| abstract_inverted_index.complex | 46 |
| abstract_inverted_index.design. | 211 |
| abstract_inverted_index.explore | 176 |
| abstract_inverted_index.focuses | 140 |
| abstract_inverted_index.measure | 94, 143 |
| abstract_inverted_index.propose | 88 |
| abstract_inverted_index.provide | 107 |
| abstract_inverted_index.somehow | 80 |
| abstract_inverted_index.Inspired | 83 |
| abstract_inverted_index.analysis | 1, 14, 58, 206 |
| abstract_inverted_index.article, | 50 |
| abstract_inverted_index.bypasses | 128 |
| abstract_inverted_index.commonly | 12 |
| abstract_inverted_index.deriving | 190 |
| abstract_inverted_index.existing | 54 |
| abstract_inverted_index.insights | 191 |
| abstract_inverted_index.methods, | 122, 161 |
| abstract_inverted_index.mutually | 81 |
| abstract_inverted_index.process. | 47 |
| abstract_inverted_index.research | 5 |
| abstract_inverted_index.rigorous | 109 |
| abstract_inverted_index.suitable | 31 |
| abstract_inverted_index.algorithm | 19, 154, 210 |
| abstract_inverted_index.analysis, | 26 |
| abstract_inverted_index.analysis. | 168 |
| abstract_inverted_index.analyzing | 99 |
| abstract_inverted_index.confusion | 42 |
| abstract_inverted_index.different | 33 |
| abstract_inverted_index.exploring | 203 |
| abstract_inverted_index.guarantee | 199 |
| abstract_inverted_index.minimizes | 133 |
| abstract_inverted_index.modeling, | 131 |
| abstract_inverted_index.necessity | 113 |
| abstract_inverted_index.sometimes | 38 |
| abstract_inverted_index.targeting | 179 |
| abstract_inverted_index.variants, | 35 |
| abstract_inverted_index.algorithms | 61, 105, 197 |
| abstract_inverted_index.categorize | 52 |
| abstract_inverted_index.comparison | 95 |
| abstract_inverted_index.condition. | 119 |
| abstract_inverted_index.conditions | 73 |
| abstract_inverted_index.confirming | 162 |
| abstract_inverted_index.exclusive. | 82 |
| abstract_inverted_index.properties | 78 |
| abstract_inverted_index.researches | 55 |
| abstract_inverted_index.unsuitable | 158 |
| abstract_inverted_index.Convergence | 0 |
| abstract_inverted_index.algorithm's | 146 |
| abstract_inverted_index.alternative | 118 |
| abstract_inverted_index.computation | 9 |
| abstract_inverted_index.convergence | 57, 64, 77, 102, 167, 185, 201 |
| abstract_inverted_index.fundamental | 4 |
| abstract_inverted_index.homogeneous | 22 |
| abstract_inverted_index.large-scale | 187 |
| abstract_inverted_index.mechanism's | 180 |
| abstract_inverted_index.sufficiency | 115 |
| abstract_inverted_index.theoretical | 205 |
| abstract_inverted_index.traditional | 121, 160 |
| abstract_inverted_index.Furthermore, | 169 |
| abstract_inverted_index.convergence, | 67 |
| abstract_inverted_index.evolutionary | 8 |
| abstract_inverted_index.effectiveness | 164 |
| abstract_inverted_index.optimization, | 189 |
| abstract_inverted_index.misapplication | 136 |
| abstract_inverted_index.straightforward, | 127 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 4 |
| citation_normalized_percentile |