An Enhanced Competitive Swarm Optimizer With Strongly Convex Sparse Operator for Large-Scale Multiobjective Optimization
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Sparse multiobjective optimization problems (MOPs) have become increasingly important in many applications in recent years, e.g., the search for lightweight deep neural networks and high-dimensional feature selection. However, little attention has been paid to sparse large-scale MOPs, whose Pareto-optimal sets are sparse, i.e., with many decision variables equal to zero. To address this issue, this article proposes an enhanced competitive swarm optimization algorithm assisted by a strongly convex sparse operator (SCSparse). A tricompetition mechanism is introduced into competitive swarm optimization, aiming to strike a better balance between exploration and exploitation. In addition, the SCSparse is embedded in the position updating of the particles to generate sparse solutions. Our simulation results show that the proposed algorithm outperforms the state-of-the-art methods on both sparse test problems and application examples.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A new optimizer using particle swarm theory
Eberhart, R., & Kennedy, J. (2002) · MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science · doi:10.1109/mhs.1995.494215 · Cited by 16,067
A Competitive Swarm Optimizer for Large Scale Optimization
Cheng, R., & Jin, Y. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2322602 · Cited by 1,052 · cited 3×
“Due to its ability to solve large-scale problems, CSO [23] has attracted much attention.”
BackgroundSelf-citationA social learning particle swarm optimization algorithm for scalable optimization
Cheng, R., & Jin, Y. (2015) · Information Sciences · doi:10.1016/j.ins.2014.08.039 · Cited by 747 · cited 2×
“For the updating strategy of l 1, we omit the term of pBest, as learning from pBest is a kind of individual (asocial) learning which may suffer from individual trial and error [16].”
BackgroundMethodSelf-citation
Cited by
A Blockchain-Reinforced Federated Intrusion Detection Architecture for IIoT
Jiang, D., Wang, Z., Wang, Y., Tan, L., Wang, J., & Zhang, P. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3406602 · Cited by 28
Self-citation
Metadata
- Authors
- Wang, X., Zhang, K., Wang, J., & Jin, Y.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2022-10
- Volume
- 26
- Issue
- 5
- Pages
- 859-871
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W3199466527
- Cited by
- 173
- References
- 3
- FWCI
- 14.87
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.