• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

遗传优化算法在金融投资组合问题中的应用。

Application of Genetic Optimization Algorithm in Financial Portfolio Problem.

机构信息

School of Sciences, Changzhou Institute of Technology, Changzhou 213000, China.

出版信息

Comput Intell Neurosci. 2022 Jul 15;2022:5246309. doi: 10.1155/2022/5246309. eCollection 2022.

DOI:10.1155/2022/5246309
PMID:35875786
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC9307338/
Abstract

In order to address the application of genetic optimization algorithms to financial investment portfolio issues, the optimal allocation rate must be high and the risk is low. This paper uses quadratic programming algorithms and genetic algorithms as well as quadratic programming algorithms, Matlab planning solutions for genetic algorithms, and genetic algorithm toolboxes to solve Markowitz's mean variance model. The mathematical model for introducing sparse portfolio strategies uses the decomposition method of penalty functions as an algorithm for solving nonconvex sparse optimization strategies to solve financial portfolio problems. The merging speed of the quadratic programming algorithm is fast, and the merging speed depends on the selection of the initial value. The genetic algorithm performs very well in global searches, but local search capabilities are insufficient and the pace of integration into the next stage is slow. To solve this, using a genetic algorithm toolbox is quick and easy. The results of the experiments show that the final solution of the decomposition method of the fine function is consistent with the solution of the integrity of the genetic algorithm. 67% of the total funds will be spent on local car reserves and 33% on wine reserves. When data scales are small, quadratic programming algorithms and genetic algorithms can provide effective portfolio feedback, and the method of breaking down penalty functions to ensure the reliability and effectiveness of algorithm combinations is widely used in sparse financial portfolio issues.

摘要

为了解决遗传优化算法在金融投资组合问题中的应用,必须实现高的最优配置率和低风险。本文使用二次规划算法和遗传算法以及二次规划算法、Matlab 规划遗传算法的解决方案,以及遗传算法工具箱来解决 Markowitz 的均值方差模型。引入稀疏投资组合策略的数学模型使用罚函数的分解方法作为求解非凸稀疏优化策略的算法来解决金融投资组合问题。二次规划算法的合并速度很快,合并速度取决于初始值的选择。遗传算法在全局搜索中表现出色,但局部搜索能力不足,下一阶段的整合速度较慢。为了解决这个问题,可以使用遗传算法工具箱来快速简便地解决。实验结果表明,精细函数分解方法的最终解与遗传算法的整体解一致。67%的总资金将用于当地汽车储备,33%用于葡萄酒储备。当数据规模较小时,二次规划算法和遗传算法可以提供有效的投资组合反馈,而分解罚函数的方法则可以确保算法组合的可靠性和有效性,这种方法在稀疏金融投资组合问题中得到了广泛应用。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/c737/9307338/c68c2969cf43/CIN2022-5246309.008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/c737/9307338/8877fa71092a/CIN2022-5246309.001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/c737/9307338/73d7f20f7cb1/CIN2022-5246309.002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/c737/9307338/84e4c3cac191/CIN2022-5246309.003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/c737/9307338/9b642dd4fac3/CIN2022-5246309.004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/c737/9307338/4b5fc2a276c1/CIN2022-5246309.005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/c737/9307338/6f773d590cf3/CIN2022-5246309.006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/c737/9307338/544f6af5d4b4/CIN2022-5246309.007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/c737/9307338/c68c2969cf43/CIN2022-5246309.008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/c737/9307338/8877fa71092a/CIN2022-5246309.001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/c737/9307338/73d7f20f7cb1/CIN2022-5246309.002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/c737/9307338/84e4c3cac191/CIN2022-5246309.003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/c737/9307338/9b642dd4fac3/CIN2022-5246309.004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/c737/9307338/4b5fc2a276c1/CIN2022-5246309.005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/c737/9307338/6f773d590cf3/CIN2022-5246309.006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/c737/9307338/544f6af5d4b4/CIN2022-5246309.007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/c737/9307338/c68c2969cf43/CIN2022-5246309.008.jpg

相似文献

