Timeline for Maximizing a certain concave function over a non-convex set
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 4, 2015 at 17:35 | comment | added | Samrat Mukhopadhyay | @kaptenkas, in the case where $B$ is diagonal with positive entries I already know that the solution is to assign $x_i=1$ for all the indices that correspond to the $K$ largest diagonal entries of $B$, then how come is it NP-hard? | |
| Dec 27, 2014 at 16:14 | comment | added | Samrat Mukhopadhyay | Also, can it be solved approximately by convex relaxation of the constraint that the $x_i$ are in $\{0,1\}$? | |
| Dec 27, 2014 at 16:13 | comment | added | Samrat Mukhopadhyay | Can you give me a reference to the algorithm you are referring to. It will be really helpful. | |
| Dec 27, 2014 at 16:11 | review | First posts | |||
| Dec 27, 2014 at 16:16 | |||||
| Dec 27, 2014 at 16:11 | history | answered | kaptenknas | CC BY-SA 3.0 |