English
张诗诗, 徐尔. 无约束多目标优化的一种新的下降算法[J]. 信阳师范学院学报(自然科学版), 2014, 27(4): 499-501. DOI: 10.3969/j.issn.1003-0972.2014.04.008
引用本文: 张诗诗, 徐尔. 无约束多目标优化的一种新的下降算法[J]. 信阳师范学院学报(自然科学版), 2014, 27(4): 499-501. DOI: 10.3969/j.issn.1003-0972.2014.04.008
shu
Zhang Shishi , Xu Er . A New Descent Algorithm for Unconstrained Multiobjective Programming[J]. Journal of Xinyang Normal University (Natural Science Edition), 2014, 27(4): 499-501. DOI: 10.3969/j.issn.1003-0972.2014.04.008
Citation: Zhang Shishi , Xu Er . A New Descent Algorithm for Unconstrained Multiobjective Programming[J]. Journal of Xinyang Normal University (Natural Science Edition), 2014, 27(4): 499-501. DOI: 10.3969/j.issn.1003-0972.2014.04.008
shu

无约束多目标优化的一种新的下降算法

A New Descent Algorithm for Unconstrained Multiobjective Programming

    摘要
  • 摘要: 基于无约束多目标的最速下降法,提出了无约束多目标优化问题的一种新的下降算法,并证明了该算法在Armijo线性搜索下的收敛性.数据试验结果验证了该算法的有效性.

     

    Abstract: Based on the steepest descent method for multicriteria optimization, a new descent algorithm for multiobjective programming without constraints was presented, and its convergence under Armijo line search was proved. Numerical results showed that the proposed method was efficient.

     

    • HTML全文
    • 参考文献(2)
    • 相关文章
    • 施引文献
  • 资源附件(0)

/

返回文章
返回