interface for DSDP More...

Macros
#define	PENALTYBOUNDTOL 1E-3

#define	MIN_PENALTYPARAM 1e5

#define	MAX_PENALTYPARAM 1e12

#define	PENALTYPARAM_FACTOR 1e4

#define	MAX_MAXPENALTYPARAM 1e15

#define	MAXPENALTYPARAM_FACTOR 1e6

#define	INFEASFEASTOLCHANGE 0.1

#define	INFEASMINFEASTOL 1E-9

#define	DSDP_CALL(x)

#define	DSDP_CALL_BOOL(x)

#define	DSDP_CALLM(x)

#define	BMS_CALL(x)

#define	TIMEOFDAY_CALL(x)

#define	CHECK_IF_SOLVED(sdpisolver)

#define	CHECK_IF_SOLVED_BOOL(sdpisolver)

Typedefs
typedef struct Timings	Timings

Functions
static int	compLowerTriangPos (int i, int j)

static SCIP_Bool	isFixed (SCIP_SDPISOLVER *sdpisolver, SCIP_Real lb, SCIP_Real ub)

static void	sortColRow (int row, int col, SCIP_Real *val, int length)

static int	checkTimeLimitDSDP (DSDP dsdp, void *ctx)

static int	checkGapSetPreoptimalSol (DSDP dsdp, void *ctx)

Miscellaneous Methods
const char *	SCIPsdpiSolverGetSolverName (void)

const char *	SCIPsdpiSolverGetSolverDesc (void)

void *	SCIPsdpiSolverGetSolverPointer (SCIP_SDPISOLVER *sdpisolver)

SCIP_Real	SCIPsdpiSolverGetDefaultSdpiSolverFeastol (void)

SCIP_Real	SCIPsdpiSolverGetDefaultSdpiSolverGaptol (void)

int	SCIPsdpiSolverGetDefaultSdpiSolverNpenaltyIncreases (void)

SCIP_Bool	SCIPsdpiSolverDoesWarmstartNeedPrimal (void)

SDPI Creation and Destruction Methods
SCIP_RETCODE	SCIPsdpiSolverCreate (SCIP_SDPISOLVER *sdpisolver, SCIP_MESSAGEHDLR messagehdlr, BMS_BLKMEM blkmem, BMS_BUFMEM bufmem)

SCIP_RETCODE	SCIPsdpiSolverFree (SCIP_SDPISOLVER **sdpisolver)

SCIP_RETCODE	SCIPsdpiSolverIncreaseCounter (SCIP_SDPISOLVER *sdpisolver)

SCIP_RETCODE	SCIPsdpiSolverResetCounter (SCIP_SDPISOLVER *sdpisolver)

Solving Methods
SCIP_RETCODE	SCIPsdpiSolverLoadAndSolve (SCIP_SDPISOLVER sdpisolver, int nvars, SCIP_Real obj, SCIP_Real lb, SCIP_Real ub, int nsdpblocks, int sdpblocksizes, int sdpnblockvars, int sdpconstnnonz, int sdpconstnblocknonz, int sdpconstrow, int sdpconstcol, SCIP_Real sdpconstval, int sdpnnonz, int sdpnblockvarnonz, int sdpvar, int sdprow, int sdpcol, SCIP_Real sdpval, int indchanges, int nremovedinds, int blockindchanges, int nremovedblocks, int nlpcons, int noldlpcons, SCIP_Real lplhs, SCIP_Real lprhs, int rownactivevars, int lpnnonz, int lprow, int lpcol, SCIP_Real lpval, SCIP_Real starty, int startZnblocknonz, int startZrow, int startZcol, SCIP_Real *startZval, int startXnblocknonz, int startXrow, int startXcol, SCIP_Real **startXval, SCIP_SDPSOLVERSETTING startsettings, SCIP_Real timelimit)

SCIP_RETCODE	SCIPsdpiSolverLoadAndSolveWithPenalty (SCIP_SDPISOLVER sdpisolver, SCIP_Real penaltyparam, SCIP_Bool withobj, SCIP_Bool rbound, int nvars, SCIP_Real obj, SCIP_Real lb, SCIP_Real ub, int nsdpblocks, int sdpblocksizes, int sdpnblockvars, int sdpconstnnonz, int sdpconstnblocknonz, int sdpconstrow, int sdpconstcol, SCIP_Real sdpconstval, int sdpnnonz, int sdpnblockvarnonz, int sdpvar, int sdprow, int sdpcol, SCIP_Real sdpval, int indchanges, int nremovedinds, int blockindchanges, int nremovedblocks, int nlpcons, int noldlpcons, SCIP_Real lplhs, SCIP_Real lprhs, int rownactivevars, int lpnnonz, int lprow, int lpcol, SCIP_Real lpval, SCIP_Real starty, int startZnblocknonz, int startZrow, int startZcol, SCIP_Real *startZval, int startXnblocknonz, int startXrow, int startXcol, SCIP_Real *startXval, SCIP_SDPSOLVERSETTING startsettings, SCIP_Real timelimit, SCIP_Bool feasorig, SCIP_Bool *penaltybound)

Solution Information Methods
SCIP_Bool	SCIPsdpiSolverWasSolved (SCIP_SDPISOLVER *sdpisolver)

SCIP_Bool	SCIPsdpiSolverFeasibilityKnown (SCIP_SDPISOLVER *sdpisolver)

SCIP_RETCODE	SCIPsdpiSolverGetSolFeasibility (SCIP_SDPISOLVER sdpisolver, SCIP_Bool primalfeasible, SCIP_Bool *dualfeasible)

SCIP_Bool	SCIPsdpiSolverIsPrimalUnbounded (SCIP_SDPISOLVER *sdpisolver)

SCIP_Bool	SCIPsdpiSolverIsPrimalInfeasible (SCIP_SDPISOLVER *sdpisolver)

SCIP_Bool	SCIPsdpiSolverIsPrimalFeasible (SCIP_SDPISOLVER *sdpisolver)

SCIP_Bool	SCIPsdpiSolverIsDualUnbounded (SCIP_SDPISOLVER *sdpisolver)

SCIP_Bool	SCIPsdpiSolverIsDualInfeasible (SCIP_SDPISOLVER *sdpisolver)

SCIP_Bool	SCIPsdpiSolverIsDualFeasible (SCIP_SDPISOLVER *sdpisolver)

SCIP_Bool	SCIPsdpiSolverIsConverged (SCIP_SDPISOLVER *sdpisolver)

SCIP_Bool	SCIPsdpiSolverIsObjlimExc (SCIP_SDPISOLVER *sdpisolver)

SCIP_Bool	SCIPsdpiSolverIsIterlimExc (SCIP_SDPISOLVER *sdpisolver)

SCIP_Bool	SCIPsdpiSolverIsTimelimExc (SCIP_SDPISOLVER *sdpisolver)

int	SCIPsdpiSolverGetInternalStatus (SCIP_SDPISOLVER *sdpisolver)

SCIP_Bool	SCIPsdpiSolverIsOptimal (SCIP_SDPISOLVER *sdpisolver)

SCIP_Bool	SCIPsdpiSolverIsAcceptable (SCIP_SDPISOLVER *sdpisolver)

SCIP_RETCODE	SCIPsdpiSolverIgnoreInstability (SCIP_SDPISOLVER sdpisolver, SCIP_Bool success)

SCIP_RETCODE	SCIPsdpiSolverGetObjval (SCIP_SDPISOLVER sdpisolver, SCIP_Real objval)

SCIP_RETCODE	SCIPsdpiSolverGetSol (SCIP_SDPISOLVER sdpisolver, SCIP_Real objval, SCIP_Real dualsol, int dualsollength)

SCIP_RETCODE	SCIPsdpiSolverGetPreoptimalPrimalNonzeros (SCIP_SDPISOLVER sdpisolver, int nblocks, int startXnblocknonz)

