1) Object convex hull
目标凸壳
2) shell target
壳程目标
4) nonconvex multi-object programming
多目标非凸规划
5) doubleobjective convex programing
双目标凸规划
6) non-convex objective function
非凸目标函数
1.
In this paper, the convergence of memoryless quasi-Newton method for unconstrained optimization problems is discussed, and several sufficient conditions are given for the convergence of memoryless quasi-Newton method with non-convex objective function and inexact line searches.
本文讨论了无约束最优化问题的无记忆拟牛顿方法的收敛性,给出了对于非凸目标函数,在非精确线搜索条件下,无记忆拟牛顿方法收敛性的几个充分性条件。
补充资料：凸凸
1.高出貌。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条