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 nonconvex-programming
Search options not deleted
user 134
For questions about non-convex optimization problems where the objective or any of the constraints are non-convex.
5
votes
Convex vs Strictly Quasiconvex Functions in Optimization
My claim is that everything that can be formulated as a conic optimization problem using
Linear cones
Quadratic cones
Power cones
Exponential cones
Semi definite cone (with some qualifications)
ca …
- 3,216
15
votes
Accepted
Convexity of Variance Minimization
It holds
$$
\begin{array}{rcl}
\operatorname V(x) &= &\dfrac1N\left\| x-\dfrac{e^\top x}{N} e \right\|^2 \\
& = & \dfrac1N\left(x^\top x+\dfrac{(e^\top x)^2 e^\top e}{N^2}-2\dfrac{(e^\top x)^2}N\ …
- 3,216