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 nonlinear-optimization
Search options not deleted
user 124703
Nonlinear objectives, nonlinear constraints, non-convex objective, non-convex feasible region.
3
votes
1
answer
84
views
Largest subset not spanning the span
Let $S=\{c_1,\dots,c_n\}$ be a set of vectors in $\mathbb{R}^M$. Is the below problem studied in literature?
$$\max\limits_{S'\subset S} \vert S' \vert $$
$$s.t. dim(span(S')) < dim(span(S))$$
which …
