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 non-convex-optimization
Search options not deleted
user 32507
1
vote
Hardness of concave minimization problem
If your problem has a solution $x^* \ne 0$, then $0$ is also a solution. Indeed, consider the function
$$\varphi(t) = c(t \, x^*) - k\cdot (t \, x^*).$$
Since $x^*$ is a solution, we have
$$\varphi(0) …
- 1,724