In many optimization resources, when we reformulate an LP to an SDP, we sometimes use the fact that \begin{equation*} x^{T}Ax = Tr(AX), \end{equation*} where $X=xx^T$ is a number. But when I tried to derive the equation, I can't get the desired result. Namely, \begin{equation*} x^{T}Ax = \sum_{j=1}^{n}\sum_{i=1}^{n}a_{i,j}x_ix_j, \end{equation*} and \begin{equation*} Tr(AX) = (a_{1,1}+...+a_{n,n})(x_1^2+...+x_n^2). \end{equation*} The two polynomials are clearly different: simply, $a_{1,1}x_2^2$ is a term in the second polynomial but not in the first one. Please point out where I missed, thanks!
2026-03-25 12:46:19.1774442779
eddy3
On
Why $x^TAx=\text{Tr}(AX)$?
221 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
2
There are 2 best solutions below
0
eddy3
On
The two parts are that a one by one matrix is its own trace, so that $x^T Ax= \operatorname{trace} x^TAx .$ Next $ \operatorname{trace} EF = \operatorname{trace} FE $ when multiplication is defined in both orders. Finally, this does not give arbitrary orders with three terms, just cyclic, so that $$ \operatorname{trace} EFG = \operatorname{trace} FGE = \operatorname{trace} GEF $$ so that $$ \operatorname{trace} x^T A x = \operatorname{trace} A x x^T = \operatorname{trace} x x^T A $$
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$
- Powers of a simple matrix and Catalan numbers
- 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$
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 QUADRATIC-PROGRAMMING
- Minimization of a convex quadratic form
- Using a Lagrange multiplier to handle an inequality constraint
- Given matrix $Q$ and vector $s$, find a vector $w$ that minimizes $\| Qw-s \|^2$
- Linear Matrix Least Squares with Linear Equality Constraint - Minimize $ {\left\| A - B \right\|}_{F}^{2} $ Subject to $ B x = v $
- Closed form solution to this constrained optimization?
- Bound on the solution of a constrained least squares problem
- Minimisation of a scalar function with respect to a vector
- How to reformulate an objective function with absolute
- Generalized Projection of a Matrix onto the Non Negative Orthant
- Optimize quadratic non-convex function with project gradient descent
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 RELAXATIONS
- What does it mean to dualize a constraint in the context of Lagrangian relaxation?
- LP relaxation of the symmetric TSP problem integrality for n=5
- Semidefinite relaxation for QCQP with nonconvex "homogeneous" constraints
- Upper AND lower bound for the linear relaxation
- Upper bound for spectral radius of matrix multiplications
- $n$-sphere enclosing the Birkhoff polytope
- Non-convex objective function + (non-convex constraint function vs. convex constraint function)
- Solving linear systems of equations consists of block-diagonal part + small sparse part
- Solving PDEs by adding small perturbation terms and taking limits
- Semidefinite relaxation
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?
You've confused $xx^T$ with $x^Tx$, or else you've assumed $x$ is a row vector instead of a column vector. Either way, $A$ is being multiplied with a square matrix of the same shape. So the proof is $x_iA_{ij}x_j=A_{ij}x_jx_i=A_{ij}X_{ji}$.