严格凸性

In this paper, based on the conjugate function and the dual programming of convex programming, with the dual cone, to conic programming, the dual programming is fully discussed, the expression of the dual programming is educed, the main dualities are proved, and the dualities of the familiar conic programming are studied.

以共轭函数和凸规划的对偶规划为基础，利用对偶锥的概念，全面讨论了一般锥规划的对偶问题，严格推导出锥规划对偶规划的表示形式，给出了锥规划的主要对偶性质，并用这些结果研究了常见锥规划的对偶性。

We also study the continuous properties of the curve segment.

并且从理论上对曲线的连续性及保凸性进行了严格的证明

A Lipschitz strictly pseudocontractive map from a nonempty closed convex subset of a Hilbert space into itself was showed to have fixed points, Ishikawa and Mann iterative sequences with errors of a Lipschitz strictly pseudocontractive map was introduced and the iteration processes strongly converges to a fixed point was proved.

证明了在Hilbert空间中的非空闭凸集上Lipschitz严格伪压缩映象有不动点，介绍了Lips-chitz严格伪压缩映像下的的具误差的 Ishikawa和Mann迭代序列并证明了其强收敛性于不动点，其结果把非扩张映像推广到Lipschitz严格伪压缩映象上，改进了一些相关结果。

For strictly convex problems, it is proved that the decomposed two-level problem is equivalent to the original one.

对于严格凸问题，证明了分解问题与原问题的等价性。

Chapter2, mainly summarizing the optimality conditions for the nonconvex semidefinite programming, first recalls the concept of transversality condition, proves that transversality condition and linear independence condition are equivalent, and shows that under strict complementarity condition, the transversality condition is a sufficient condition for uniqueness of the Lagrange multipliers.

第2章，主要综述非凸半定规划的最优性条件，首先回顾了横截性条件的概念，证明了横截性条件与线性无关条件是等价的。并且说明了在严格互补松弛条件下，横截性条件是Lagrange乘子矩阵唯一的充要条件。

In chapter 4,we introduce the basic properties for pluripotential theory and results about the existence of weak solutions. Then we prove the existence of weak solution in some special domain which is not strictly pseudoconvex.

第四章我们先介绍多重位势理论的一些基本知识，然后介绍复Monge-Ampere方程在严格拟凸域上的已有的两个重要结论，之后讨论一类特殊的非严格拟凸域上复Monge-Ampere方程弱解的存在性。

In order to ensure the strict feasibility of the optimal solution, in the lower-level of program, the constraints are imposed on the confidence upper bounds of the structural responses by constructing the "bounding ellipsoid", which can be obtained efficiently by solving some convex LSDP problems.

对于下层优化问题，本论文构造定界椭球，通过求解凸的LSDP模型来得到结构最不利响应的一个严格上界，确保了鲁棒结构优化设计的可置信性。

Consequently, when applied to minimize a strictly convex quadratic function, the proposed methods terminate at the solution of the problem finitely.

因此，当目标函数是严格凸的二次函数，且采用精确线性搜索时，这些修正的共轭梯度法具有共轭性和二次终止性。

The method attempts to transform the original problem into a series of unconstraint optimization problems.

在这些研究中，均假定在对数障碍函数是严格凸的及解集是非空有界的情况下，证明了方法的全局收敛性。

In view of these, the second part of this paper presents two sufficient conditions and two mixed type duals for the generalized fractional programming only under-convexity assumptions. These sufficient conditions apply to a broader class of mathematical programming problems.The results about weak duality, strong duality and strictly reverse duality arealso presented under more suitable conditions.

鉴于此，本文的第二部分，我们仅在函数—凸性假设下，给出了广义分式规划的二个最优性充分条件，这些充分条件较文献中的相关的条件有更广泛的适用性；同时还给出了混合型对偶，并且在适当的条件下，给出了相应的弱对偶定理、强对偶定理，以及严格逆对偶定理。

Do not gum up the work by telling mother what we are going to do .

别告诉母亲我们要干的事，那会把事情搞糟的。

In recent years, application of the partial prestressed concrete beam s is developed.

近年来，随着部分预应力砼梁应用的推广，发现我国规范所采用的名义拉应力法的计算结果不稳定。