首页> 外文期刊>IEEE Transactions on Circuits and Systems. I, Regular Papers >A systematic search method for obtaining multiple local optimalsolutions of nonlinear programming problems
【24h】

A systematic search method for obtaining multiple local optimalsolutions of nonlinear programming problems

机译:一种获得非线性规划问题的多个局部最优解的系统搜索方法

获取原文
获取原文并翻译 | 示例
       

摘要

We propose, in this paper, a systematic method to find several local optimal solutions for general nonlinear optimization problems. We have developed some analytical results for quasi-gradient systems and reflected gradient systems, applying these results to derive topological and geometric properties of the critical points of the underlying objective function. A mechanism has also been devised to escape from a local optimal solution and proceed into another local optimal solution via decomposition points. By properly switching between quasi-gradient systems and reflected gradient systems, our proposed method can attain a set of local optimal solutions. The proposed method is applied to two test examples with promising results
机译:在本文中,我们提出了一种系统的方法来找到一般非线性优化问题的几个局部最优解。我们已经为准梯度系统和反射梯度系统开发了一些分析结果,并将这些结果应用到基础目标函数的临界点的拓扑和几何性质。还已经设计出一种机制来逃避局部最优解并通过分解点进入另一局部最优解。通过在准梯度系统和反射梯度系统之间进行适当的切换,我们提出的方法可以获得一组局部最优解。将该方法应用于两个测试实例,结果令人满意

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号