NAME¶

csdp - semidefinite program solver

SYNOPSIS¶

csdp<problemfile> <finalsolution> <initialsolution>
csdp-complement<inputgraph> <outputgraph>
csdp-graphtoprob<graph> <problemfile>
csdp-randgraph<rand_graph> <file> <n> <p> [<seed>]
csdp-theta<graph>

DESCRIPTION¶

This manual page documents briefly thecsdp,csdp-complement,csdp-graphtoprob,csdp-randgraphandcsdp-thetacommands.

csdp -- interface to solve general semi-definite programs
csdp-complement -- compute the complement of a graph and output it in csdp problem format
csdp-graphtoprob -- convert graph into csdp problem format file
csdp-randgraph -- generate a random graph
csdp-theta -- solves the Lovasz thetha problem

OPTIONS¶

A summary of options is included below.For a complete description, see/usr/share/doc/coinor-csdp-doc/csdpuser.pdf.

csdp

inputproblemin the SDPA sparse format

problemfile

is the name of a file containing the SDP problem in SDPA sparse format

finalsolution

is the optional name of a file in which to save the final solution

initialsolution

is the optional name of a file from which to take the initial solution.

CSDP searches for a file namedparam.csdpin the current directory. Ifno such file exists, then default values for all of CSDP’s parameters are used. Ifthere is a parameter file, then CSDP reads the parameter values from this file.The default parameter values is given below (can be pasted into a file):

axtol=1.0e-8
atytol=1.0e-8
objtol=1.0e-8
pinftol=1.0e8
dinftol=1.0e8
maxiter=100
minstepfrac=0.90
maxstepfrac=0.97
minstepp=1.0e-8
minstepd=1.0e-8
usexzgap=1
tweakgap=0
affine=0
printlevel=1
perturbobj=1
fastmode=0

param.csdp file parameter description

axtol

atytolobjtoltolerances for primal feasibility, dual feasibility, and relative duality gap

pinftol

dinftoltolerances used in determining primal and dual infeasibility

maxiter

plimit the total number of iterations that CSDP may use

minstepfrac

maxstepfracdetermine how close to the edge of the feasible region CSDP will step. If the primal or dual step isshorter than minstepp or minstepd, then CSDP declares a line search failure.usexzgapIf parameter 0, then CSDP will use the objective function dualitygap instead of the tr(XZ) gap

tweakgap

if set to 1, and usexzgap is set to 0, then CSDP will attempt to "fix" negative duality gaps.

affine

If parameter affineis set to 1, then CSDP will take only primal–dual affine steps and not makeuse of the barrier term. This can be useful for some problems that do not havefeasible solutions that are strictly in the interior of the cone of semidefinite ma-trices.printleveldetermines how much debugging information is output. Use printlevel=0 for nooutput and printlevel=1 for normal output.Higher values of printlevel will generate more debugging output.

perturbobj

determines whether the objective function will be perturbedto help deal with problems that have unbounded optimal solution sets. If per-turbobj is 0, then the objective will not be perturbed. If perturbobj=1, thenthe objective function will be perturbed by a default amount. Larger valuesof perturbobj (e.g. 100.0) increase the size of the perturbation. This can behelpful in solving some difficult problems.

fastmode

determines whether or not CSDP will skip certain time consuming operations that slightlyimprove the accuracy of the solutions. If fastmode is set to 1, then CSDP maybe somewhat faster, but also somewhat less accurate.

SEEALSO¶

dsdp5(1),theta(1)

The programs are documented fully in the accompanying .pdf documentation

which can be found in/usr/share/doc/coinor-csdp-docif the coinor-csdp-doc package is installed.

AUTHOR¶

csdp was written by Brian Borchers et al.

This manual page was written by Soeren Sonnenburg <sonne@debian.org>,for the Debian project (but may be used by others).