SCIP_RETCODE	SCIPsdpiSolverGetPreoptimalSol (SCIP_SDPISOLVER sdpisolver, SCIP_Bool success, SCIP_Real dualsol, int dualsollength, int nblocks, int startXnblocknonz, int startXrow, int startXcol, SCIP_Real *startXval)

SCIP_RETCODE	SCIPsdpiSolverGetPrimalBoundVars (SCIP_SDPISOLVER sdpisolver, SCIP_Real lbvars, SCIP_Real ubvars, int arraylength)

SCIP_RETCODE	SCIPsdpiSolverGetPrimalNonzeros (SCIP_SDPISOLVER sdpisolver, int nblocks, int startXnblocknonz)

SCIP_RETCODE	SCIPsdpiSolverGetPrimalMatrix (SCIP_SDPISOLVER sdpisolver, int nblocks, int startXnblocknonz, int startXrow, int startXcol, SCIP_Real **startXval)

SCIP_Real	SCIPsdpiSolverGetMaxPrimalEntry (SCIP_SDPISOLVER *sdpisolver)

SCIP_RETCODE	SCIPsdpiSolverGetIterations (SCIP_SDPISOLVER sdpisolver, int iterations)

SCIP_RETCODE	SCIPsdpiSolverGetSdpCalls (SCIP_SDPISOLVER sdpisolver, int calls)

SCIP_RETCODE	SCIPsdpiSolverSettingsUsed (SCIP_SDPISOLVER sdpisolver, SCIP_SDPSOLVERSETTING usedsetting)

Numerical Methods
SCIP_Real	SCIPsdpiSolverInfinity (SCIP_SDPISOLVER *sdpisolver)

SCIP_Bool	SCIPsdpiSolverIsInfinity (SCIP_SDPISOLVER *sdpisolver, SCIP_Real val)

SCIP_RETCODE	SCIPsdpiSolverGetRealpar (SCIP_SDPISOLVER sdpisolver, SCIP_SDPPARAM type, SCIP_Real dval)

SCIP_RETCODE	SCIPsdpiSolverSetRealpar (SCIP_SDPISOLVER *sdpisolver, SCIP_SDPPARAM type, SCIP_Real dval)

SCIP_RETCODE	SCIPsdpiSolverGetIntpar (SCIP_SDPISOLVER sdpisolver, SCIP_SDPPARAM type, int ival)

SCIP_RETCODE	SCIPsdpiSolverSetIntpar (SCIP_SDPISOLVER *sdpisolver, SCIP_SDPPARAM type, int ival)

SCIP_RETCODE	SCIPsdpiSolverComputeLambdastar (SCIP_SDPISOLVER *sdpisolver, SCIP_Real maxguess)

SCIP_RETCODE	SCIPsdpiSolverComputePenaltyparam (SCIP_SDPISOLVER sdpisolver, SCIP_Real maxcoeff, SCIP_Real penaltyparam)

SCIP_RETCODE	SCIPsdpiSolverComputeMaxPenaltyparam (SCIP_SDPISOLVER sdpisolver, SCIP_Real penaltyparam, SCIP_Real maxpenaltyparam)

File Interface Methods
SCIP_RETCODE	SCIPsdpiSolverReadSDP (SCIP_SDPISOLVER sdpisolver, const char fname)

SCIP_RETCODE	SCIPsdpiSolverWriteSDP (SCIP_SDPISOLVER sdpisolver, const char fname)

Detailed Description

interface for DSDP

Author: Tristan Gally

Definition in file sdpisolver_dsdp.c.

Macro Definition Documentation

#define PENALTYBOUNDTOL 1E-3

if the relative gap between Tr(X) and penaltyparam for a primal solution of the penaltyformulation is bigger than this value, it will be reported to the sdpi

Definition at line 61 of file sdpisolver_dsdp.c.

Referenced by SCIPsdpiSolverLoadAndSolveWithPenalty().

#define MIN_PENALTYPARAM 1e5

if the penalty parameter is to be computed, this is the minimum value it will take

Definition at line 65 of file sdpisolver_dsdp.c.

Referenced by SCIPsdpiSolverComputePenaltyparam().

#define MAX_PENALTYPARAM 1e12

if the penalty parameter is to be computed, this is the maximum value it will take

Definition at line 66 of file sdpisolver_dsdp.c.

Referenced by SCIPsdpiSolverComputePenaltyparam().

#define PENALTYPARAM_FACTOR 1e4

if the penalty parameter is to be computed, the maximal objective coefficient will be multiplied by this

Definition at line 67 of file sdpisolver_dsdp.c.

Referenced by SCIPsdpiSolverComputePenaltyparam().

#define MAX_MAXPENALTYPARAM 1e15

if the maximum penaltyparameter is to be computed, this is the maximum value it will take

Definition at line 68 of file sdpisolver_dsdp.c.

Referenced by SCIPsdpiSolverComputeMaxPenaltyparam().

#define MAXPENALTYPARAM_FACTOR 1e6

if the maximum penaltyparameter is to be computed, it will be set to penaltyparam * this

Definition at line 69 of file sdpisolver_dsdp.c.

Referenced by SCIPsdpiSolverComputeMaxPenaltyparam().

#define INFEASFEASTOLCHANGE 0.1

change feastol by this factor if the solution was found to be infeasible with regards to feastol

Definition at line 70 of file sdpisolver_dsdp.c.

Referenced by SCIPsdpiSolverLoadAndSolveWithPenalty().

#define INFEASMINFEASTOL 1E-9

minimum value for feasibility tolerance when encountering problems with regards to tolerance

Definition at line 71 of file sdpisolver_dsdp.c.

Referenced by SCIPsdpiSolverLoadAndSolveWithPenalty().

#define DSDP_CALL ( x )

Value:

do                                                                                     \
                      {                                                                                      \
                         int _dsdperrorcode_;                                                                \
                         if ( (_dsdperrorcode_ = (x)) != 0 )                                                 \
                         {                                                                                   \
                            SCIPerrorMessage("DSDP-Error <%d> in function call.\n", _dsdperrorcode_);        \
                            return SCIP_LPERROR;                                                             \
                         }                                                                                   \
                      }                                                                                      \
                      while( FALSE )

Calls a DSDP-Function and transforms the return-code to a SCIP_LPERROR if needed.

Definition at line 74 of file sdpisolver_dsdp.c.

Referenced by checkGapSetPreoptimalSol(), checkTimeLimitDSDP(), SCIPsdpiSolverFree(), SCIPsdpiSolverGetObjval(), SCIPsdpiSolverGetPrimalBoundVars(), SCIPsdpiSolverGetSol(), SCIPsdpiSolverGetSolFeasibility(), and SCIPsdpiSolverLoadAndSolveWithPenalty().

#define DSDP_CALL_BOOL ( x )

Value:

do                                                                                \
                      {                                                                                      \
                         int _dsdperrorcode_;                                                                \
                         if ( (_dsdperrorcode_ = (x)) != 0 )                                                 \
                         {                                                                                   \
                            SCIPerrorMessage("DSDP-Error <%d> in function call.\n", _dsdperrorcode_);        \
                            return FALSE;                                                                    \
                         }                                                                                   \
                      }                                                                                      \
                      while( FALSE )

Same as DSDP_CALL, but used for functions returning a boolean.

Definition at line 86 of file sdpisolver_dsdp.c.

Referenced by SCIPsdpiSolverFeasibilityKnown(), SCIPsdpiSolverIsConverged(), SCIPsdpiSolverIsDualFeasible(), SCIPsdpiSolverIsDualInfeasible(), SCIPsdpiSolverIsDualUnbounded(), SCIPsdpiSolverIsIterlimExc(), SCIPsdpiSolverIsPrimalFeasible(), SCIPsdpiSolverIsPrimalInfeasible(), and SCIPsdpiSolverIsPrimalUnbounded().

