1) nonconvex constraint
非凸约束
1.
This paper proved the existence of bounded solutions for this kind Plateau problem by solving a local minimizing problem with nonconvex constraint via the calculus of variation,equation with measures and prior estimates.
应用变分方法，综合利用先验估计，含测度的方程，该文通过求解一个具有非凸约束的局部极小化问题，得到所考虑的Ｐｌａｔｅａｕ问题的有界解之存在性。
2) non-convex constraint information
非凸约束信息
4) Monotonic non-convex constraint
单调非凸约束
5) unconstrained nonconvex programming
无约束非凸优化
1.
In this paper,a homotopy method is used to solve unconstrained nonconvex programming problems.
利用同伦方法求解无约束非凸优化问题,证明了在同伦映射为正则映射的条件下,选取合适的同伦方程,当算法可以排除鞍点时,同伦方法一定收敛到局部极小解,而非极大解。
6) reverse convex constraint
反凸约束
1.
Convex programs with an additional reverse convex constraint;
带一个反凸约束的凸规划问题
2.
In this paper, we are concerned with a class of global optimization problem (P) with a reverse convex constraint:global minf(x)=CTx, subject to x∈D={x|h(x)≤0}, g(x)≥0where C∈Rn, g(x),h (x) are convex finite functions on Rn.
讨论一类带有一个反凸约束的全局规划（Ｐ）：ｇｌｏｂａｌｍｉｎｆ（ｘ）＝ＣＴｘ，ｓ。
3.
Conical subdivision method for concave programs to convex programs with an additional reverse convex constraint was applied.
将凹规划问题的锥剖分方法应用于带有一个反凸约束的凸规则，得到了一个锥分解算法，并证明了算法的收敛性。
补充资料：凸凸
1.高出貌。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条