<?xml version="1.0" encoding="UTF-8"?>










<rss version="2.0" xmlns:jf="http://www.jivesoftware.com/xmlns/jiveforums/rss">
    <channel>
        <title>Math Forum</title>
        <link>http://mathforum.org/kb</link>
        <description>List of forum topics</description>
        <language>en</language>


        <item>
            <title>Re: Lower bound of a non-convex program through the dual problem in Matlab</title>
        
            <link>http://mathforum.org/kb/thread.jspa?messageID=8128660&amp;tstart=0#8128660</link>

        

            <description><![CDATA[With, YALMIP, you can solve small problems to global optimality. By tweaking the options, you can tell it to give up early and return a valid lower]]></description>

        

            <jf:creationDate>Jan 23, 2013 3:59:09 AM</jf:creationDate>
            <jf:modificationDate>Jan 23, 2013 3:59:09 AM</jf:modificationDate>
            <jf:author>johanl@isy.liu.se</jf:author>
            <jf:replyCount>0</jf:replyCount>
        </item>

        <item>
            <title>Re: Lower bound of a non-convex program through the dual problem in Matlab</title>
        
            <link>http://mathforum.org/kb/thread.jspa?messageID=8124524&amp;tstart=0#8124524</link>

        

            <description><![CDATA[Bruno,<br><br>That's a good observation! :) I am actually maximizing an integer non-concave nonlinear program :S. I am using branch and bound to]]></description>

        

            <jf:creationDate>Jan 22, 2013 2:38:08 PM</jf:creationDate>
            <jf:modificationDate>Jan 22, 2013 2:38:08 PM</jf:modificationDate>
            <jf:author>nazmul.islam@gmail.com</jf:author>
            <jf:replyCount>1</jf:replyCount>
        </item>

        <item>
            <title>Re: Lower bound of a non-convex program through the dual problem in Matlab</title>
        
            <link>http://mathforum.org/kb/thread.jspa?messageID=8124030&amp;tstart=0#8124030</link>

        

            <description><![CDATA["Nazmul Islam" wrote in message &lt;kdmigl$mcj$1@newscl01ah.mathworks.com&gt;...<br><br><font color="#660066">&gt; <br>&gt; Unfortunately, my]]></description>

        

            <jf:creationDate>Jan 22, 2013 12:41:09 PM</jf:creationDate>
            <jf:modificationDate>Jan 22, 2013 12:41:09 PM</jf:modificationDate>
            <jf:author>b.luong@fogale.findmycountry</jf:author>
            <jf:replyCount>2</jf:replyCount>
        </item>

        <item>
            <title>Re: Lower bound of a non-convex program through the dual problem in Matlab</title>
        
            <link>http://mathforum.org/kb/thread.jspa?messageID=8124028&amp;tstart=0#8124028</link>

        

            <description><![CDATA[Dear Bruno,<br><br>Thanks for your reply. I tried the 'interior-point-method' to solve the following (trial) optimization problem: <br><br>min_x]]></description>

        

            <jf:creationDate>Jan 22, 2013 12:33:09 PM</jf:creationDate>
            <jf:modificationDate>Jan 22, 2013 12:33:09 PM</jf:modificationDate>
            <jf:author>nazmul.islam@gmail.com</jf:author>
            <jf:replyCount>3</jf:replyCount>
        </item>

        <item>
            <title>Re: Lower bound of a non-convex program through the dual problem in Matlab</title>
        
            <link>http://mathforum.org/kb/thread.jspa?messageID=8110429&amp;tstart=0#8110429</link>

        

            <description><![CDATA[Use fmincon with interior-point method. I believe it minimizes the dual-gap.<br><br>Bruno<br>]]></description>

        

            <jf:creationDate>Jan 19, 2013 5:16:08 AM</jf:creationDate>
            <jf:modificationDate>Jan 19, 2013 5:16:08 AM</jf:modificationDate>
            <jf:author>b.luong@fogale.findmycountry</jf:author>
            <jf:replyCount>4</jf:replyCount>
        </item>

        <item>
            <title>Lower bound of a non-convex program through the dual problem in Matlab</title>
        
            <link>http://mathforum.org/kb/thread.jspa?messageID=8109935&amp;tstart=0#8109935</link>

        

            <description><![CDATA[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]]></description>

        

            <jf:creationDate>Jan 19, 2013 2:23:08 AM</jf:creationDate>
            <jf:modificationDate>Jan 19, 2013 2:23:08 AM</jf:modificationDate>
            <jf:author>nazmul.islam@gmail.com</jf:author>
            <jf:replyCount>5</jf:replyCount>
        </item>


    </channel>
</rss>

