1) convex programming problem
凸规则
1.
On the basis of a new class of equivalent conditions for the solution existence of convex programming problems, a continuation method with global convergence is proposed and its convergence isproved.
针对一类凸规则问题解存在的新等价性条件，给出全局收敛的连续化方法，证明了其收敛性。
2) E-convex programming
E-凸规划
1.
And a counter example about a result of E-convex programming is given.
给出了一类广义的凸集和凸函数——E-凸集和E-凸函数的一个性质;并给出了关于E-凸规划命题的一个反例。
3) convex programming
凸规划
1.
Interior point algorithm of convex programming with simple constraints;
简单约束凸规划的一种内点算法
2.
Convergence of maxnnum entropy method for solving constrained convex programming;
一般约束凸规划极大熵方法的收敛性
4) B-vex programming
B-凸规划
1.
The definition of B-vex programming is proposed and its basic properties are obtained.
通过给出B－凸规划的定义并研究它的基本性质，得到B－凸规划的最优性条件。
5) Nonconvex programming
非凸规划
1.
A new homotopy method,called boundary moving combined homotopy method,for solving nonconvex programming is given,and the existence and convergence of the homotopy path is proved under some weak conditions.
本文给出了一个新的求解非凸规划问题的同伦方法,称为动边界同伦方程,并在较弱的条件下,证明了同伦路径的存在性和大范围收敛性。
2.
To the nonconvex programming, the article makes it local convexification by introducing a simple penalty function into the obje ctive function, and solves it like solving convex programming.
针对非凸规划 ,本文引进一简单的惩罚函数将其局部凸化 ,然后用凸规划的方法求解。
3.
The present paper deals with the association of the solution and lagrange multiplier of nonconvex programming with quadratic constraint, and it is shown by means of some examples that the association is hardly programmed for general nonconvex programming problems.
讨论二次约束非凸规划问题的解与Lagrange乘子的若干关系,并举例说明对于一般凸规划问题,这种关系不易刻划清楚。
6) reverse convex programming problem
反凸规划
1.
Secondly,several convexification and con- cavification transformations for the constrained problem with strictly monotone constraint functions are proposed according to the transformed problem with single constraint,then this constrained programming problem can be converted into a concave minimization or a reverse convex programming problem.
首先将一个具有多个约束的规划问题转化为一个只有一个约束的规划问题,然后通过利用这个单约束的规划问题,对原来的多约束规划问题提出了一些凸化、凹化的方法,这样这些多约束的规划问题可以被转化为一些凹规划、反凸规划问题。
参考词条
补充资料：凸凸
1.高出貌。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。