interface for compiling withouth an SDP-solver More...

Macros
#define	BMS_CALL(x)

Functions
static void	errorMessageAbort (void)

static void	errorMessage (void)

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 compiling withouth an SDP-solver

Author: Tristan Gally

Definition in file sdpisolver_none.c.

Macro Definition Documentation

#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 54 of file sdpisolver_none.c.

Referenced by SCIPsdpiSolverCreate().

Function Documentation

static void errorMessageAbort ( void )

static

error handling method

Definition at line 84 of file sdpisolver_none.c.

static void errorMessage ( void )

static

error handling method

Definition at line 95 of file sdpisolver_none.c.

Referenced by SCIPsdpiSolverLoadAndSolve(), and SCIPsdpiSolverLoadAndSolveWithPenalty().

const char* SCIPsdpiSolverGetSolverName ( void )

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

Definition at line 112 of file sdpisolver_none.c.

const char* SCIPsdpiSolverGetSolverDesc ( void )

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

Definition at line 120 of file sdpisolver_none.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 133 of file sdpisolver_none.c.

SCIP_Real SCIPsdpiSolverGetDefaultSdpiSolverFeastol ( void )

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

Definition at line 142 of file sdpisolver_none.c.

SCIP_Real SCIPsdpiSolverGetDefaultSdpiSolverGaptol ( void )

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

Definition at line 150 of file sdpisolver_none.c.

int SCIPsdpiSolverGetDefaultSdpiSolverNpenaltyIncreases ( void )

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

Definition at line 158 of file sdpisolver_none.c.

SCIP_Bool SCIPsdpiSolverDoesWarmstartNeedPrimal ( void )

Should primal solution values be saved for warmstarting purposes?

Definition at line 166 of file sdpisolver_none.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 184 of file sdpisolver_none.c.

References BMS_CALL.

SCIP_RETCODE SCIPsdpiSolverFree ( SCIP_SDPISOLVER ** sdpisolver )

deletes an SDP solver interface

Parameters

sdpisolver pointer to an SDP-solver interface

Definition at line 207 of file sdpisolver_none.c.

SCIP_RETCODE SCIPsdpiSolverIncreaseCounter ( SCIP_SDPISOLVER * sdpisolver )

increases the SDP-Counter

Parameters

sdpisolver SDP-solver interface

Definition at line 221 of file sdpisolver_none.c.

SCIP_RETCODE SCIPsdpiSolverResetCounter ( SCIP_SDPISOLVER * sdpisolver )

reset the SDP-Counter to zero

Parameters

sdpisolver SDP-solver interface

Definition at line 231 of file sdpisolver_none.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 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)

Definition at line 265 of file sdpisolver_none.c.

References errorMessage().

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 351 of file sdpisolver_none.c.

References errorMessage().

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 434 of file sdpisolver_none.c.

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

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

SCIP_RETCODE SCIPsdpiSolverIgnoreInstability	(	SCIP_SDPISOLVER *	sdpisolver,
		SCIP_Bool *	success
	)

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

SCIP_RETCODE SCIPsdpiSolverGetObjval	(	SCIP_SDPISOLVER *	sdpisolver,
		SCIP_Real *	objval
	)

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

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

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

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

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

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)

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_RETCODE SCIPsdpiSolverGetIterations	(	SCIP_SDPISOLVER *	sdpisolver,
		int *	iterations
	)

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

SCIP_RETCODE SCIPsdpiSolverGetSdpCalls	(	SCIP_SDPISOLVER *	sdpisolver,
		int *	calls
	)

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

SCIP_RETCODE SCIPsdpiSolverSettingsUsed	(	SCIP_SDPISOLVER *	sdpisolver,
		SCIP_SDPSOLVERSETTING *	usedsetting
	)

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

SCIP_Bool SCIPsdpiSolverIsInfinity	(	SCIP_SDPISOLVER *	sdpisolver,
		SCIP_Real	val
	)

Macros

Functions

Detailed Description

Macro Definition Documentation

Function Documentation

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

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

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

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
	)

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

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

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