A Solution for Projection Pursuit Problem Based on Particle Swarm Optimization Simulated Annealing
The optimal projection direction for projection pursuit is a class of multivariable constrained optimization problems, with a large solution space. General calculation methods consume much time, are easy to get stuck in local minima, and have low solving efficiency. Simulated annealing can solve projection pursuit problems based on the principle of natural cooling, but there are problems with initial solution setting difficulty and insufficient single round optimization ability. Based on particle swarm optimization and natural population evolution, optimize the initial solution of simulated annealing and promote simulated annealing evolution iteration to improve the efficiency of solving simulated annealing projection pursuit problems. The case results demonstrate the applicability and effectiveness of the proposed method in solving such problems, and the problem solving effect is significantly better than traditional simulated annealing projection search models.
Authors
- Yongqing Fu (ORCID: https://orcid.org/0000-0001-9797-4036)
- Tong Liu (ORCID: https://orcid.org/0000-0001-5497-8117)
- Xutao Sun
Institutions
- Academy of Military Medical Sciences (CN)
- PLA Academy of Military Science (CN)
Publication Details
- Published
- 2024-10-18
- DOI
- https://doi.org/10.1109/ceccc62598.2024.11063629
- Primary Topic
- Guidance and Control Systems
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China