nonconvex

基本解釋

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