Skip to search formSkip to main contentSkip to account menu

Semidefinite programming

Known as: Semi-definite programming, Semidefinite programs 
Semidefinite programming (SDP) is a subfield of convex optimization concerned with the optimization of a linear objective function (an objective… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
In this paper, we address the issues in the design of an intermediate matching kernel (IMK) for classification of sequential… 
2009
2009
The problem of gain-scheduled state feedback control for discrete-time linear systems with time-varying parameters is considered… 
2008
2008
In most sensor network applications, the information gathered by sensors will be meaningless without the location of the sensor… 
2007
2007
Enhancing the connectivity of wireless sensor networks is necessary to avoid the occurrence of coverage gaps. In this paper, we… 
2007
2007
Regularized Kernel Discriminant Analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick… 
2003
2003
  • M. MahmoudA. Ismail
  • 2003
  • Corpus ID: 44667892
The purpose of this paper is to provide a complete diagnostic profile of the role of delays in networked control systems (NCS… 
2002
2002
This paper proposes a new predictor-corrector interior-point method for a class of semidefinite programs, which numerically… 
2002
2002
Many theoretical and algorithmic results in semidefinite programming are based on the assumption that Slater's constraint… 
2001
2001
In the recent years, the telecommunication field has experie nced an explosion of services, with as various leading applications… 
2000
2000
Let A,B be n × n complex positive semidefinite matrices, and let f be a completely monotone function on $[0,\infty )$. We prove…