Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » Software » comp.soft-sys.matlab

Topic: Lower bound of a non-convex program through the dual problem in Matlab
Replies: 5   Last Post: Jan 23, 2013 3:59 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Muhammad

Posts: 29
Registered: 3/21/08
Lower bound of a non-convex program through the dual problem in Matlab
Posted: Jan 19, 2013 2:23 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

I want to get the lower bound of a non-convex program through the dual problem. Can I do it using the standard Matlab optimization toolboxes?

For example, I have the following problem:

min f0(x)
s.t. f1(x) <= 0

Here, f1(x) is non-convex. Let, the lagrange dual function, g(p) = inf_x (f0(x) + p*f1(x).
The optimal dual solution: max_p g(p). This dual solution is a lower bound of my original primal problem.

Can I obtain this dual solution, i.e., the lower bound, using Matlab optimization toolboxes? I know that I cannot get the global minimum through the primal problem since it is non-convex. Any help will be appreciated.

Thanks,

Nazmul



Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.