您要查找的是不是:
- An on-line training algorithm is presented to avoid repetitious solving the convex programming problem. 并给出一种?着调整时的在线训练算法,避免重复求解凸规划问题。
- The key idea of SSVM is to transform the standard model of SVM into an unconstraint quadric convex programming problem. SSVM模型的基本思想是将标准的支撑向量机模型转化成一个无约束二次凸规划模型进行求解。
- A bilevel convex progamming that is equivalent to the minimum risk bilevel programing is given,An approximate decomposition algorithm for solving this bilevel convex programming problem is proposed. 给出了具有极小风险解的二层规划的等价二层规划,并提出了求解这类二层凸规划的一个近似分解算法。
- reverse convex programming problem 反凸规划
- A Potential Reduction and Infeasible Inner-point Algorithm for A Linear Convex Programming Problem 线性凸规划问题的一个势降不可行内点算法
- convex programming problem 凸规划问题
- With salient to present convex polytope,the distance between the the convex objects is came down to a non-linear programming problem with a restricted condition. 提出用顶点的凸包来表示凸多面体,将两凸物体间距离的问题归结为一个带约束条件的非线性规划问题。
- We proposed a mean variance portfolio selection model with the restricted short sales.The model was a convex quadric programming problem and was solved by the pivoting algorithm. 摘要本文提出了限制性卖空的均值-方差投资组合模型,通过变量替换将该模型转变为一般二次规划问题,从而运用不等式组的旋转算法进行求解。
- 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. 采用基于密度刚度插值模型和序列凸规划法中的移动渐近线方法求解优化模型,通过经典算例验证了本方法的有效性。
- This model is formulated as a bilevel programming problem. 此模型公式化为一双水平规划问题。
- The solution is a uniquely solvable convex program which computes correspondence simultaneously for all images . 这是一个计算所有图像相关性的,唯一的,可解的凸规划问题。
- For a class of nonlinear bi-level programming whose follower-level problems are differentiable convex programming, a novel algorithm is proposed. 摘要针对下层为可微凸规划的非线性双层规划,提出了一种新算法。
- This paper considers the nonlinear programming problem of interval parameters. 摘要讨论了区间参数非线性规划问题。
- A perturbed problem for semidefinite programming problem was constructed. 摘要构造半定规划的一个扰动问题。
- In this paper, linear bilevel programming problem (LBP) is considered. 摘要关于线性二层规划的求解问题。
- Abstract: This paper presents a new primal?dual interior point algorithm for a convex programming with box constraints, and prove the iteration complexity is polynomial. 文摘:本文为框式约束的一类凸规划提出了一个新的内点算法,原始-对偶路径跟踪法,并证明了算法的迭代复杂性为多项式时间性.
- Moreover, an approach is obtainedtodesigncontrollervia convex programming algorithm such that the closed loop system is ESPR and has maximum perturbation bound under the method. 通过凸优化算法,得到了所提出方法意义下具有最大摄动界的ESPR控制器设计方法。
- This paper concerns nonsmooth semidefinite programming problems. 摘要首次考虑了非光滑半定规化问题。
- If you think of a programming problem as terrain that you have to traverse, a design pattern is at best a partial map. 如果您将编程问题想象成一个必须穿过的地区,那么设计模式最多只是一张局部地图。
- In this paper, we focus on bilevel programming problem with a common decision variable in the upper level and lower level programming. 摘要主要讨论上下层具有共同决策变量的一类二层规划问题的求解方法。