I hope to find a second-order conic (SOC) relaxation for $z = xy$, but it seems very hard.
2026-02-23 01:39:50.1771810790
Is there a second-order conic relaxation method for the bilinear term $z=xy$?
345 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
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 NON-CONVEX-OPTIMIZATION
- Find largest possible value of $x^2+y^2$ given that $x^2+y^2=2x-2y+2$
- Interesting Global Minimum of a Non-convex Function
- Minimize $x^T A y$, subject to $ x^Ty\geq 0$, where $A=\Phi^T\Phi$ is symmtric and semi-positive definite.
- How should I proceed to solve the below mentioned non-convex optimisation problem?
- Optimization of the sum of a convex and a non-convex function?
- Solution of a semidefinite program with rank at most $k$
- Trace maximization with semi-orthogonal constraint
- Literature on optimizing linear objectives over non-convex sets
- Convex Hull of the Union of Subgradients
- Find matrices $X$ such that the diagonal of $X^H X$ is sparse
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
Related Questions in SECOND-ORDER-CONE-PROGRAMMING
- Different forms of primal-dual second-order cone programs
- SOCP to SDP — geometry and intuition
- DCP constraint version of $a^2 + b^2 \leq c^2$
- SOCP Complementary Slackness Condition Confusion
- How to convert $z^2 = \theta y^2$ to second order cone constraint?
- Dual of a Second Order Cone Program (SOCP)
- What is the geometric representation of a mixed integer second order cone program?
- Formulate $\min \dfrac{\|Ax-b\|^2_1}{1-\|x\|_\infty}$ as a SOCP
- Can this problem be represented as a second-order cone program?
- Cone reformulation
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 3x3 moment matrix is $\begin{pmatrix} 1 & x & y\\x & x^2 & xy\\y & xy & y^2\end{pmatrix}$ which is psd and rank-1. Introduce relaxation variables and your semidefinite relaxation is $\begin{pmatrix} 1 & x & y\\x & X_{20} & X_{11}\\y & X_{11} & X_{02}\end{pmatrix}\succeq 0$ (with $z$ thus being $X_{11}$). For this to be psd, all minors have to be psd, so a necessary condition is (i.e. relaxation)
$$\begin{pmatrix} 1 & x\\x & X_{20}\end{pmatrix}\succeq 0,\begin{pmatrix} 1 & y\\y & X_{02}\end{pmatrix}\succeq 0, \begin{pmatrix} X_{20} & X_{11}\\X_{11} & X_{02}\end{pmatrix}\succeq 0$$
A 2x2 semidefinite constraint $\begin{pmatrix} a &b\\b & c\end{pmatrix}\succeq 0$ can be represented with an SOCP by looking at the minors and after an SOCP representation of the quadratic constraint you have $\left|\left|\begin{matrix}2b\\a-c\end{matrix}\right|\right|\leq a + c, a\geq 0, c\geq 0$