#define DSDP_CALLM ( x )

Value:

do                                                                                     \
                      {                                                                                      \
                         int _dsdperrorcode_;                                                                \
                         if ( (_dsdperrorcode_ = (x)) != 0 )                                                 \
                         {                                                                                   \
                            SCIPerrorMessage("DSDP-Error <%d> in function call.\n", _dsdperrorcode_);        \
                            return SCIP_NOMEMORY;                                                            \
                         }                                                                                   \
                      }                                                                                      \
                      while( FALSE )

Same as DSDP_CALL, but this will be used for initialization methods with memory allocation and return a SCIP_NOMEMORY if an error is produced.

Definition at line 98 of file sdpisolver_dsdp.c.

Referenced by SCIPsdpiSolverLoadAndSolveWithPenalty().

#define BMS_CALL ( x )

Value:

do                                                                                     \
                      {                                                                                      \
                         if( NULL == (x) )                                                                   \
                         {                                                                                   \
                            SCIPerrorMessage("No memory in function call.\n");                               \
                            return SCIP_NOMEMORY;                                                            \
                         }                                                                                   \
                      }                                                                                      \
                      while( FALSE )

Checks if a BMSallocMemory-call was successfull, otherwise returns SCIP_NOMEMORY.

Definition at line 110 of file sdpisolver_dsdp.c.

Referenced by SCIPsdpiSolverCreate(), SCIPsdpiSolverGetObjval(), SCIPsdpiSolverGetPrimalBoundVars(), SCIPsdpiSolverGetSol(), and SCIPsdpiSolverLoadAndSolveWithPenalty().

#define TIMEOFDAY_CALL ( x )

Value:

do                                                                                \
                      {                                                                                      \
                         int _errorcode_;                                                                    \
                         if ( (_errorcode_ = (x)) != 0 )                                                     \
                         {                                                                                   \
                            SCIPerrorMessage("Error in gettimeofday! \n");                                   \
                            return SCIP_ERROR;                                                               \
                         }                                                                                   \
                      }                                                                                      \
                      while( FALSE )

Calls a gettimeofday and transforms the return-code to a SCIP_ERROR if needed.

Definition at line 121 of file sdpisolver_dsdp.c.

Referenced by checkTimeLimitDSDP(), and SCIPsdpiSolverLoadAndSolveWithPenalty().

#define CHECK_IF_SOLVED ( sdpisolver )

Value:

do                                                                      \
                      {                                                                                      \
                         if (!(sdpisolver->solved))                                                          \
                         {                                                                                   \
                            SCIPerrorMessage("Tried to access solution information for SDP %d ahead of solving!\n", sdpisolver->sdpcounter);  \
                            return SCIP_LPERROR;                                                             \
                         }                                                                                   \
                      }                                                                                      \
                      while( FALSE )

This will be called in all functions that want to access solution information to check if the problem was solved since the last change of the problem.

Definition at line 133 of file sdpisolver_dsdp.c.

Referenced by SCIPsdpiSolverGetObjval(), SCIPsdpiSolverGetPrimalBoundVars(), SCIPsdpiSolverGetSol(), and SCIPsdpiSolverGetSolFeasibility().

#define CHECK_IF_SOLVED_BOOL ( sdpisolver )

Value:

do                                                                      \
                      {                                                                                      \
                         if (!(sdpisolver->solved))                                                          \
                         {                                                                                   \
                            SCIPerrorMessage("Tried to access solution information for SDP %d ahead of solving!\n", sdpisolver->sdpcounter);  \
                            return FALSE;                                                                    \
                         }                                                                                   \
                      }                                                                                      \
                      while( FALSE )

This is the same as CHECK_IF_SOLVED, but will be called for methods returning a bool instead of a SCIP_RETURNCODE.

Definition at line 144 of file sdpisolver_dsdp.c.

Referenced by SCIPsdpiSolverFeasibilityKnown(), SCIPsdpiSolverIsDualFeasible(), SCIPsdpiSolverIsDualInfeasible(), SCIPsdpiSolverIsDualUnbounded(), SCIPsdpiSolverIsIterlimExc(), SCIPsdpiSolverIsPrimalFeasible(), SCIPsdpiSolverIsPrimalInfeasible(), and SCIPsdpiSolverIsPrimalUnbounded().

Typedef Documentation

typedef struct Timings Timings

data used for checking the timelimit

Function Documentation

static int compLowerTriangPos	(	int	i,
		int	j
	)

static

for given row and column (i,j) computes the position in the lower triangular part numbered from 0 to n(n+1)/2 - 1, this needs to be called for i >= j

Parameters

i	row index
j	column index

Definition at line 214 of file sdpisolver_dsdp.c.

Referenced by SCIPsdpiSolverLoadAndSolveWithPenalty().

static SCIP_Bool isFixed	(	SCIP_SDPISOLVER *	sdpisolver,
		SCIP_Real	lb,
		SCIP_Real	ub
	)

static

test if a lower bound lb is not smaller than an upper bound ub, meaning that lb > ub - epsilon

Parameters

sdpisolver	pointer to an SDP-solver interface
lb	lower bound
ub	upper bound

Definition at line 228 of file sdpisolver_dsdp.c.

Referenced by SCIPsdpiSolverLoadAndSolveWithPenalty().

static void sortColRow	(	int *	row,
		int *	col,
		SCIP_Real *	val,
		int	length
	)

static

sort the given row, col and val arrays first by non-decreasing col-indices, than for those with identical col-indices by non-increasing row-indices

Parameters

row	row indices
col	column indices
val	values
length	length of the given arrays

Definition at line 244 of file sdpisolver_dsdp.c.

Referenced by SCIPsdpiSolverLoadAndSolveWithPenalty().

static int checkTimeLimitDSDP	(	DSDP	dsdp,
		void *	ctx
	)

static

check the time limit after each iteration in DSDP

Parameters

dsdp	DSDP-pointer
ctx	pointer to data of iteration monitor

Definition at line 272 of file sdpisolver_dsdp.c.

References DSDP_CALL, and TIMEOFDAY_CALL.

Referenced by SCIPsdpiSolverLoadAndSolveWithPenalty().

static int checkGapSetPreoptimalSol	(	DSDP	dsdp,
		void *	ctx
	)

static

check gap and set preoptimal solution if small enough

Parameters

dsdp	DSDP-pointer
ctx	pointer to data of iteration monitor

Definition at line 307 of file sdpisolver_dsdp.c.

References DSDP_CALL.

Referenced by SCIPsdpiSolverLoadAndSolveWithPenalty().

const char* SCIPsdpiSolverGetSolverName ( void )

gets name and version (if available) of SDP-solver

Definition at line 353 of file sdpisolver_dsdp.c.

const char* SCIPsdpiSolverGetSolverDesc ( void )

gets description of SDP-solver (developer, webpage, ...)

Definition at line 361 of file sdpisolver_dsdp.c.

void* SCIPsdpiSolverGetSolverPointer ( SCIP_SDPISOLVER * sdpisolver )

gets pointer to SDP-solver - use only with great care

The behavior of this function depends on the solver and its use is therefore only recommended if you really know what you are doing. In general, it returns a pointer to the SDP-solver object.

Parameters

sdpisolver pointer to an SDP-solver interface

Definition at line 374 of file sdpisolver_dsdp.c.

SCIP_Real SCIPsdpiSolverGetDefaultSdpiSolverFeastol ( void )

gets default feasibility tolerance for SDP-solver in SCIP-SDP

Definition at line 383 of file sdpisolver_dsdp.c.

SCIP_Real SCIPsdpiSolverGetDefaultSdpiSolverGaptol ( void )

gets default duality gap tolerance for SDP-solver in SCIP-SDP

