• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • 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分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

用于解决优化问题的启发式卡尔曼算法。

Heuristic Kalman algorithm for solving optimization problems.

作者信息

Toscano Rosario, Lyonnet Patrick

机构信息

Laboratoire de Tribologie et de Dynamique des Systèmes, Ecole Nationale d'Ingénieurs de Saint-Etienne, Saint-Etienne Cedex 2, France.

出版信息

IEEE Trans Syst Man Cybern B Cybern. 2009 Oct;39(5):1231-44. doi: 10.1109/TSMCB.2009.2014777. Epub 2009 Mar 24.

DOI:10.1109/TSMCB.2009.2014777
PMID:19336312
Abstract

The main objective of this paper is to present a new optimization approach, which we call heuristic Kalman algorithm (HKA). We propose it as a viable approach for solving continuous nonconvex optimization problems. The principle of the proposed approach is to consider explicitly the optimization problem as a measurement process designed to produce an estimate of the optimum. A specific procedure, based on the Kalman method, was developed to improve the quality of the estimate obtained through the measurement process. The efficiency of HKA is evaluated in detail through several nonconvex test problems, both in the unconstrained and constrained cases. The results are then compared to those obtained via other metaheuristics. These various numerical experiments show that the HKA has very interesting potentialities for solving nonconvex optimization problems, notably concerning the computation time and the success ratio.

摘要

本文的主要目标是提出一种新的优化方法,我们称之为启发式卡尔曼算法(HKA)。我们将其作为解决连续非凸优化问题的一种可行方法提出。该方法的原理是将优化问题明确视为一个旨在产生最优估计的测量过程。基于卡尔曼方法开发了一种特定程序,以提高通过测量过程获得的估计质量。通过几个非凸测试问题,在无约束和有约束情况下详细评估了HKA的效率。然后将结果与通过其他元启发式方法获得的结果进行比较。这些各种数值实验表明,HKA在解决非凸优化问题方面具有非常有趣的潜力,特别是在计算时间和成功率方面。

相似文献

1
Heuristic Kalman algorithm for solving optimization problems.用于解决优化问题的启发式卡尔曼算法。
IEEE Trans Syst Man Cybern B Cybern. 2009 Oct;39(5):1231-44. doi: 10.1109/TSMCB.2009.2014777. Epub 2009 Mar 24.
2
Nonsmooth optimization techniques for semisupervised classification.用于半监督分类的非光滑优化技术。
IEEE Trans Pattern Anal Mach Intell. 2007 Dec;29(12):2135-42. doi: 10.1109/TPAMI.2007.1102.
3
Minimum distance between pattern transformation manifolds: algorithm and applications.模式变换流形之间的最小距离:算法与应用
IEEE Trans Pattern Anal Mach Intell. 2009 Jul;31(7):1225-38. doi: 10.1109/TPAMI.2008.156.
4
Analyses of simple hybrid algorithms for the vertex cover problem.顶点覆盖问题的简单混合算法分析
Evol Comput. 2009 Spring;17(1):3-19. doi: 10.1162/evco.2009.17.1.3.
5
Enhanced differential evolution with adaptive strategies for numerical optimization.用于数值优化的具有自适应策略的增强差分进化算法。
IEEE Trans Syst Man Cybern B Cybern. 2011 Apr;41(2):397-413. doi: 10.1109/TSMCB.2010.2056367. Epub 2010 Sep 9.
6
A constraint-based evolutionary learning approach to the expectation maximization for optimal estimation of the hidden Markov model for speech signal modeling.一种基于约束的进化学习方法,用于语音信号建模的隐马尔可夫模型最优估计的期望最大化。
IEEE Trans Syst Man Cybern B Cybern. 2009 Feb;39(1):182-97. doi: 10.1109/TSMCB.2008.2004051. Epub 2008 Dec 9.
7
Quantum-inspired immune clonal algorithm for global optimization.用于全局优化的量子启发式免疫克隆算法。
IEEE Trans Syst Man Cybern B Cybern. 2008 Oct;38(5):1234-53. doi: 10.1109/TSMCB.2008.927271.
8
An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding.一种带有概率禁忌搜索的不耐烦进化算法,用于通过团发现对图论和集合论中的一些NP难问题进行统一求解。
IEEE Trans Syst Man Cybern B Cybern. 2008 Jun;38(3):645-66. doi: 10.1109/TSMCB.2008.915645.
9
A new approach for analyzing average time complexity of population-based evolutionary algorithms on unimodal problems.一种分析基于种群的进化算法在单峰问题上平均时间复杂度的新方法。
IEEE Trans Syst Man Cybern B Cybern. 2009 Oct;39(5):1092-106. doi: 10.1109/TSMCB.2008.2012167. Epub 2009 Mar 24.
10
A fast 2D shape recovery approach by fusing features and appearance.一种通过融合特征与外观的快速二维形状恢复方法。
IEEE Trans Pattern Anal Mach Intell. 2009 Jul;31(7):1210-24. doi: 10.1109/TPAMI.2008.151.