Skip to main content

All Questions

7 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
2 votes
0 answers
178 views

Can we get the exact solution of large-scale quadratic programming problems (quadratic objective, linear inequality constraints) using KKT condition?

Crossposted at Computational Science SE Consider a quadratic programming problem with the following format: $$ \text{min} Q(x) = c^Tx+\frac{1}{2}x^TDx \\ $$ $$ \text{s.t.} Ax\leq b, \\ x\geq 0 $$ ...
ximeng fan's user avatar
2 votes
0 answers
159 views

Complexity of Quadratic Programming where the symmetric matrix Q is positive semidefinite only in the feasible directions

playing around with stuff for my dissertation, I derived a quadratic problem in the general form \begin{equation} \begin{aligned} \min_{x} \quad & x^TQx + c^Tx \\ \textrm{s.t.} \quad & Ax \leq ...
Emanuel's user avatar
  • 21
2 votes
1 answer
307 views

Positivity of quadratic form minus linear form on the simplex

Let $a_{ij}$ be the elements of a $n$-dimensional covariance matrix. Can we prove the following? $$ 1-\sum_{k=1}^n a_{ik} \lambda_k + \sum_{j=1}^n \sum_{k=1}^n \lambda_j a_{jk} \lambda_k > 0, \...
J M Grandola's user avatar
2 votes
0 answers
156 views

Optimization of quadratic form with band matrices

Let $A_1$ be the $N \times N$-matrix for which $a_{i,j} = 1$ for $i=j$ and 0 otherwise. Let $A_2$ be the matrix for which $a_{i,j}=1$ for $|i-j| \leq 1$ and 0 otherwise. Similarly define $A_3$ (which ...
Kurisuto Asutora's user avatar
1 vote
0 answers
99 views

Finding a point on a convex set

Given a compact bounded convex set $\mathcal C\subseteq\mathbb R^n$ given by $t$ hyperplane inequalities I want to find a point $u\in\mathcal C$ such that for all $v\in\mathcal C$ a convex relation $...
VS.'s user avatar
  • 1,826
1 vote
0 answers
88 views

On convex quadratic programming clarification

We know convex quadratic programming is in $P$. Is it also in $P$ if the function of interest is only convex in the domain of interest?
Turbo's user avatar
  • 13.9k
1 vote
0 answers
52 views

Which algorithm is most efficient for a specific QP problem

I have a QP problem of the following kind: $\min_{\alpha\in\mathbb{R}^n}\frac{1}{2}\alpha^T M \alpha - p^T\alpha$ s.t. $l\leq \alpha \leq u$ The matrix $M$ is symmetric and positive definite and of ...
kingnothing's user avatar