Definition at line 392 of file sdpisolver_dsdp.c.

int SCIPsdpiSolverGetDefaultSdpiSolverNpenaltyIncreases ( void )

gets default number of increases of penalty parameter for SDP-solver in SCIP-SDP

Definition at line 400 of file sdpisolver_dsdp.c.

SCIP_Bool SCIPsdpiSolverDoesWarmstartNeedPrimal ( void )

Should primal solution values be saved for warmstarting purposes?

Definition at line 408 of file sdpisolver_dsdp.c.

SCIP_RETCODE SCIPsdpiSolverCreate	(	SCIP_SDPISOLVER **	sdpisolver,
		SCIP_MESSAGEHDLR *	messagehdlr,
		BMS_BLKMEM *	blkmem,
		BMS_BUFMEM *	bufmem
	)

creates an SDP solver interface

Parameters

sdpisolver	pointer to an SDP-solver interface
messagehdlr	message handler to use for printing messages, or NULL
blkmem	block memory
bufmem	buffer memory

Definition at line 426 of file sdpisolver_dsdp.c.

References BMS_CALL, SCIP_SDPSOLVERSETTING_UNSOLVED, and SCIPsdpiSolverInfinity().

SCIP_RETCODE SCIPsdpiSolverFree ( SCIP_SDPISOLVER ** sdpisolver )

deletes an SDP solver interface

Parameters

sdpisolver pointer to an SDP-solver interface

Definition at line 484 of file sdpisolver_dsdp.c.

References DSDP_CALL.

SCIP_RETCODE SCIPsdpiSolverIncreaseCounter ( SCIP_SDPISOLVER * sdpisolver )

increases the SDP-Counter

Parameters

sdpisolver SDP-solver interface

Definition at line 517 of file sdpisolver_dsdp.c.

SCIP_RETCODE SCIPsdpiSolverResetCounter ( SCIP_SDPISOLVER * sdpisolver )

reset the SDP-Counter to zero

Parameters

sdpisolver SDP-solver interface

Definition at line 529 of file sdpisolver_dsdp.c.

SCIP_RETCODE SCIPsdpiSolverLoadAndSolve	(	SCIP_SDPISOLVER *	sdpisolver,
		int	nvars,
		SCIP_Real *	obj,
		SCIP_Real *	lb,
		SCIP_Real *	ub,
		int	nsdpblocks,
		int *	sdpblocksizes,
		int *	sdpnblockvars,
		int	sdpconstnnonz,
		int *	sdpconstnblocknonz,
		int **	sdpconstrow,
		int **	sdpconstcol,
		SCIP_Real **	sdpconstval,
		int	sdpnnonz,
		int **	sdpnblockvarnonz,
		int **	sdpvar,
		int ***	sdprow,
		int ***	sdpcol,
		SCIP_Real ***	sdpval,
		int **	indchanges,
		int *	nremovedinds,
		int *	blockindchanges,
		int	nremovedblocks,
		int	nlpcons,
		int	noldlpcons,
		SCIP_Real *	lplhs,
		SCIP_Real *	lprhs,
		int *	rownactivevars,
		int	lpnnonz,
		int *	lprow,
		int *	lpcol,
		SCIP_Real *	lpval,
		SCIP_Real *	starty,
		int *	startZnblocknonz,
		int **	startZrow,
		int **	startZcol,
		SCIP_Real **	startZval,
		int *	startXnblocknonz,
		int **	startXrow,
		int **	startXcol,
		SCIP_Real **	startXval,
		SCIP_SDPSOLVERSETTING	startsettings,
		SCIP_Real	timelimit
	)

loads and solves an SDP

For the non-constant SDP- and the LP-part, the original arrays before fixings should be given, for the constant SDP-part the arrays AFTER fixings should be given. In addition, an array needs to be given, that for every block and every row/col index within that block either has value -1, meaning that this index should be deleted, or a non-negative integer stating the number of indices before it that are to be deleated, meaning that this index will be decreased by that number, in addition to that the total number of deleted indices for each block should be given. Optionally an array start may be given with a starting point for the solver (if this is NULL then the solver should start from scratch).

Warning: Depending on the solver, the given lp arrays might get sorted in their original position.

Note: starting point needs to be given with original indices (before any local presolving), last block should be the LP block with indices lhs(row0), rhs(row0), lhs(row1), ..., lb(var1), ub(var1), lb(var2), ... independant of some lhs/rhs being infinity (the starting point will later be adjusted accordingly)

Parameters

sdpisolver	SDP-solver interface
nvars	number of variables
obj	objective coefficients of variables
lb	lower bounds of variables
ub	upper bounds of variables
nsdpblocks	number of SDP-blocks
sdpblocksizes	sizes of the SDP-blocks (may be NULL if nsdpblocks = sdpconstnnonz = sdpnnonz = 0)
sdpnblockvars	number of variables that exist in each block
sdpconstnnonz	number of nonzero elements in the constant matrices of the SDP-blocks AFTER FIXINGS
sdpconstnblocknonz	number of nonzeros for each variable in the constant part, also the i-th entry gives the number of entries of sdpconst row/col/val [i] AFTER FIXINGS
sdpconstrow	pointers to row-indices for each block AFTER FIXINGS
sdpconstcol	pointers to column-indices for each block AFTER FIXINGS
sdpconstval	pointers to the values of the nonzeros for each block AFTER FIXINGS
sdpnnonz	number of nonzero elements in the SDP-constraint-matrix
sdpnblockvarnonz	entry [i][j] gives the number of nonzeros for block i and variable j, this is exactly the number of entries of sdp row/col/val [i][j]
sdpvar	sdpvar[i][j] gives the sdp-index of the j-th variable (according to the sorting for row/col/val) in the i-th block
sdprow	pointer to the row-indices for each block and variable
sdpcol	pointer to the column-indices for each block and variable
sdpval	values of SDP-constraint-matrix entries (may be NULL if sdpnnonz = 0)
indchanges	changes needed to be done to the indices, if indchanges[block][nonz]=-1, then the index can be removed, otherwise it gives the number of indices removed before this
nremovedinds	the number of rows/cols to be fixed for each block
blockindchanges	block indizes will be modified by these, see indchanges
nremovedblocks	number of empty blocks that should be removed
nlpcons	number of active (at least two nonzeros) LP-constraints
noldlpcons	number of LP-constraints including those with less than two active nonzeros
lplhs	left-hand sides of active LP-rows after fixings (may be NULL if nlpcons = 0)
lprhs	right-hand sides of active LP-rows after fixings (may be NULL if nlpcons = 0)
rownactivevars	number of active variables for each LP-constraint
lpnnonz	number of nonzero elements in the LP-constraint-matrix
lprow	row-index for each entry in lpval-array, might get sorted (may be NULL if lpnnonz = 0)
lpcol	column-index for each entry in lpval-array, might get sorted (may be NULL if lpnnonz = 0)
lpval	values of LP-constraint-matrix entries, might get sorted (may be NULL if lpnnonz = 0)
starty	NULL or dual vector y as starting point for the solver, this should have length nvars
startZnblocknonz	dual matrix Z = sum Ai yi as starting point for the solver: number of nonzeros for each block, also length of corresponding row/col/val-arrays; or NULL
startZrow	dual matrix Z = sum Ai yi as starting point for the solver: row indices for each block; may be NULL if startZnblocknonz = NULL
startZcol	dual matrix Z = sum Ai yi as starting point for the solver: column indices for each block; may be NULL if startZnblocknonz = NULL
startZval	dual matrix Z = sum Ai yi as starting point for the solver: values for each block; may be NULL if startZnblocknonz = NULL
startXnblocknonz	primal matrix X as starting point for the solver: number of nonzeros for each block, also length of corresponding row/col/val-arrays; or NULL
startXrow	primal matrix X as starting point for the solver: row indices for each block; may be NULL if startXnblocknonz = NULL
startXcol	primal matrix X as starting point for the solver: column indices for each block; may be NULL if startXnblocknonz = NULL
startXval	primal matrix X as starting point for the solver: values for each block; may be NULL if startXnblocknonz = NULL
startsettings	settings used to start with in SDPA, currently not used for DSDP ans MOSEK, set this to SCIP_SDPSOLVERSETTING_UNSOLVED to ignore it and start from scratch
timelimit	after this many seconds solving will be aborted (currently only implemented for DSDP and MOSEK)

