<div dir="ltr"><br><div class="gmail_extra"><br><div class="gmail_quote">On Mon, Nov 24, 2014 at 5:27 PM, <span dir="ltr"><<a href="mailto:markisus@gmail.com" target="_blank">markisus@gmail.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
<div dir="ltr">
<div dir="ltr" style="font-family:'Calibri','Segoe UI','Meiryo','Microsoft YaHei UI','Microsoft JhengHei UI','Malgun Gothic','sans-serif';font-size:12pt"><div>Thanks for your response. </div><div><br></div><div>I was using this text file as a reference: <a href="http://plato.asu.edu/ftp/sdpa_format.txt" target="_blank">http://plato.asu.edu/ftp/sdpa_format.txt</a> </div><div>If I am interpreting your response correctly, that file has reversed the roles of primal and dual with respect to CSDP’s implementation.</div></div></div></blockquote><div><br></div><div>Yes, that's basically it. There are further confusions between min/max that complicate things even more. CSDP, SDPT3 and SeDuMi all have the same convention for which set of constraints is "primal", but differ as to the min/max objective. SDPA switches primal and dual. Your test problem is in SDPA's terminology dual unbounded and primal infeasible. </div></div><div><br></div>-- <br><div class="gmail_signature">Brian Borchers <a href="mailto:borchers@nmt.edu" target="_blank">borchers@nmt.edu</a><br>Department of Mathematics <a href="http://www.nmt.edu/~borchers/" target="_blank">http://www.nmt.edu/~borchers/</a><br>New Mexico Tech Phone: (575) 322-2592<br>Socorro, NM 87801 FAX: (575) 835-5366</div>
</div></div>