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)

Related topics

Related topics

44 relations
2-satisfiabilityAMPLApproximation algorithmBetweenness

Broader (1)

Linear programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Genetic Algorithm Based Wireless Sensor Network Localization
In most sensor network applications, the information gathered by sensors will be meaningless without the location of the sensor… 
2008
2008
Localization Algorithm for Wireless Sensor Network Based on Genetic Simulated Annealing Algorithm
In most sensor network applications, the information gathered by sensors will be meaningless without the location of the sensor… 
2007
2007
Improving Connectivity via Relays Deployment in Wireless Sensor Networks
Enhancing the connectivity of wireless sensor networks is necessary to avoid the occurrence of coverage gaps. In this paper, we… 
Highly Cited
2005
Highly Cited
2005
Mathematics of Control , Signals , and Systems Semidefinite Lyapunov Functions Stability and Stabilization *
This paper gives some new stability sufficient conditions. It presents an extension of the classical Lyapunov theory by… 
2005
2005
Optimal design of nonuniform FIR transmultiplexer using semi-infinite programming
This correspondence considers an optimum nonuniform finite impulse response (FIR) transmultiplexer design problem subject to… 
2003
2003
Higher-order relaxations for robust LMI problems with verifications for exactness
  • C. Scherer
  • 42nd IEEE International Conference on Decision…
  • 2003
  • Corpus ID: 118031373
Robust semi-definite programming problems are know to have a wide range of applications, in particular in robust control. For… 
Highly Cited
2002
Highly Cited
2002
LMI tools for eventually periodic systems
Focuses on the concept of an eventually periodic linear discrete-time system. We derive a necessary and sufficient analysis… 
2000
2000
General Interior-Point Maps and Existence of Weighted Paths for Nonlinear Semidefinite Complementarity Problems
Extending the previous work of Monteiro and Pang (1998), this paper studies properties of fundamental maps that can be used to… 
Highly Cited
2000
Highly Cited
2000
Design of stable minimax IIR digital filters using semidefinite programming
  • Wu-Sheng Lu
  • IEEE International Symposium on Circuits and…
  • 2000
  • Corpus ID: 34582762
Semidefinite programming (SDP) has recently been found useful in designing various types of FIR digital filters. This paper… 
1991
1991
Uncertainty and Compliance of Robot Manipulators with Applications to Task Feasibility
The uncertainty and compliance of a robot manipulator used to perform a task are considered. A formula is derived for the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)