nonconvex

基本解釋

However, the PRP method even with the exact line search is not globally convergent on nonconvex functions.
然而，對一般非凸函數(shù)，PRP方法即使采用精確線搜索也不能保證全局收斂。
However, the global astringency of the interior point method for nonconvex problems is doubtml theoretically.
但在理論上，內(nèi)點法求解非凸優(yōu)化問題時的全局收斂性能受到質(zhì)疑。
To the unconstrained programme of nonconvex function, this article gives a class of modified BFGS algorithm.
本文對于非凸函數(shù)的無約束優(yōu)化問題,給出一類修正的BFGS算法。
We utilized the combined maximum entropy homotopy method to solve the general nonconvex nonlinear programming problems.
利用組合極大熵同倫方法,研究一般的非凸非線性規(guī)劃問題。
In addition, two difficulties in EFG, treating essential boundary conditions and approximations near nonconvex boundaries, are discussed.
另外，本文還討論了無單元法中的兩個難點：邊界條件的引入以及非凸邊界的處理，較好的解決了這兩個問題。