Timeline for Sufficient optimality condition for a non-smooth quasiconvex problem
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 28, 2014 at 23:50 | comment | added | Ali | Thanks Cristobal. Actually the initial problem is not very easy to explain (I will email you the details). I already have a convex relaxation to that problem. The problem above is a better approximation (than the convex form) that under some conditions on the $\alpha_i$ values becomes equivalent to the combinatorial cost. The ultimate goal is to use this program as an intermediate program to show the convex formulation and the combinatorial form coincide under certain criteria. | |
| Apr 28, 2014 at 22:20 | comment | added | Cristóbal Guzmán | You say your problem is a relaxation: can you include the original problem you are relaxing in this way, and why you choose such a relaxation? I don't know any conditions for global minima for nonconvex programming, but maybe your original problem can be relaxed to a convex program. | |
| Apr 28, 2014 at 20:47 | history | asked | Ali | CC BY-SA 3.0 |