Definition at line 566 of file sdpisolver_dsdp.c.

References SCIPsdpiSolverLoadAndSolveWithPenalty().

SCIP_RETCODE SCIPsdpiSolverLoadAndSolveWithPenalty	(	SCIP_SDPISOLVER *	sdpisolver,
		SCIP_Real	penaltyparam,
		SCIP_Bool	withobj,
		SCIP_Bool	rbound,
		int	nvars,
		SCIP_Real *	obj,
		SCIP_Real *	lb,
		SCIP_Real *	ub,
		int	nsdpblocks,
		int *	sdpblocksizes,
		int *	sdpnblockvars,
		int	sdpconstnnonz,
		int *	sdpconstnblocknonz,
		int **	sdpconstrow,
		int **	sdpconstcol,
		SCIP_Real **	sdpconstval,
		int	sdpnnonz,
		int **	sdpnblockvarnonz,
		int **	sdpvar,
		int ***	sdprow,
		int ***	sdpcol,
		SCIP_Real ***	sdpval,
		int **	indchanges,
		int *	nremovedinds,
		int *	blockindchanges,
		int	nremovedblocks,
		int	nlpcons,
		int	noldlpcons,
		SCIP_Real *	lplhs,
		SCIP_Real *	lprhs,
		int *	rownactivevars,
		int	lpnnonz,
		int *	lprow,
		int *	lpcol,
		SCIP_Real *	lpval,
		SCIP_Real *	starty,
		int *	startZnblocknonz,
		int **	startZrow,
		int **	startZcol,
		SCIP_Real **	startZval,
		int *	startXnblocknonz,
		int **	startXrow,
		int **	startXcol,
		SCIP_Real **	startXval,
		SCIP_SDPSOLVERSETTING	startsettings,
		SCIP_Real	timelimit,
		SCIP_Bool *	feasorig,
		SCIP_Bool *	penaltybound
	)

loads and solves an SDP using a penalty formulation

The penalty formulation of the SDP is:

$\begin{eqnarray*} \min & & b^T y + \Gamma r \\ \mbox{s.t.} & & \sum_{j=1}^n A_j^i y_j - A_0^i + r \cdot \mathbb{I} \succeq 0 \quad \forall i \leq m \\ & & Dy + r \cdot \mathbb{I} \geq d \\ & & l \leq y \leq u \\ & & r \geq 0.\end{eqnarray*}$

