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 9022
For questions involving the concept of convexity
5
votes
Characterising semi-definite positiveness on vectors with non-negative entries
Your cone $C$ is the cone of copositive matrices. The dual of C is the cone of compeltely positive matrices. See e.g.
http://mathworld.wolfram.com/CopositiveMatrix.html
- 3,934
6
votes
Computational complexity of unconstrained convex optimisation
Some books to start with for background reading would include:
Y. Nesterov, Introductory Lectures on Convex Optimization: A Basic Course, Springer, 2003.
Y. Nesterov and A. Nemirovsky, Interior Poin …
- 3,934
2
votes
Spline fit with bounded derivations
See section 6.5.2 of the book "Convex Optimization" by Stephen Boyd and Lieven Vandenberghe. It's available on the web as a pdf file or as a quite reasonably priced printed book from Cambridge Univer …
- 3,934
3
votes
a different algebra/representation for convex sets
These kinds of feasible sets can often be written in terms of second order cone programming and/or semidefinite programming constraints. If that's the case, then optimizing over the feasible set is r …
- 3,934