您要查找的是不是：
- This paper concerns nonsmooth semidefinite programming problems. 摘要首次考虑了非光滑半定规化问题。
- A perturbed problem for semidefinite programming problem was constructed. 摘要构造半定规划的一个扰动问题。
- Finally, optimality necessary and sufficient conditions for nonlinear convex semidefinite programming are proved. 并给出了非线性半定规划的最优性必要和充分条件.
- Result of the simulation shows Semidefinite Programming Ralaxation methodis fine feasibility and effciency. 计算机仿真结果证明：半定规划松驰方法具有良好的可行性和有效性。
- A semidefinite programming method (SDP) has been proposed to solve the sensor network localization. 摘要利用半定规划松驰法对无线传感器网络进行初始定位。
- Semidefinite programming (SDP) ha a wide range of applications, such as system theory, control theory, mode recognition, etc. 摘要半定规划有着广泛的应用领域，例如系统论，控制论，模式识别等领域。
- Compared with the standard problem for semidefinite programming, the perturbed problem has a strictly feasible solution. 相比半定规划的标准问题，该扰动问题具有严格可行解。
- Based on the semidefinite programming relaxation of the max-cut problem, a feasible direction algorithm is proposed, and its convergence is proved. 摘要本文对最大割问题的半定规划松弛提出一个可行方向法，并给出算法的收敛性证明。
- This was mainly applied to designing and analyzing the infeasible interior-point algorithm for semidefinite programming. 这对于设计和分析半定规划的不可行内点算法具有重要作用。
- The paper studied the multiobjective semidefinite programming with a semidefinite constraint of a matrix function and a multiobjective function. 主要研究含矩阵函数半定约束和向量函数等式约束以及多个目标函数的多目标半定规划的对偶和鞍点问题。
- The parametric uncertainty systems in this paper were included in a convex optimization subjected to LMIS, which can be solved by positive semidefinite programming (SDP). 对文中采用的不确定性系统，归结为LMIS约束下的凸优化问题，可利用半正定规划技术求解。
- It is well known that the constraint of semidefinite is nonlinear and nonsmooth, but convex, So semidefinite programming is convex optimization problems. 半定规划的约束是非线性的，非光滑的，但却是凸的，因此是凸规划。
- In chapter 1, we briefly review the development as well as research situation of semidefinite programming and then introduce the topic in the following chapters. 第一章我们简单介绍了半定规划的发展与研究现状，从而引出后面我们要研究的课题。
- The solution process of these coefficients is formulated as a semidefinite programming，and hence the final model has the globally minimized fitting error. 为了使新延时模型的构造快速且准确，样条系数的求解过程被描述为一个半定规划问题，因此得到的新模型具有全局最小的拟合误差。
- A nonsmooth Newton's method for nonlinear semidefinite programming was discussed by using 4-tensor analysis. The locally quadratic convergence for this nonsmooth Newton's method was also established. 摘要通过4-阶张量分析讨论了一类针对非线性半定规划的非光滑牛顿法。并给出了这种非光滑牛顿法的局部二次收敛性。
- Semidefinite programming is an extension of linear programming(LP) with vector variables replaced by matrix variables and nonnegativity elementwise replaced by positive semidefinite. 半定规划是线性规划的推广，它是在线性规划中用矩阵变量取代向量变量，用矩阵的半正定性取代向量的非负性得到的。
- Numerical experiments show that the proposed algorithm is more efficient than the interior-point algorithm for solving the semidefinite programming relaxation of the max-cut problem. 数值实验表明：与半定规划内点法相比，可行方向法更能有效地求解大规模的最大割问题的半定规划松弛。
- Semidefinite programming relaxation 半定规划松弛
- large-scale semidefinite programming 大规模半定规划问题
- nonlinear convex semidefinite programming 非线性凸半定规划
