Global convergence for the algorithm is established under the assumption that the objective function is bounded from below, The authors also generalize the algorithm to constrained convex optimization and obtain the convergence that is the same as unconstrained algorithm.

  • 此外还把算法推广到约束凸规划问题,得到了与无约束问题同样的收敛结果,如果约束是线性的,则算法是数值可行的。

  • 互联网摘选 2025-01-20 11:58:40

    • 相关例句
    精确
    • 模糊
    • 词首
    • 词尾
    • 词义
    • 例句