Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with quadratic-programming
Search options not deleted
user 9652
A quadratic program (QP) is an optimization problem in which the objective function is quadratic and the feasible region is a convex polytope.
4
votes
Accepted
Convex Decomposition of matrix
I guess, uniqueness depends on the rank of $X$.
I would also suggest to look at the reformulate with vectorization as
$$\newcommand{\vec}{\operatorname{vec}}
\|X-XC\|_F^2 = \|\vec(X) - (I\otimes X)\v …
- 12.7k
58
votes
Accepted
Why are optimization problems often called "programs"?
It may be that this question had been answered here before, but I couldn't find the answer.
Anyway, the answer is given by the person who coined the name itself: George Dantzig wrote in "LINEAR PROGR …
- 12.7k