Alternatively withobj can be set to false to set b to 0 and only check for feasibility (if the optimal objective value is bigger than 0 the problem is infeasible, otherwise it's feasible), and rbound can be set to false to remove the non-negativity condition on r. For the non-constant SDP- and the LP-part the original arrays before fixings should be given, for the constant SDP-part the arrays AFTER fixings should be given. In addition, an array needs to be given, that for every block and every row/col index within that block either has value -1, meaning that this index should be deleted, or a non-negative integer stating the number of indices before it that are to be deleated, meaning that this index will be decreased by that number. Moreover, the total number of deleted indices for each block should be given. An optional starting point for the solver may be given; if it is NULL, the solver will start from scratch.

Warning: Depending on the solver, the given lp arrays might get sorted in their original position.

Note: starting point needs to be given with original indices (before any local presolving), last block should be the LP block with indices lhs(row0), rhs(row0), lhs(row1), ..., lb(var1), ub(var1), lb(var2), ... independant of some lhs/rhs being infinity (the starting point will later be adjusted accordingly)

Parameters

sdpisolver	SDP-solver interface
penaltyparam	the Gamma above, needs to be >= 0
withobj	if this is false the objective is set to 0
rbound	should r be non-negative ?
nvars	number of variables
obj	objective coefficients of variables
lb	lower bounds of variables
ub	upper bounds of variables
nsdpblocks	number of SDP-blocks
sdpblocksizes	sizes of the SDP-blocks (may be NULL if nsdpblocks = sdpconstnnonz = sdpnnonz = 0)
sdpnblockvars	number of variables that exist in each block
sdpconstnnonz	number of nonzero elements in the constant matrices of the SDP-blocks AFTER FIXINGS
sdpconstnblocknonz	number of nonzeros for each variable in the constant part, also the i-th entry gives the number of entries of sdpconst row/col/val [i] AFTER FIXINGS
sdpconstrow	pointers to row-indices for each block AFTER FIXINGS
sdpconstcol	pointers to column-indices for each block AFTER FIXINGS
sdpconstval	pointers to the values of the nonzeros for each block AFTER FIXINGS
sdpnnonz	number of nonzero elements in the SDP-constraint-matrix
sdpnblockvarnonz	entry [i][j] gives the number of nonzeros for block i and variable j, this is exactly the number of entries of sdp row/col/val [i][j]
sdpvar	sdpvar[i][j] gives the sdp-index of the j-th variable (according to the sorting for row/col/val) in the i-th block
sdprow	pointer to the row-indices for each block and variable
sdpcol	pointer to the column-indices for each block and variable
sdpval	values of SDP-constraint-matrix entries (may be NULL if sdpnnonz = 0)
indchanges	changes needed to be done to the indices, if indchanges[block][nonz]=-1, then the index can be removed, otherwise it gives the number of indices removed before this
nremovedinds	the number of rows/cols to be fixed for each block
blockindchanges	block indizes will be modified by these, see indchanges
nremovedblocks	number of empty blocks that should be removed
nlpcons	number of active (at least two nonzeros) LP-constraints
noldlpcons	number of LP-constraints including those with less than two active nonzeros
lplhs	left-hand sides of active LP-rows after fixings (may be NULL if nlpcons = 0)
lprhs	right-hand sides of active LP-rows after fixings (may be NULL if nlpcons = 0)
rownactivevars	number of active variables for each LP-constraint
lpnnonz	number of nonzero elements in the LP-constraint-matrix
lprow	row-index for each entry in lpval-array, might get sorted (may be NULL if lpnnonz = 0)
lpcol	column-index for each entry in lpval-array, might get sorted (may be NULL if lpnnonz = 0)
lpval	values of LP-constraint-matrix entries, might get sorted (may be NULL if lpnnonz = 0)
starty	NULL or dual vector y as starting point for the solver, this should have length nvars
startZnblocknonz	dual matrix Z = sum Ai yi as starting point for the solver: number of nonzeros for each block, also length of corresponding row/col/val-arrays; or NULL
startZrow	dual matrix Z = sum Ai yi as starting point for the solver: row indices for each block; may be NULL if startZnblocknonz = NULL
startZcol	dual matrix Z = sum Ai yi as starting point for the solver: column indices for each block; may be NULL if startZnblocknonz = NULL
startZval	dual matrix Z = sum Ai yi as starting point for the solver: values for each block; may be NULL if startZnblocknonz = NULL
startXnblocknonz	primal matrix X as starting point for the solver: number of nonzeros for each block, also length of corresponding row/col/val-arrays; or NULL
startXrow	primal matrix X as starting point for the solver: row indices for each block; may be NULL if startXnblocknonz = NULL
startXcol	primal matrix X as starting point for the solver: column indices for each block; may be NULL if startXnblocknonz = NULL
startXval	primal matrix X as starting point for the solver: values for each block; may be NULL if startXnblocknonz = NULL
startsettings	settings used to start with in SDPA, currently not used for DSDP and MOSEK, set this to SCIP_SDPSOLVERSETTING_UNSOLVED to ignore it and start from scratch
timelimit	after this many seconds solving will be aborted (currently only implemented for DSDP and MOSEK)
feasorig	pointer to store if the solution to the penalty-formulation is feasible for the original problem (may be NULL if penaltyparam = 0)
penaltybound	pointer to store if the primal solution reached the bound Tr(X) <= penaltyparam in the primal problem, this is also an indication of the penalty parameter being to small (may be NULL if not needed)

Definition at line 654 of file sdpisolver_dsdp.c.

References BMS_CALL, checkGapSetPreoptimalSol(), checkTimeLimitDSDP(), compLowerTriangPos(), DSDP_CALL, DSDP_CALLM, INFEASFEASTOLCHANGE, INFEASMINFEASTOL, isFixed(), PENALTYBOUNDTOL, SCIP_SDPSOLVERSETTING_FAST, SCIP_SDPSOLVERSETTING_PENALTY, SCIPsdpiSolverGetSol(), SCIPsdpiSolverInfinity(), SCIPsdpiSolverIsAcceptable(), SCIPsdpiSolverIsDualFeasible(), SCIPsdpiSolverIsInfinity(), SCIPsdpSolcheckerCheck(), sortColRow(), and TIMEOFDAY_CALL.

Referenced by SCIPsdpiSolverLoadAndSolve().

SCIP_Bool SCIPsdpiSolverWasSolved ( SCIP_SDPISOLVER * sdpisolver )

returns whether a solve method was called after the last modification of the SDP

Parameters

sdpisolver pointer to SDP-solver interface

Definition at line 1731 of file sdpisolver_dsdp.c.

SCIP_Bool SCIPsdpiSolverFeasibilityKnown ( SCIP_SDPISOLVER * sdpisolver )

returns true if the solver could determine whether the problem is feasible

So it returns true if the solver knows that the problem is feasible/infeasible/unbounded, it returns false if the solver does not know anything about the feasibility status and thus the functions IsPrimalFeasible etc. should not be used.

Parameters

sdpisolver pointer to SDP-solver interface

Definition at line 1745 of file sdpisolver_dsdp.c.

References CHECK_IF_SOLVED_BOOL, and DSDP_CALL_BOOL.

SCIP_RETCODE SCIPsdpiSolverGetSolFeasibility	(	SCIP_SDPISOLVER *	sdpisolver,
		SCIP_Bool *	primalfeasible,
		SCIP_Bool *	dualfeasible
	)

gets information about primal and dual feasibility of the current SDP solution

Parameters

sdpisolver	pointer to an SDP-solver interface
primalfeasible	stores primal feasibility status
dualfeasible	stores dual feasibility status

Definition at line 1763 of file sdpisolver_dsdp.c.

References CHECK_IF_SOLVED, and DSDP_CALL.

SCIP_Bool SCIPsdpiSolverIsPrimalUnbounded ( SCIP_SDPISOLVER * sdpisolver )

returns TRUE iff SDP is proven to be primal unbounded, returns FALSE with a debug-message if the solver could not determine feasibility

Parameters

sdpisolver pointer to SDP-solver interface

Definition at line 1805 of file sdpisolver_dsdp.c.

References CHECK_IF_SOLVED_BOOL, and DSDP_CALL_BOOL.

SCIP_Bool SCIPsdpiSolverIsPrimalInfeasible ( SCIP_SDPISOLVER * sdpisolver )

returns TRUE iff SDP is proven to be primal infeasible, returns FALSE with a debug-message if the solver could not determine feasibility

Parameters

sdpisolver pointer to SDP-solver interface

Definition at line 1831 of file sdpisolver_dsdp.c.

References CHECK_IF_SOLVED_BOOL, and DSDP_CALL_BOOL.

SCIP_Bool SCIPsdpiSolverIsPrimalFeasible ( SCIP_SDPISOLVER * sdpisolver )

returns TRUE iff SDP is proven to be primal feasible, returns FALSE with a debug-message if the solver could not determine feasibility

Parameters

sdpisolver pointer to SDP-solver interface

Definition at line 1857 of file sdpisolver_dsdp.c.

References CHECK_IF_SOLVED_BOOL, and DSDP_CALL_BOOL.

Referenced by SCIPsdpiSolverIsOptimal().

SCIP_Bool SCIPsdpiSolverIsDualUnbounded ( SCIP_SDPISOLVER * sdpisolver )

returns TRUE iff SDP is proven to be dual unbounded, returns FALSE with a debug-message if the solver could not determine feasibility

Parameters

sdpisolver pointer to SDP-solver interface

Definition at line 1880 of file sdpisolver_dsdp.c.

References CHECK_IF_SOLVED_BOOL, and DSDP_CALL_BOOL.

SCIP_Bool SCIPsdpiSolverIsDualInfeasible ( SCIP_SDPISOLVER * sdpisolver )

returns TRUE iff SDP is proven to be dual infeasible, returns FALSE with a debug-message if the solver could not determine feasibility

Parameters

sdpisolver pointer to SDP-solver interface

Definition at line 1903 of file sdpisolver_dsdp.c.

References CHECK_IF_SOLVED_BOOL, and DSDP_CALL_BOOL.

SCIP_Bool SCIPsdpiSolverIsDualFeasible ( SCIP_SDPISOLVER * sdpisolver )

returns TRUE iff SDP is proven to be dual feasible, returns FALSE with a debug-message if the solver could not determine feasibility

Parameters

sdpisolver pointer to SDP-solver interface

Definition at line 1927 of file sdpisolver_dsdp.c.

References CHECK_IF_SOLVED_BOOL, and DSDP_CALL_BOOL.

Referenced by SCIPsdpiSolverIsOptimal(), and SCIPsdpiSolverLoadAndSolveWithPenalty().

SCIP_Bool SCIPsdpiSolverIsConverged ( SCIP_SDPISOLVER * sdpisolver )

returns TRUE iff the solver converged

Parameters

sdpisolver pointer to SDP-solver interface

Definition at line 1950 of file sdpisolver_dsdp.c.

References DSDP_CALL_BOOL.

Referenced by SCIPsdpiSolverIsAcceptable(), and SCIPsdpiSolverIsOptimal().

SCIP_Bool SCIPsdpiSolverIsObjlimExc ( SCIP_SDPISOLVER * sdpisolver )

returns TRUE iff the objective limit was reached

Parameters

sdpisolver pointer to SDP-solver interface

Definition at line 1973 of file sdpisolver_dsdp.c.

SCIP_Bool SCIPsdpiSolverIsIterlimExc ( SCIP_SDPISOLVER * sdpisolver )

returns TRUE iff the iteration limit was reached

Parameters

sdpisolver pointer to SDP-solver interface

Definition at line 1984 of file sdpisolver_dsdp.c.

References CHECK_IF_SOLVED_BOOL, and DSDP_CALL_BOOL.

SCIP_Bool SCIPsdpiSolverIsTimelimExc ( SCIP_SDPISOLVER * sdpisolver )

returns TRUE iff the time limit was reached

Parameters

sdpisolver pointer to SDP-solver interface

Definition at line 2002 of file sdpisolver_dsdp.c.

int SCIPsdpiSolverGetInternalStatus ( SCIP_SDPISOLVER * sdpisolver )

returns the internal solution status of the solver, which has the following meaning:
-1: solver was not started
0: converged
1: infeasible start
2: numerical problems
3: objective limit reached
4: iteration limit reached
5: time limit reached
6: user termination
7: other

Parameters

sdpisolver pointer to SDP-solver interface

Definition at line 2021 of file sdpisolver_dsdp.c.

SCIP_Bool SCIPsdpiSolverIsOptimal ( SCIP_SDPISOLVER * sdpisolver )

returns TRUE iff SDP was solved to optimality, meaning the solver converged and returned primal and dual feasible solutions

Parameters

sdpisolver pointer to SDP-solver interface

Definition at line 2076 of file sdpisolver_dsdp.c.

References SCIPsdpiSolverIsConverged(), SCIPsdpiSolverIsDualFeasible(), and SCIPsdpiSolverIsPrimalFeasible().

SCIP_Bool SCIPsdpiSolverIsAcceptable ( SCIP_SDPISOLVER * sdpisolver )

returns TRUE iff SDP was solved to optimality or some other status was reached that is still acceptable inside a Branch & Bound framework

Parameters

sdpisolver pointer to SDP-solver interface

Definition at line 2086 of file sdpisolver_dsdp.c.

References SCIPsdpiSolverIsConverged().

Referenced by SCIPsdpiSolverLoadAndSolveWithPenalty(), and SCIPsdpiSolverSettingsUsed().

SCIP_RETCODE SCIPsdpiSolverIgnoreInstability	(	SCIP_SDPISOLVER *	sdpisolver,
		SCIP_Bool *	success
	)

tries to reset the internal status of the SDP-solver in order to ignore an instability of the last solving call

Parameters

sdpisolver	pointer to an SDP-solver interface
success	pointer to store, whether the instability could be ignored

Definition at line 2096 of file sdpisolver_dsdp.c.

SCIP_RETCODE SCIPsdpiSolverGetObjval	(	SCIP_SDPISOLVER *	sdpisolver,
		SCIP_Real *	objval
	)

gets objective value of solution

Parameters

sdpisolver	pointer to an SDP-solver interface
objval	pointer to store the objective value

Definition at line 2106 of file sdpisolver_dsdp.c.

References BMS_CALL, CHECK_IF_SOLVED, and DSDP_CALL.

Referenced by SCIPsdpiSolverGetSol().

SCIP_RETCODE SCIPsdpiSolverGetSol	(	SCIP_SDPISOLVER *	sdpisolver,
		SCIP_Real *	objval,
		SCIP_Real *	dualsol,
		int *	dualsollength
	)

gets dual solution vector for feasible SDPs

If dualsollength isn't equal to the number of variables this will return the needed length and a debug message is thrown.

Parameters

sdpisolver	pointer to an SDP-solver interface
objval	pointer to store the objective value, may be NULL if not needed
dualsol	pointer to store the dual solution vector, may be NULL if not needed
dualsollength	length of the dual sol vector, must be 0 if dualsol is NULL, if this is less than the number of variables in the SDP, a DebugMessage will be thrown and this is set to the needed value

Definition at line 2157 of file sdpisolver_dsdp.c.

References BMS_CALL, CHECK_IF_SOLVED, DSDP_CALL, and SCIPsdpiSolverGetObjval().

Referenced by SCIPsdpiSolverLoadAndSolveWithPenalty().

SCIP_RETCODE SCIPsdpiSolverGetPreoptimalPrimalNonzeros	(	SCIP_SDPISOLVER *	sdpisolver,
		int	nblocks,
		int *	startXnblocknonz
	)

return number of nonzeros for each block of the primal solution matrix X for the preoptimal solution

Parameters

sdpisolver	pointer to an SDP-solver interface
nblocks	length of startXnblocknonz (should be nsdpblocks + 1)
startXnblocknonz	pointer to store number of nonzeros for row/col/val-arrays in each block or first entry -1 if no primal solution is available

Definition at line 2236 of file sdpisolver_dsdp.c.

SCIP_RETCODE SCIPsdpiSolverGetPreoptimalSol	(	SCIP_SDPISOLVER *	sdpisolver,
		SCIP_Bool *	success,
		SCIP_Real *	dualsol,
		int *	dualsollength,
		int	nblocks,
		int *	startXnblocknonz,
		int **	startXrow,
		int **	startXcol,
		SCIP_Real **	startXval
	)

gets preoptimal dual solution vector and primal matrix for warmstarting purposes

Note: last block will be the LP block (if one exists) with indices lhs(row0), rhs(row0), lhs(row1), ..., lb(var1), ub(var1), lb(var2), ... independant of some lhs/rhs being infinity; If dualsollength isn't equal to the number of variables this will return the needed length and a debug message is thrown.; If the allocated memory for row/col/val is insufficient, a debug message will be thrown and the neccessary amount is returned in startXnblocknonz

Parameters

sdpisolver	pointer to an SDP-solver interface
success	could a preoptimal solution be returned ?
dualsol	pointer to store the dual solution vector, may be NULL if not needed
dualsollength	length of the dual sol vector, must be 0 if dualsol is NULL, if this is less than the number of variables in the SDP, a DebugMessage will be thrown and this is set to the needed value
nblocks	length of startXnblocknonz (should be nsdpblocks + 1) or -1 if no primal matrix should be returned
startXnblocknonz	input: allocated memory for row/col/val-arrays in each block (or NULL if nblocks = -1) output: number of nonzeros in each block or first entry -1 if no primal solution is available
startXrow	pointer to store row indices of X (or NULL if nblocks = -1)
startXcol	pointer to store column indices of X (or NULL if nblocks = -1)
startXval	pointer to store values of X (or NULL if nblocks = -1)

Definition at line 2255 of file sdpisolver_dsdp.c.

SCIP_RETCODE SCIPsdpiSolverGetPrimalBoundVars	(	SCIP_SDPISOLVER *	sdpisolver,
		SCIP_Real *	lbvars,
		SCIP_Real *	ubvars,
		int *	arraylength
	)

gets the primal variables corresponding to the lower and upper variable-bounds in the dual problem

The last input should specify the length of the arrays. If this is less than the number of variables, the needed length will be returned and a debug message thrown.

Note: If a variable is either fixed or unbounded in the dual problem, a zero will be returned for the non-existent primal variable.

Parameters

sdpisolver	pointer to an SDP-solver interface
lbvars	pointer to store the values of the variables corresponding to lower bounds in the dual problems
ubvars	pointer to store the values of the variables corresponding to upper bounds in the dual problems
arraylength	input: length of lbvars and ubvars output: number of elements inserted into lbvars/ubvars (or needed length if it wasn't sufficient)

Definition at line 2323 of file sdpisolver_dsdp.c.

References BMS_CALL, CHECK_IF_SOLVED, and DSDP_CALL.

SCIP_RETCODE SCIPsdpiSolverGetPrimalNonzeros	(	SCIP_SDPISOLVER *	sdpisolver,
		int	nblocks,
		int *	startXnblocknonz
	)

return number of nonzeros for each block of the primal solution matrix X (including lp block)

Parameters

sdpisolver	pointer to an SDP-solver interface
nblocks	length of startXnblocknonz (should be nsdpblocks + 1)
startXnblocknonz	pointer to store number of nonzeros for row/col/val-arrays in each block

Definition at line 2382 of file sdpisolver_dsdp.c.

SCIP_RETCODE SCIPsdpiSolverGetPrimalMatrix	(	SCIP_SDPISOLVER *	sdpisolver,
		int	nblocks,
		int *	startXnblocknonz,
		int **	startXrow,
		int **	startXcol,
		SCIP_Real **	startXval
	)

returns the primal matrix X

Note: last block will be the LP block (if one exists) with indices lhs(row0), rhs(row0), lhs(row1), ..., lb(var1), ub(var1), lb(var2), ... independant of some lhs/rhs being infinity; If the allocated memory for row/col/val is insufficient, a debug message will be thrown and the neccessary amount is returned in startXnblocknonz

Parameters

sdpisolver	pointer to an SDP-solver interface
nblocks	length of startXnblocknonz (should be nsdpblocks + 1)
startXnblocknonz	input: allocated memory for row/col/val-arrays in each block output: number of nonzeros in each block
startXrow	pointer to store row indices of X
startXcol	pointer to store column indices of X
startXval	pointer to store values of X

Definition at line 2396 of file sdpisolver_dsdp.c.

SCIP_Real SCIPsdpiSolverGetMaxPrimalEntry ( SCIP_SDPISOLVER * sdpisolver )

return the maximum absolute value of the optimal primal matrix

Parameters

sdpisolver pointer to an SDP-solver interface

Definition at line 2411 of file sdpisolver_dsdp.c.

SCIP_RETCODE SCIPsdpiSolverGetIterations	(	SCIP_SDPISOLVER *	sdpisolver,
		int *	iterations
	)

gets the number of SDP iterations of the last solve call

Parameters

sdpisolver	pointer to an SDP-solver interface
iterations	pointer to store the number of iterations of the last solve call

Definition at line 2420 of file sdpisolver_dsdp.c.

SCIP_RETCODE SCIPsdpiSolverGetSdpCalls	(	SCIP_SDPISOLVER *	sdpisolver,
		int *	calls
	)

gets the number of calls to the SDP-solver for the last solve call

Parameters

sdpisolver	pointer to an SDP-solver interface
calls	pointer to store the number of calls to the SDP-solver for the last solve call

Definition at line 2437 of file sdpisolver_dsdp.c.

SCIP_RETCODE SCIPsdpiSolverSettingsUsed	(	SCIP_SDPISOLVER *	sdpisolver,
		SCIP_SDPSOLVERSETTING *	usedsetting
	)

gets the settings used by the SDP solver for the last solve call

Parameters

sdpisolver	SDP-solver interface
usedsetting	the setting used by the SDP-solver

Definition at line 2454 of file sdpisolver_dsdp.c.

References SCIP_SDPSOLVERSETTING_UNSOLVED, and SCIPsdpiSolverIsAcceptable().

SCIP_Real SCIPsdpiSolverInfinity ( SCIP_SDPISOLVER * sdpisolver )

returns value treated as infinity in the SDP-solver

Parameters

sdpisolver pointer to an SDP-solver interface

Definition at line 2483 of file sdpisolver_dsdp.c.

Referenced by SCIPsdpiSolverCreate(), SCIPsdpiSolverIsInfinity(), and SCIPsdpiSolverLoadAndSolveWithPenalty().

SCIP_Bool SCIPsdpiSolverIsInfinity	(	SCIP_SDPISOLVER *	sdpisolver,
		SCIP_Real	val
	)

checks if given value is treated as (plus or minus) infinity in the SDP-solver

Parameters

sdpisolver	pointer to an SDP-solver interface
val	value to be checked for infinity

Definition at line 2491 of file sdpisolver_dsdp.c.

References SCIPsdpiSolverInfinity().

Referenced by SCIPsdpiSolverLoadAndSolveWithPenalty().

SCIP_RETCODE SCIPsdpiSolverGetRealpar	(	SCIP_SDPISOLVER *	sdpisolver,
		SCIP_SDPPARAM	type,
		SCIP_Real *	dval
	)

gets floating point parameter of SDP-Solver

Parameters

sdpisolver	pointer to an SDP-solver interface
type	parameter number
dval	buffer to store the parameter value

Definition at line 2500 of file sdpisolver_dsdp.c.

References SCIP_SDPPAR_EPSILON, SCIP_SDPPAR_FEASTOL, SCIP_SDPPAR_GAPTOL, SCIP_SDPPAR_OBJLIMIT, SCIP_SDPPAR_PENALTYPARAM, SCIP_SDPPAR_SDPSOLVERFEASTOL, and SCIP_SDPPAR_WARMSTARTPOGAP.

SCIP_RETCODE SCIPsdpiSolverSetRealpar	(	SCIP_SDPISOLVER *	sdpisolver,
		SCIP_SDPPARAM	type,
		SCIP_Real	dval
	)

sets floating point parameter of SDP-Solver

Parameters

sdpisolver	pointer to an SDP-solver interface
type	parameter number
dval	parameter value

Definition at line 2540 of file sdpisolver_dsdp.c.

References SCIP_SDPPAR_EPSILON, SCIP_SDPPAR_FEASTOL, SCIP_SDPPAR_GAPTOL, SCIP_SDPPAR_LAMBDASTAR, SCIP_SDPPAR_OBJLIMIT, SCIP_SDPPAR_PENALTYPARAM, SCIP_SDPPAR_SDPSOLVERFEASTOL, and SCIP_SDPPAR_WARMSTARTPOGAP.

SCIP_RETCODE SCIPsdpiSolverGetIntpar	(	SCIP_SDPISOLVER *	sdpisolver,
		SCIP_SDPPARAM	type,
		int *	ival
	)

gets integer parameter of SDP-Solver

Parameters

sdpisolver	pointer to an SDP-solver interface
type	parameter number
ival	parameter value

Definition at line 2589 of file sdpisolver_dsdp.c.

References SCIP_SDPPAR_SDPINFO.

SCIP_RETCODE SCIPsdpiSolverSetIntpar	(	SCIP_SDPISOLVER *	sdpisolver,
		SCIP_SDPPARAM	type,
		int	ival
	)

sets integer parameter of SDP-Solver

Parameters

sdpisolver	pointer to an SDP-solver interface
type	parameter number
ival	parameter value

Definition at line 2611 of file sdpisolver_dsdp.c.

References SCIP_SDPPAR_SDPINFO.

SCIP_RETCODE SCIPsdpiSolverComputeLambdastar	(	SCIP_SDPISOLVER *	sdpisolver,
		SCIP_Real	maxguess
	)

compute and set lambdastar (only used for SDPA)

Parameters

sdpisolver	pointer to an SDP-solver interface
maxguess	maximum guess for lambda star of all SDP-constraints

Definition at line 2633 of file sdpisolver_dsdp.c.

SCIP_RETCODE SCIPsdpiSolverComputePenaltyparam	(	SCIP_SDPISOLVER *	sdpisolver,
		SCIP_Real	maxcoeff,
		SCIP_Real *	penaltyparam
	)

compute and set the penalty parameter

Parameters

sdpisolver	pointer to an SDP-solver interface
maxcoeff	maximum objective coefficient
penaltyparam	the computed penalty parameter

Definition at line 2644 of file sdpisolver_dsdp.c.

References MAX_PENALTYPARAM, MIN_PENALTYPARAM, and PENALTYPARAM_FACTOR.

SCIP_RETCODE SCIPsdpiSolverComputeMaxPenaltyparam	(	SCIP_SDPISOLVER *	sdpisolver,
		SCIP_Real	penaltyparam,
		SCIP_Real *	maxpenaltyparam
	)

compute and set the maximum penalty parameter

Parameters

sdpisolver	pointer to an SDP-solver interface
penaltyparam	the initial penalty parameter
maxpenaltyparam	the computed maximum penalty parameter

Definition at line 2679 of file sdpisolver_dsdp.c.

References MAX_MAXPENALTYPARAM, and MAXPENALTYPARAM_FACTOR.

SCIP_RETCODE SCIPsdpiSolverReadSDP	(	SCIP_SDPISOLVER *	sdpisolver,
		const char *	fname
	)

reads SDP from a file

Parameters

sdpisolver	pointer to an SDP-solver interface
fname	file name

Definition at line 2725 of file sdpisolver_dsdp.c.

SCIP_RETCODE SCIPsdpiSolverWriteSDP	(	SCIP_SDPISOLVER *	sdpisolver,
		const char *	fname
	)

writes SDP to a file

Parameters

sdpisolver	pointer to an SDP-solver interface
fname	file name

Definition at line 2735 of file sdpisolver_dsdp.c.

Macros

Typedefs

Functions

Detailed Description

Macro Definition Documentation

Typedef Documentation

Function Documentation