搜索结果: 1-15 共查到“the semidefinite programming”相关记录28条 . 查询时间(0.062 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars:A Squared Smoothing Newton Method for Semidefinite Programming
半定规划 平方平滑 牛顿方法
2023/4/14
Optimal excitation signal design for frequency domain system identification using semidefinite programming
The optimal excitation signal and the dispersion function semidefinite programming linear matrix inequality (lmi)
2015/8/11
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...
Semidefinite programming
Semidefinite programming linear function affine combination symmetric positive semidefinite matrix nonlinear not smooth
2015/8/11
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...
Semidefinite programming relaxations of non-convex problems in control and combinatorial optimization
Applications of semidefinite programming combinatorial optimization quadratic semi-definite programming bilinear matrix inequality
2015/8/11
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...
Connections between semi-infinite and semidefinite programming
Optimization semi-infinite programming applications systems controls signal processing computational geometry and statistics
2015/8/11
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...
Applications of semidefinite programming
Nonlinear convex programming linear matrix inequality the semidefinite programming linear function linear matrix inequality the control theory integrated circuit design
2015/8/11
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...
Designing fast distributed iterations via semidefinite programming
Iteration markov chain the transition probability mixing ratio the monte carlo markov chain
2015/8/11
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...
Generalized Chebyshev bounds via semidefinite programming
Quadratic inequality convex optimization computation single variable and random variable chebyshev inequality
2015/8/10
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...
Further relaxations of the semidefinite programming approach to sensor network localization
Semidefinite programming sensor networks positioning sensors
2015/8/10
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...
A semidefinite programming method for integer convex quadratic minimization
The quadratic function the probability of integer zinc, values
2015/8/7
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 ...
Optimal Excitation Signal Design for Frequency Domain System Identification Using Semidefinite Programming
Optimal Excitation Signal Design Frequency Domain System Identification Semidefinite Programming
2015/7/13
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...
Semidefinite Programming
semidefinite programming convex optimization interior-point methods eigenvalue optimization
2015/7/13
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...
Semidefinite Programming Relaxations of Non-Convex Problems in Control and Combinatorial Optimization
Semidefinite Programming Relaxations Non-Convex Problems Control Combinatorial Optimization
2015/7/13
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...
Connections Between Semi-Infinite and Semidefinite Programming
Connections Between Semi-Infinite Semidefinite Programming
2015/7/10
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...