I'm trying so hard to understand SDP and how Schur's complement is used and what does it even mean? Is there a good and simple reference with some numerical examples that can answer my question especially that I'm not that great in linear algebra. I mean, what does Schur's complement even mean in words? I don't understand what does it do? Please help
2026-03-26 09:44:49.1774518289
Help with SDP and Schur's Complement
440 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in MATRICES
- How to prove the following equality with matrix norm?
- I don't understand this $\left(\left[T\right]^B_C\right)^{-1}=\left[T^{-1}\right]^C_B$
- Gradient of Cost Function To Find Matrix Factorization
- Particular commutator matrix is strictly lower triangular, or at least annihilates last base vector
- Inverse of a triangular-by-block $3 \times 3$ matrix
- Form square matrix out of a non square matrix to calculate determinant
- Extending a linear action to monomials of higher degree
- Eiegenspectrum on subtracting a diagonal matrix
- For a $G$ a finite subgroup of $\mathbb{GL}_2(\mathbb{R})$ of rank $3$, show that $f^2 = \textrm{Id}$ for all $f \in G$
- Distribution of min/max row sum of matrix with i.i.d. uniform random variables
Related Questions in OPTIMIZATION
- Optimization - If the sum of objective functions are similar, will sum of argmax's be similar
- optimization with strict inequality of variables
- Gradient of Cost Function To Find Matrix Factorization
- Calculation of distance of a point from a curve
- Find all local maxima and minima of $x^2+y^2$ subject to the constraint $x^2+2y=6$. Does $x^2+y^2$ have a global max/min on the same constraint?
- What does it mean to dualize a constraint in the context of Lagrangian relaxation?
- Modified conjugate gradient method to minimise quadratic functional restricted to positive solutions
- Building the model for a Linear Programming Problem
- Maximize the function
- Transform LMI problem into different SDP form
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 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)
Related Questions in SCHUR-COMPLEMENT
- Positive-definiteness of the Schur Complement
- Use Schur complement to show that $ 1^TD1 \ge 0$
- Is Schur complement better conditioned than the original matrix?
- Solving saddle-point matrix with projection when Schur's complement doesn't exist
- Positive semidefinite matrix using Schur Complement
- Boyd & Vandenberghe, example 3.4 — question on Schur complements and LMIs
- Searching an analogues for Schur complement
- matrix identity extends to real entries?
- Determinant of block matrix with singular blocks on the diagonal
- Graham's formula for determinant of distance matrix of a tree
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?
The Schur complement, in a nutshell, is about breaking down the condition that a big matrix is positive into the "simpler" condition that two smaller matrices are positive.
Here's an examination of the Schur complement in the context of quadric surfaces. Suppose we are given an equation of the form $$ \sum_{i,j=1}^3 a_{ij} x_i x_j = 1. $$ Without loss of generality, we suppose that $a_{ij} = a_{ji}$. We want to determine whether the surface described by this equation is an ellipsoid. As it turns out, this happens exactly when the matrix $A$ (with entries $a_{ij}$) is positive definite. Note that our equation can also be written in the form $x^TAx = 1$.
As a warm-up, let's consider the $2$-dimensional version of the problem. When does the equation $$ a_{11}x_1^2 + 2a_{12} x_1x_2 + a_{22}x_2^2 = 1 $$ describe an ellipse? As before, this occurs when the matrix $A$ is positive definite, but let's try to see why this is the case. By Sylvester's criterion, $A$ will be positive definite if and only if $a_{11} > 0$ and $a_{11}a_{12} - a_{12}^2 > 0$. With this in mind, consider the quadratic function $$ f(t) = a_{11} t^2 + 2a_{12}t + a_{22}. $$ The fact that $a_{11} > 0$ tells us that the graph of this function is an upward-opening parabola. The fact that $a_{11}a_{12} - a_{12}^2 > 0$ tells us that this quadratic function does not have a real root, since its discriminant is given by $$ b^2 - 4ac = 4(a_{12}^2 - a_{11}a_{22}) < 0. $$ So, if we complete the square to rewrite $f(t)$ in "vertex form", then we should find that $$ f(t) = a_{11}(t - h)^2 + k $$ for some $k > 0$. Now, note that our original equation can be written in the form $$ x_{2}^2 \cdot f(x_1/x_2) = 1. $$ With our rewritten quadratic, this is now the equation $$ a_{11}(x_1 - hx_2)^2 + k x_2^2 = 1. $$ In other words, the positive definiteness of $A$ is important because it ensures that $x^TAx$ is a sum of squares.
Another way to think about the new equation is as follows. We made a substitution $$ \pmatrix{y_1\\y_2} = \pmatrix{1 & -h\\0 & 1} \pmatrix{x_1 \\ x_2} $$ such that the new equation was of the form $$ b_{11} y_1^2 + b_{22}y_2^2 $$ for some positive $b_{11},b_{22}$. To put this another way, we found that $$ P = \pmatrix{1 & -h\\0 & 1} \implies P^TAP = \pmatrix{b_{11} & 0\\0 & b_{22}}. $$
Now, is there some way that we can use our result for $2$-D space for $3$-D space? One idea is to make a substitution that gets us "halfway there". That is, perhaps we can find a $3 \times 3$ invertible matrix $P$ such that the substitution $$ \pmatrix{y_1\\y_2\\y_3} = P \pmatrix{x_1\\x_2\\x_3} $$ yields an equation of the form $$ b_{11}y_1^2 + (b_{22}y_2^2 + 2b_{23}y_2y_3 + b_{33}y_3^2) = 1. $$ From there, all we'd need to do is apply our approach from last time on the expression $b_{22}y_2^2 + 2b_{23}y_2y_3 + b_{33}y_3^2$. This is exactly what the Schur complement does for us! Partition $A$ into the matrices $$ A = \pmatrix{a_{11} & v\\ v^T & M}. $$
We know that there exists an invertible matrix $P$ such that $$ PAP^T = \pmatrix{a_{11} & 0\\0 & M - a_{11}^{-1} vv^T} = \pmatrix{b_{11} & 0 & 0\\0 & b_{22} & b_{23}\\0 & b_{23} & b_{33}}. $$ Correspondingly, making the substitution $y = Px$ leads to an equation in the form that we wanted, and now all that's left to do is check if $a_{11}$ is positive and the $2 \times 2$ matrix $\pmatrix{b_{22} & b_{23}\\ b_{23} & b_{33}}$ is positive definite.