1
Application of Genetic Optimization Algorithm in Financial Portfolio Problem.遗传优化算法在金融投资组合问题中的应用。
Comput Intell Neurosci. 2022 Jul 15;2022:5246309. doi: 10.1155/2022/5246309. eCollection 2022.
2
Optimization Model of Financial Market Portfolio Using Artificial Fish Swarm Model and Uniform Distribution.基于人工鱼群模型和均匀分布的金融市场投资组合优化模型
Comput Intell Neurosci. 2022 Jun 15;2022:7483454. doi: 10.1155/2022/7483454. eCollection 2022.
3
Tri-Criterion Model for Constructing Low-Carbon Mutual Fund Portfolios: A Preference-Based Multi-Objective Genetic Algorithm Approach.基于三准则模型构建低碳共同基金投资组合:基于偏好的多目标遗传算法方法。
Int J Environ Res Public Health. 2020 Aug 31;17(17):6324. doi: 10.3390/ijerph17176324.
4
An adapted Black Widow Optimization Algorithm for Financial Portfolio Optimization Problem with cardinalty and budget constraints.一种适用于具有基数和预算约束的金融投资组合优化问题的黑寡妇优化算法。
Sci Rep. 2024 Sep 28;14(1):22523. doi: 10.1038/s41598-024-71193-w.
5
Constrained portfolio optimization with discrete variables: An algorithmic method based on dynamic programming.带离散变量的约束投资组合优化:基于动态规划的算法方法。
PLoS One. 2022 Jul 28;17(7):e0271811. doi: 10.1371/journal.pone.0271811. eCollection 2022.
6
Design of Optimum Portfolio Scheme Based on Improved NSGA-II Algorithm.基于改进型 NSGA-II 算法的最优投资组合方案设计。
Comput Intell Neurosci. 2022 Jun 13;2022:7419500. doi: 10.1155/2022/7419500. eCollection 2022.
7
Cardinality Constrained Portfolio Optimization via Alternating Direction Method of Multipliers.基于乘子交替方向法的基数约束投资组合优化
IEEE Trans Neural Netw Learn Syst. 2024 Feb;35(2):2901-2909. doi: 10.1109/TNNLS.2022.3192065. Epub 2024 Feb 5.
8
An artificial bee colony algorithm for uncertain portfolio selection.一种用于不确定投资组合选择的人工蜂群算法。
ScientificWorldJournal. 2014;2014:578182. doi: 10.1155/2014/578182. Epub 2014 Jun 26.
9
Sparse and risk diversification portfolio selection.稀疏与风险分散的投资组合选择。
Optim Lett. 2023;17(5):1181-1200. doi: 10.1007/s11590-022-01914-5. Epub 2022 Jul 31.
10
An accelerating algorithm for globally solving nonconvex quadratic programming.一种用于全局求解非凸二次规划的加速算法。
J Inequal Appl. 2018;2018(1):178. doi: 10.1186/s13660-018-1764-1. Epub 2018 Jul 16.

引用本文的文献

1
An enhanced genetic algorithm solution for itinerary recommendation considering various constraints.一种考虑多种约束的行程推荐的改进遗传算法解决方案。
PeerJ Comput Sci. 2024 Oct 2;10:e2340. doi: 10.7717/peerj-cs.2340. eCollection 2024.
2
Strategic assessment model of smart stadiums based on genetic algorithms and literature visualization analysis: A case study from Chengdu, China.基于遗传算法和文献可视化分析的智能体育场战略评估模型:以中国成都为例
Heliyon. 2024 May 22;10(11):e31759. doi: 10.1016/j.heliyon.2024.e31759. eCollection 2024 Jun 15.

本文引用的文献

1
Opportunities for Gene and Environment Research in Cancer: An Updated Review of NCI's Extramural Grant Portfolio.癌症的基因与环境研究机遇:NCI 院外资助组合的最新回顾。
Cancer Epidemiol Biomarkers Prev. 2021 Mar;30(3):576-583. doi: 10.1158/1055-9965.EPI-20-1264. Epub 2020 Dec 15.