Timeline for Convex optimization problem to QPP
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 9, 2012 at 14:18 | history | edited | Artem Pianykh | CC BY-SA 3.0 |
added 125 characters in body
|
| Dec 9, 2012 at 4:49 | answer | added | fedja | timeline score: 1 | |
| Dec 8, 2012 at 16:43 | history | edited | Artem Pianykh | CC BY-SA 3.0 |
added 55 characters in body
|
| Dec 8, 2012 at 16:38 | comment | added | Artem Pianykh | @fedja all $a_i$ is positive; n can be huge comparing to size of vector $\hat x$, e.g. size($x$) = s, then n is around $c p^s$, where c p is some positive constants. | |
| Dec 8, 2012 at 15:17 | comment | added | fedja | Also, how big is $n$? | |
| Dec 8, 2012 at 15:16 | comment | added | fedja | In the new version, are all $a_i$ positive? | |
| Dec 8, 2012 at 14:28 | comment | added | Rudi Pendavingh | Adding $F_i(x)\geq 0$ will introduce restrictions on $x$ that are not in your original problem. | |
| Dec 8, 2012 at 14:19 | answer | added | Rudi Pendavingh | timeline score: 1 | |
| Dec 8, 2012 at 14:12 | history | edited | Artem Pianykh | CC BY-SA 3.0 |
deleted 31 characters in body
|
| Dec 8, 2012 at 14:08 | comment | added | Artem Pianykh | @fedja Yep! Apologize for being not enougn specific. I edited the question. As for a LPP, I can't find a way to transform this problem to lunear programming problem now. | |
| Dec 8, 2012 at 14:00 | history | edited | Artem Pianykh | CC BY-SA 3.0 |
added 81 characters in body
|
| Dec 8, 2012 at 1:17 | comment | added | fedja | Erm... Why don't you just add the restriction $F(x)\ge 0$ and ask for $\min F(x)$? That is a standard linear programming problem, isn't it? | |
| Dec 7, 2012 at 22:49 | history | edited | Artem Pianykh | CC BY-SA 3.0 |
added 54 characters in body
|
| Dec 7, 2012 at 21:57 | history | asked | Artem Pianykh | CC BY-SA 3.0 |