Timeline for Optimization over symmetric polynomials
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 5, 2015 at 16:48 | comment | added | Anindya De | Well, yes, if we knew that there is a solution with only k non-zero entries, then this problem could be easily solved in time k^k. Unfortunately, I guess the best guarantee we do know is that the entries of (x_1, ... , x_n) come from a set of size at most k. | |
| Mar 5, 2015 at 5:54 | comment | added | Turbo | Obviously intersection of $f_j(x_1,…,x_n)−α_j−η=0$ will have a solution in $(x_1,\dots,x_k,0,\dots,0)$. However this may lie elsewhere outside $[0,1]^n$. | |
| Mar 5, 2015 at 4:27 | comment | added | Turbo | In a sense you are looking at intersection of $k$ varieties of polynomials $f_j(x_1,\dots,x_n)-\alpha_j-\eta=0$ where $\eta\in(-\epsilon,\epsilon)$ with cube $[0,1]^n$? | |
| Mar 5, 2015 at 4:20 | comment | added | Turbo | So you are looking for numbers whose norms are bound? Did you try simplest case $\alpha_j=\alpha$? | |
| Mar 4, 2015 at 20:32 | comment | added | user6818 | @Anindya De Can you give some context to this question? Like any paper that motivated you to ask this? | |
| Mar 4, 2015 at 3:47 | comment | added | usul | cross-posted: cstheory.stackexchange.com/questions/30678/… | |
| Mar 4, 2015 at 3:30 | history | edited | Anindya De | CC BY-SA 3.0 |
added 16 characters in body; edited title
|
| Mar 4, 2015 at 3:19 | vote | accept | Anindya De | ||
| Mar 4, 2015 at 3:30 | |||||
| Mar 4, 2015 at 0:16 | answer | added | Dima Pasechnik | timeline score: 3 | |
| Mar 3, 2015 at 22:59 | history | asked | Anindya De | CC BY-SA 3.0 |