>>> 哲学 经济学 法学 教育学 文学 历史学 理学 工学 农学 医学 军事学 管理学 旅游学 文化学 特色库
搜索结果: 1-15 共查到Semidefinite Programming相关记录28条 . 查询时间(0.064 秒)
This paper proposes a squared smoothing Newton method via the Huber smoothing function for solving semidefinite programming problems (SDPs). We first study the fundamental properties of the matrix-val...
The paper discusses two methods of optimal excitation signal design for identification with Maximum Likelihood parameter estimation: The ‘classical’, dispersion function based method, and a new, semid...
In semidefinite programming we minimize a linear function subject to the constraint that an affine combination of symmetric matrices is positive semidefinite. Such a constraint is nonlinear and nonsmo...
We point out some connections between applications of semidefinite programming in control and in combinatorial optimization. In both fields semidefinite programs arise as convex relaxations of NP-hard...
Some interesting semi-infinite optimization problems can be reduced to semidefinite optimization problems, and hence solved efficiently using recent interior-point methods. In this paper we discuss se...
A wide variety of nonlinear convex optimization problems can be cast as problems involving linear matrix inequalities (LMIs), and hence efficiently solved using recently developed interior-point metho...
The general setting we consider involves a process, iteration, or method in which the computation or communication at each step is local, determined by a given graph, and involves some parameters or c...
A sharp lower bound on the probability of a set defined by quadratic inequalities, given the first two moments of the distribution, can be efficiently computed using convex optimization. This result g...
Recently, a semidefinite programming (SDP) relaxation approach has been proposed to solve the sensor network localization problem. Although it achieves high accuracy in estimating the sensor locations...
We consider the NP-hard problem of minimizing a convex quadratic function over the integer lattice Zn. We present a semidefinite programming (SDP) method for obtaining a nontrivial lower bound on the ...
The paper discusses two methods of optimal excitation signal design for identification with Maximum Likelihood parameter estimation: The ‘classical’, dispersion function based method, and a new, semid...
In semidefinite programming we minimize a linear function subject to the constraint that an affine combination of symmetric matrices is positive semidefinite. Such a constraint is nonlinear and nonsmo...
We point out some connections between applications of semidefinite programming in control and in combinatorial optimization. In both fields semidefinite programs arise as convex relaxations of NP-hard...
Some interesting semi-infinite optimization problems can be reduced to semidefinite optimization problems, and hence solved efficiently using recent interior-point methods. In this paper we discuss se...
A wide variety of nonlinear convex optimization problems can be cast as problems involving linear matrix inequalities (LMIs), and hence efficiently solved using recently developed interior-point metho...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...