A quadratic program (QP) is an optimization problem in which the objective function is quadratic and the feasible region is a convex polytope.

41 questions
Filter by
Sorted by
Tagged with
107 views

Does the Perron vector maximize $x^TAx$ in the simplex?

Let $\mathbf{A}$ be any $n\times n$ symmetric positive matrix ($A_{ij}>0$). It is easy to show that the solution to the following optimization problem \begin{align} \max_{\mathbf{x}}~~\mathbf{x^...
108 views

Symmetric linear least-squares solution

Given tall matrices $A$ and $Y$ and the following overdetermined linear system in square matrix $X$ $$AX=Y$$ is there an explicit formula for the least-squares solution if $X$ is constrained to be ...
83 views

KKT conditions for min-cost flow QP [closed]

I'm working on a convex quadratic separable min-cost flow problem with the following structure: $P = \{\min \frac{1}{2}x^tQx + qx : Ex = b, 0 \leq x \leq u\}$ But I'm stuck on deriving the KKT ...
56 views

Mixed integer formulation of union of polytopes?

Given $t$ different unbounded polyhedra $P_1:A^{(1)}x^{(1)}\leq b^{(1)},\dots,P_t:A^{(t)}x^{(t)}\leq b^{(t)}$ we are looking for the representation of $\bigcup_{i=1}^tP_i$ (not their convex hull) with ...
72 views