|
|
Re: Lower bound of a non-convex program through the dual problem in Matlab
Posted:
Jan 22, 2013 12:41 PM
|
|
"Nazmul Islam" wrote in message <kdmigl$mcj$1@newscl01ah.mathworks.com>...
> > Unfortunately, my solution is getting stuck at a local minimum. Please let me know if I can get the lower bounds of this problem through the interior point method.
-Inf is lower-bound. Of course it is useless answer, nevertheless it is a correct answer (You never explain why you need a lower-bound for).
Bruno
|
|