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 convexity
Search options not deleted
user 5963
For questions involving the concept of convexity
22
votes
Is all non-convex optimization heuristic?
I think you will be interested in the work of Parrilo, Lasserre, Putinar, Sturmfels, Nie, Helton, etc., on sums-of-squares and moment methods for polynomial optimization. They look at principled ways …
- 8,501
10
votes
Accepted
Characterising semi-definite positiveness on vectors with non-negative entries
The cone $C$ is called the cone of copositive matrices and its dual $C^*$ is called the cone of completely positive matrices. Here are some references.
The paper most relevant to your question is pr …
- 8,501
4
votes
a different algebra/representation for convex sets
Of course it's hard to say without any information, but linear matrix inequalities may be what you're looking for. They are to semidefinite programs what linear inequalities are to linear programs. …
- 8,501