DSDP(1)

💖 DSDP — bestie's guide to the semidefinite program solver 💖

okay so this is a General Commands Manual page, which basically means it's the quick-and-casual version. sit down, grab a strawberry 🍓, and let's get into it.

✨ NAME ✨

dsdp5 — semidefinite program solver. that's the whole vibe. she solves SDPs. periodt.

🦋 SYNOPSIS 🦋

dsdp5 [options] filename
maxcut [options] filename
theta  filename

note that theta is out here living her best life with no options at all. main character energy honestly. 👑

🌸 DESCRIPTION 🌸

this manual page documents, briefly, the dsdp5, theta and maxcut commands. brief because we have places to be.

• dsdp5 — interface to solve general semi-definite programs
• maxcut — solves a SDP relaxation of the maximum cut problem
• theta — solves the Lovasz thetha problem

(and yes, the original says "thetha" and i am NOT fixing it. that's her name. respect it. 💅)

💅 OPTIONS 💅

here's a summary of options, bestie. for a complete description, go look in /usr/share/doc/dsdp-doc. i'm just giving you the highlight reel.

• -help — shows a summary of options. the "hey what do i do" button.
• -v, --version — shows the version of the program. for when you need receipts.
• -print — print information at each k iteration (default 10).
• -save — filename of solution file in SDPA format.
• -fout — filename to print standard monitor to a file.
• -y0 — filename for initial solution file.
• -benchmark — filename to file containing names of SDPA files.
• -directory — path to directory containing benchmark SDPA files.
• -suffix — suffix to add to each benchmark problem name.
• -dloginfo — print more information for higher numbers (default 0).
• -dlogsummary — print timing information (default 1 - enabled).
• -gaptol — gap tolerance parameter, stop when relative duality gap less than this gap (default 1e-6).
• -r0 — if nonnegative, initialize S by adding this multiple of the identity matrix (default -1).
• -penalty — penalize dual infeasibility (default 1e10).
• -boundy — bound for variables y (default 1e7).
• -maxit — set maximum iterates (default 200).
• -zbar — upper bound for dual solution (default 1e10).
• -mu0 — if positive, set initial barrier parameter (default -1).
• -rho — potential parameter as multiple of dimension (default 3).
• -drho — use dynamic rho strategy (default 1).
• -pnormtol — stop only if pnorm less than (default 1e30).
• -reuse — reuse the Schur Matrix this many times (default 4).
• -dobjmin — apply a known lower bound for the objective at solution as a constraint.
• -bigM — if positive, modify algorithm to make dual infeasibility positive with a large associated cost (default 0).
• -dloginfo — print more information for higher numbers (default 0). (yes, she's listed twice in the original. iconic of her. i'm keeping both because facts are facts. 🙈)
• -params — filename to read selected options from a file.

🌈 SEE ALSO 🌈

• glpsol(1)

the programs are documented fully in the accompanying .pdf and html documentation, which can be found in /usr/share/doc/dsdp-doc — but only if the dsdp-doc package is installed. iykyk. 🫶

👑 AUTHOR 👑

dsdp was written by Steven J. Benson <benson@mcs.anl.gov> and Yinyu Ye <yinyu-ye@stanford.edu>.

this manual page was written by Soeren Sonnenburg <sonne@debian.org>, for the Debian project (but may be used by others). generous queen behavior fr fr. 💖

and that's a wrap, bestie!! this page is dated August 1, 2007, and it ships with the DSDP package — so go forth and solve some semidefinite programs. you're literally gonna ate. 🎀✨🦋