<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=Windows-1252">
</head>
<body style="word-wrap: break-word; -webkit-nbsp-mode: space; -webkit-line-break: after-white-space;" class="">
I certainly do support the development of shims for fully free solvers. CSDP fits into that category nicely. However, I’ve not supported CSDP to date because it doesn’t provide native support for SOCP cones. It’s really not practical for CVX to support solvers
that can’t handle SOCP natively.
<div class="">
<div class=""><br class="">
</div>
<div class="">It is true that SOCP constraints can always be represented using SDP. But a naïve conversion of SOCP to SDP squares the number of variables; and the most efficient approach (in terms of the number of variables) multiplies them by a factor of 6
or so. And both conversions add quite a few equality constraints as well. I have no idea how either of those conversions impacts accuracy, nor have I examined the empirical performance loss. It’s simply not something I can afford the time to investigate or
explore. Someone else can do it, but I really cannot support it.</div>
<div class=""><br class="">
</div>
<div class="">I’m not sure I understand the free variable issue. SeDuMi converts free variables to constrained variables internally as well, but the SeDuMi calling sequence accepts them just fine. Why not use the SeDuMi-compatible calling sequence for CSDP,
and let CSDP’s own facilities handle the conversion?</div>
<div class=""><br class="">
</div>
<div class="">
<div class="">
<div class="">
<div>
<blockquote type="cite" class="">
<div class="">On Oct 20, 2014, at 8:46 AM, Brian Borchers <<a href="mailto:borchers@nmt.edu" class="">borchers@nmt.edu</a>> wrote:</div>
<br class="Apple-interchange-newline">
<div class="">
<div dir="ltr" class="">Jose; I believe that CVX requires a solver than can solve second order cone programming problems (SOCP) as well as SDP. You could transform SOCP's into SDP's and solve them in that form using CSDP, but the performance would be poor
in comparison with a code that directly solves SOCP.
<div class=""><br class="">
</div>
<div class="">I've included Michael Grant in this reply. Michael; do you have anything to add?
<div class=""><br class="">
</div>
</div>
</div>
<div class="gmail_extra"><br class="">
<div class="gmail_quote">On Mon, Oct 20, 2014 at 7:34 AM, Jose Lopez <span dir="ltr" class="">
<<a href="mailto:lopez.jo@husky.neu.edu" target="_blank" class="">lopez.jo@husky.neu.edu</a>></span> wrote:<br class="">
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
<div dir="ltr" class="">Hi list,
<div class=""><br class="">
</div>
<div class="">I'm a new member to the CSDP list. My name's Jose I'm an EE grad student at Northeastern in Boston. I'm writing to ask if anyone has written a CVX "solver shim" for CSDP so that it can be called from CVX? (CVX encourages users to make solver interfaces
so long as the solver is free.) I took a stab at it using the Sedumi solver shim as a starting point but as I'm not that familiar with the internals of SDP solvers I get tripped up when handling the free variables; which as you all know CSDP doesn't accept.
I know CSDP has a utility to convert free variable problems but I get tripped up when converting the solution back to Sedumi form. Anyway, if someone has a solver shim I would be really, really, grateful if you shared it. =)</div>
<div class=""><br class="">
</div>
<div class="">Have a great Monday, list.</div>
<span class="HOEnZb"><font color="#888888" class="">
<div class=""><br class="">
</div>
<div class="">Jose</div>
</font></span></div>
<br class="">
_______________________________________________<br class="">
Csdp mailing list<br class="">
<a href="mailto:Csdp@list.coin-or.org" class="">Csdp@list.coin-or.org</a><br class="">
<a href="http://list.coin-or.org/mailman/listinfo/csdp" target="_blank" class="">http://list.coin-or.org/mailman/listinfo/csdp</a><br class="">
<br class="">
</blockquote>
</div>
<br class="">
<br clear="all" class="">
<div class=""><br class="">
</div>
-- <br class="">
Brian Borchers <a href="mailto:borchers@nmt.edu" target="_blank" class="">borchers@nmt.edu</a><br class="">
Department of Mathematics <a href="http://www.nmt.edu/~borchers/" target="_blank" class="">http://www.nmt.edu/~borchers/</a><br class="">
New Mexico Tech Phone: (575) 322-2592<br class="">
Socorro, NM 87801 FAX: (575) 835-5366 </div>
</div>
</blockquote>
</div>
<br class="">
</div>
</div>
</div>
</div>
</body>
</html>