Semidefinite programming seems to be a very powerful tool to approach NP-hard optimisation problems, for example in discrete optimisation and there are some very interesting results (like the max cut approximation). What is know on the limitations of such approaches?
2026-03-24 21:59:49.1774389589
Limitations of SDP
182 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in CONVEX-OPTIMIZATION
- Optimization - If the sum of objective functions are similar, will sum of argmax's be similar
- Least Absolute Deviation (LAD) Line Fitting / Regression
- Check if $\phi$ is convex
- Transform LMI problem into different SDP form
- Can a linear matrix inequality constraint transform to second-order cone constraint(s)?
- Optimality conditions - necessary vs sufficient
- Minimization of a convex quadratic form
- Prove that the objective function of K-means is non convex
- How to solve a linear program without any given data?
- Distance between a point $x \in \mathbb R^2$ and $x_1^2+x_2^2 \le 4$
Related Questions in DISCRETE-OPTIMIZATION
- Optimization - If the sum of objective functions are similar, will sum of argmax's be similar
- Simultaneously multiple copies of each of a set of substrings of a string.
- Do these special substring sets form a matroid?
- What does it mean to dualize a constraint in the context of Lagrangian relaxation?
- How to solve this binary optimization problem?
- What exactly the Ellipsoid method does?
- Give the cutting-plane proof of $\sum\limits_{i,j = 1}^4 x_{ij} \leq 9$.
- Relation with the perfect partition problem and the single machine task schedule problem
- What is the name of following optimization problem and algorithms to solve them
- Integrality gap of maximum weighted clique
Related Questions in SEMIDEFINITE-PROGRAMMING
- Transform LMI problem into different SDP form
- Can every semidefinite program be solved in polynomial time?
- In semidefinite programming we don't have a full dimensional convex set to use ellipsoid method
- Transforming a nearest matrix optimization problem to a standard form
- Proving that a particular set is full dimensional.
- Finding bounds for a subset of the positive semidefinite cone
- SOCP to SDP — geometry and intuition
- Why is the feasible set of solutions to an SDP a spectrahedron?
- Conversion of convex QCQP to standard form SDP
- Dual of semidefinite program (SDP)
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
First, finding the relaxation is the first challenge. It is not always straightforward to find an SDP relaxation.
Second, Although you can solve the SDP relaxation exactly, establishing a guarantee that the solution to SDP relaxation has any relation to the solution of your NP-hard problem is extremely challenging. This has been done beautifully for maxcut, but for many problems, there is no guarantees. For instance, to the best of my knowledge, SDP relaxation for sensor selection does not have a guarantee for sensor selection problem: https://web.stanford.edu/~boyd/papers/pdf/sensor_selection.pdf. Another example is the positive principal component analysis problem where you can easily write the SDP, but so far there is no guarantee (see section 9.13 in https://cims.nyu.edu/~bandeira/TenLecturesFortyTwoProblems.pdf).
Third, for combinatorial problems such as maxcut and sensor selection, SDP relaxation produces a continuous solution and finding a good rounding procedure with provable guarantees is a difficult task. Again, this has been done very beautifully for maxcut.
Lastly, solving SDP exactly in many large-scale problems is extremely inefficient and you end up solving it approximately.