FAQ

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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1970-2017
010020030019702017

Related topics

Related topics

41 relations
2-satisfiabilityAMPLApproximation algorithmBetweenness
(More)

Broader (1)

Linear programming

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Semidefinite programming
Mathematical optimization
Approximation algorithm
Linear programming
Dimensionality reduction
Linear matrix inequality

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
Theory of semidefinite programming for sensor network localization
We analyze the semidefinite programming (SDP) based model and method for the position estimation problem in sensor network… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Unsupervised Learning of Image Manifolds by Semidefinite Programming
Can we detect low dimensional structure in high dimensional data sets of images? In this paper, we propose an algorithm for… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Semidefinite programming relaxations for semialgebraic problems
A hierarchy of convex relaxations for semialgebraic problems is introduced. For questions reducible to a finite number of… (More)
  • figure 7.1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
A Spectral Bundle Method for Semidefinite Programming
A central drawback of primal-dual interior point methods for semidefinite programs is their lack of ability to exploit problem… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Optimization
In the first part of this thesis, we introduce a specific class of Linear Matrix Inequalities (LMI) whose optimal solution can be… (More)
  • figure 3.1
  • table 3.1
  • figure 3.2
  • table 3.2
  • figure 3.3
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Semidefinite programming in combinatorial optimization
We discuss the use of semidefinite programming for combinatorial optimization problems. The main topics covered include (i) the… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Robust Truss Topology Design via Semidefinite Programming
We present and motivate a new model of the truss topology design problem, where the rigidity of the resulting truss with respect… (More)
  • figure 2.1
  • figure 2.2
  • figure 7.1
  • table 7.1
  • figure 7.2
Is this relevant?
Highly Cited
1996
Highly Cited
1996
An Interior-Point Method for Semidefinite Programming
We propose a new interior point based method to minimize a linear function of a matrix variable subject to linear equality and… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiability (MAX 2SAT) problems… (More)
  • figure 1
  • figure 2
  • table I
  • table II
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Approximate Graph Coloring by Semidefinite Programming
We consider the problem of coloring <italic>k</italic>-colorable graphs with the fewest possible colors. We present a randomized… (More)
Is this relevant?