semidefinite
英
美
网络 半正定; 半定的
双语例句
- Then a is positive semidefinite, negative definite and negative semidefinite.
则a是半正定，负定，半负定的。 - A filter algorithm based on decomposed search step for semidefinite programming
半定规划问题基于方向分解的筛选算法 - Under the cases that the objective function is positive definite or positive semidefinite, the necessary and sufficient conditions to characterize global optimal solution are obtained.
假定约束是可行、规范的，对于目标函数为正定或半正定的情形，得到了全局最优解的充要条件。 - A tight semidefinite relaxation of the quadratically constrained quadratic-11 optimization problem is obtained, which improves several previous SDP relaxations in the literature. Application of Dynamic Programming and Integer Programming in Emergency Materials Distribution Optimization
提出了{-1，1}二次约束二次整数规划的强化半定规划松弛模型。动态规划和整数规划在应急物流物资配送优化中的应用研究 - Methods Exploiting some characterizations of the central path and the NCP function, a smoothing-type method for the solution of semidefinite programs are derived.
方法应用中心路径的性质及NCP函数，构造了求解半定规划的光滑化方法。 - The novelty of the approach lies in the application of semidefinite programming for recovering the camera focal lengths and the principal point.
提出一种新的视频监控摄像机自标定算法，它利用半正定规划来恢复摄像机的焦距和主点。 - CPC Algorithm for Semidefinite Monotone Variational Inequalities
半正定单调变分不等式的CPC算法 - In this paper, SAT problem is solved by linear semidefinite programming algorithm.
将线性半定规划应用到SAT问题的求解过程中。 - A Regularization Method and Its Convergence of Large-scale Semidefinite Programming
大规模半定规划问题的正则化方法及收敛性 - A Class of Nonlinear Lagrange Methods for Solving Nonconvex Semidefinite Programming
求解非凸半定规划的一类非线性Lagrange方法 - A New Primal-dual Interior-point Algorithm for Semidefinite Optimization
一个求解半正定规划问题的新原始-对偶内点算法 - Connections Between Euclidian Distance Matrix and Positive Semidefinite Matrix Euclid was not always right.
欧几里得距离矩阵与半正定矩阵的关系欧几里德不一定全对。 - Linear Semidefinite Programming Algorithm for SAT Problem
求解SAT问题的线性半定规划算法 - A smoothing-type method for solving semidefinite programs
求解半定规划问题的一种光滑化方法 - Under the framework of semidefinite programming, an primal dual interior point algorithms for logarithmic Chebychev approximation problem is constructed.
介绍了半定规划的一般模型、最优性条件及求解半定规划问题的原始对偶势下降内点算法。 - Semidefinite Programming Relaxation Method for Sensor Network Localization
求解无线传感器网络定位的半定规划松驰法 - This paper is concerned with the problem of real symmetric positive semidefinite matrix pencil under spectral restriction.
本文讨论谱约束下实对称半正定矩阵束的最佳逼近问题，指出一般算法。 - An Optimization Model for Two-echelon Distribution Network Design in Supply Chain Based on Bi-level Programming; 1. A tight semidefinite relaxation of the quadratically constrained quadratic-11 optimization problem is obtained, which improves several previous SDP relaxations in the literature.
基于双层规划的供应链二级分销网络优化设计模型1.提出了{-1，1}二次约束二次整数规划的强化半定规划松弛模型。 - Finally, optimality necessary and sufficient conditions for nonlinear convex semidefinite programming are proved.
并给出了非线性半定规划的最优性必要和充分条件。 - On Partial Ordering of Pseudo-Schur Complement for Positive Semidefinite Block Matrices
半正定分块矩阵的块Pseudo-Schur补的偏序 - Second, an unconditional Haynsworth matrix inequality for positive semidefinite Hermitian matrix is presented.
然后给出一个无约束条件的Haynsworth矩阵不等式的在半正定Hermitian矩阵的推广形式。 - A low-rank decomposition technique is adopted to transform the standard semidefinite programming into an equivalent nonlinear programming problem.
首先采用低秩分解技术将一般的半定规划问题转化为与其等价的非线性规划问题； - A semidefinite relaxation is attained from the equivalence form for the Vertex Cover Problem in a normal way.
对顶点覆盖问题的一种等价模型，利用一般的松弛方法，得到了一个半定规划松弛模型。 - In this paper, we study several algorithms for Semidefinite Programming.
本文对半定规划的若干算法进行了研究。 - The paper studied the multiobjective semidefinite programming with a semidefinite constraint of a matrix function and a multiobjective function.
主要研究含矩阵函数半定约束和向量函数等式约束以及多个目标函数的多目标半定规划的对偶和鞍点问题。 - Lagrange Function and Duality for Multiobjective Semidefinite Programming
多目标半定规划的Lagrange函数和Lagrange对偶 - We present a globally convergent interior point algorithm for solving nonlinear semidefinite programming with inequality constraint.
本文提出一个全局收敛的求解不等式约束非线性半定规划的内点算法。 - In recent years, considerable attention has been devoted to the study of polynomial systems in numerical approach, especially using semidefinite programming and the sum of squares decomposition, which provide an efficient way for researchers to explore polynomial systems.
近年来，通过数值计算方法对多项式系统的进行研究得到了人们广泛的关注，尤其是半定规划和平方和分解方法，为学者研究多项式系统提供了有效的方法。 - Many machine learning tasks ( e.g. metric and manifold learning problems) can be formulated as convex semidefinite programs.
很多的机器学习任务（如度量学习和流型学习）都可以归约为凸半正定规划问题。 - Most interior-point methods for linear programming have been generalized to linear semidefinite programming.
半定规划的内点算法正是线性规划内点算法的推广。