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 convex-optimization
Search options not deleted
user 158537
Optimization with convex constraints and convex objectives; notions related to convex optimization such as sub-gradients, normal cones, separating hyperplanes
1
vote
1
answer
206
views
Has the following generalization of monotropic programming been studied in the literature?
I am interested in problems of the form
$$\min_{x \in C} \sum_{i=1}^n\sum_{j=1}^n f(x_i,x_j)$$
where $C$ is a convex subset of $\mathbb{R}^{n}$, and $f \colon \mathbb{R}^{2} \to \mathbb{R}$ is convex. …
- 13
0
votes
1
answer
506
views
When is a convex function continuous on its domain?
Consider a lower-semicontinuous convex function $f\colon \mathbb{R}^n \to \mathbb{R}$ with domain $C = \{x \in \mathbb{R}^d: f(x) < \infty\}$. I am interested in understanding under what conditions $f …
- 13