These two algorithms relax the constraints of ML algorithm and transform it into a convex problem which can be efficiently solved with a polynomial time.
这两类算法是在ML算法基础上放松约束条件，将问题转化为可在多项式时间内解决的凸优化问题。
The convexity of curves and surfaces is an important property in the field of Computer Aided Geometric Design (CAGD). This paper tries to tackle the positive and convex problem of polynomials.
在计算机辅助几何设计(CAGD)中，曲面曲线的凸性是一种重要的特性旨在解决多项式的正性和凸性问题。
The proposed method transforms the training problem into a number of convex subproblems which can be solved in shorter time to obtain globally solutions.
该方法将网络训练问题变换为一系列的凸规划子问题，而这些子问题都可以在较短时间内获得全局最优解。
Convex hull problem is one of the fundamental problems in computational geometry, and is used in many fields.
凸包问题是计算几何的基本问题之一，在许多领域均有应用。
The paper offers a dual problem for the semi-infinite convex programming by using the directional derivative with zero dual gap.
本文对半无限凸规划提出一个用方向导数表述的对偶问题，其对偶间隙为零。
Under several suitable transformations, the problem of positive solutions for set-valued condensing mapping equation in an ordered locally convex topological space is studied by some homotopy method.
本文用某种同伦方法，借助于一些适当的变换，讨论了有序的局部凸拓扑线性空间中集值凝聚映象方程的正解问题。
The problem of robust stability analysis for convex polytopic uncertain discrete-time systems with multiple-state delays is investigated.
研究了具有多重状态时滞的凸多面体不确定离散系统的鲁棒稳定性分析问题。
The problem of the existence of a cone subdifferential for the cone convex set valued maps in the locally convex, linear and topological vector space is discussed.
在局部凸线性拓扑向量空间讨论了一种锥凸集值映射的锥次微分的存在性问题，证明了几个锥次微分的存在定理。
The problem is reduced to a linear convex optimization algorithm via LMI approach.
采用线性矩阵不等式方法，将问题转化为一个线性凸优化算法。
Applying Logrithmic convex method, an average stability for the inverse parabolic problem with final observation is constructed under suitable correctness condition.
在一类适定性条件下，应用对数凸性方法证明了抛物方程终值问题具有平均稳定性。
SVM transforms machine learning to solve an optimization problem, and to solve a convex quadratic programming problem by the optimization theory and method constructing algorithms.
它将机器学习问题转化为求解最优化问题，并应用最优化理论构造算法来解决凸二次规划问题。
In convex programming theory, a constrained optimization problem, by KT conditions, is usually converted into a mixed nonlinear complementarity problem.
在凸规划理论中，通过KT条件，往往将约束最优化问题归结为一个混合互补问题来求解。
The main purpose of this paper is to study expansive directions for norm bodies in the CM-problem with convex and complementary convex constraints.
本文的主要目的是研究具有凸与补凸约束的CM一问题中范数体的膨胀方向；
Based on LMI (linear matrix inequality) method and convex combination technique, the problem of robust stabilization for a class of uncertain switched systems with nonlinear disturbance is studied.
基于线性矩阵不等式(LMI)方法和凸组合技术，研究一类带有非线性扰动的不确定切换系统的鲁棒镇定问题。
Using the linear matrix inequality (LMI) technique, the problem is converted into a linear convex optimization algorithm so that a global optimization solution is obtained. Finally.
采用线性矩阵不等式技术，将问题转化为一线性凸优化算法，可得问题的全局最优解。
The establishment of a recurrence relation in geometric convex set is the key to solve a problem.
几何凸集中递归关系的建立是求解问题的关键。
Finally, this thesis gives the definition of the rectilinear Steiner tree problem in more higher-dimensional space, and the corresponding structure of the minimum convex polyhedron.
最后本文给出了在更高维空间的直角斯坦纳树问题的定义，和相应的最小凸多面体的构造。
The problem of collision detection between a pair of convex objects is summed up a problem of non-linear programming with restrict conditions in this paper.
将两凸物体间碰撞检测问题归结为一个带约束条件的非线性规划问题。
Reliability index Robust Convex model Optimization problem;
可靠性指标；稳健；凸模型；优化问题；
This article presents a branch and bound algorithm for globally solving the sum of convex-convex ratios problem with nonconvex feasible region.
本文针对一类带有反凸约束的凸函数比式和问题提出了一种求其全局最优解的分支定界算法。
The optimization problem can be solved based on the density-stiffness interpolation scheme and the method of moving asymptotes belonging to sequential convex programming approaches.
采用基于密度刚度插值模型和序列凸规划法中的移动渐近线方法求解优化模型。 通过经典算例验证了本方法的有效性。
The key idea of SSVM is to transform the standard model of SVM into an unconstraint quadric convex programming problem.
SSVM模型的基本思想是将标准的支撑向量机模型转化成一个无约束二次凸规划模型进行求解。
Furthermore, a convex optimization problem with LMI constraints is formulated to design the optimal guaranteed cost controllers.
通过求解一个线性矩阵不等式约束的凸优化问题，提出了最优化保性能控制律的设计方法。
The paper describes how to deal with the modelling of DEM in surveying by using the convex shell problem in the calculation geometry. The method of building TIN is derived.
文章阐述了如何利用计算几何中的凸壳问题来处理测量中的DEM建模问题并推导出了TIN的建立方法。
The problem of resource allocation in this scheme is a non-convex non-linear optimization problem.
该模型中的资源分配问题是一个非凸的非线性优化问题。
This article mainly discussed the problem about the characterization of Uniformly convex 2-normed Spaces.
本文主要给出了刻画一致凸的2—范空间的特征。
On the conditions that vector objective function is like-convex and quasi-convex, we obtain the connectedness of G-proper efficient solution set of the multiobjective optimization problem.
在此基础上，得到了向量目标函数既是似凸又是拟凸的多目标最优化问题的G-恰当有效解集是连通的结论。
On the conditions that vector objective function is like-convex and quasi-convex, we obtain the connectedness of G-proper efficient solution set of the multiobjective optimization problem.
在此基础上，得到了向量目标函数既是似凸又是拟凸的多目标最优化问题的G-恰当有效解集是连通的结论。
应用推荐