锁钩板、铰链和弹簧限位凸子均设置在装配弯折边的内侧面上。
The locking plate, the clasps and an elastic position-limiting convex are all provided on the inside of the curved line.
该方法将网络训练问题变换为一系列的凸规划子问题，而这些子问题都可以在较短时间内获得全局最优解。
The proposed method transforms the training problem into a number of convex subproblems which can be solved in shorter time to obtain globally solutions.
然后，运用凸优化技术分析了该资源分配问题，并基于拉格朗日对偶法给出了一种子载波和功率最优分配算法。
Then, by use of multiple carrier system's frequency-sharing property and convex optimization, a subcarrier and power optimal allocation algorithm is proposed based on Lagrangian duality theory.
讨论了解析函数子族的积分变换，相应地给出了一类近于凸积分算子的某些结果。
In this paper, integral transforms of functions belong tot he class are investigated, some results of a close to convex integral operator are given as well.
针对问题的非凸性，提出了基于拉格朗日对偶方法的最优子信道、速率和功率分配算法，并从经济学的角度予以解释。
We formulated this optimization problem and solved it using the Lagrangian dual method and interpreted it from the angle of economics.
首先我们放松了对不确定集的限制，把鲁棒线性最优化拓展到凸锥和子空间平移的交的不确定集的情形。
First, we relax the uncertainty set to be intersection of a closed convex cone and the translation of an affine subspace.
此外，突出的凸肩(17)用于支撑一绝缘子装置(15)。
Furthermore, the projecting shoulder (17) is used for supporting an insulator arrangement (15).
该算法基于凸优化理论，对功率分配、子载波配对、中继选择和用户选择进行了联合优化。
Based on the convex optimization, the algorithm jointly optimizes power allocation, subcarrier pairing, relay selection and user selection.
第六章，由第五章求解无约束问题的多维滤子信赖域修正算法出发，将其推广到界约束乃至凸约束的优化问题。
Numerical results show that the present algorithm is efficient and reliable. The last chapter, we present a modified filter trust region method for bound constrained problems.
第六章，由第五章求解无约束问题的多维滤子信赖域修正算法出发，将其推广到界约束乃至凸约束的优化问题。
Numerical results show that the present algorithm is efficient and reliable. The last chapter, we present a modified filter trust region method for bound constrained problems.
应用推荐