SCIP-SDP
3.1.1
|
constraint handler for saving SDP solutions in nodes More...
Go to the source code of this file.
Functions | |
EXTERN SCIP_RETCODE | SCIPincludeConshdlrSavesdpsol (SCIP *scip) |
EXTERN SCIP_RETCODE | createConsSavesdpsol (SCIP *scip, SCIP_CONS **cons, const char *name, SCIP_Longint node, SCIP_SOL *sol, SCIP_Real maxprimalentry, int nblocks, int *startXnblocknonz, int **startXrow, int **startXcol, SCIP_Real **startXval) |
EXTERN SCIP_Longint | SCIPconsSavesdpsolGetNodeIndex (SCIP *scip, SCIP_CONS *cons) |
EXTERN SCIP_SOL * | SCIPconsSavesdpsolGetDualVector (SCIP *scip, SCIP_CONS *cons) |
EXTERN SCIP_Real | SCIPconsSavesdpsolGetMaxPrimalEntry (SCIP *scip, SCIP_CONS *cons) |
EXTERN SCIP_RETCODE | SCIPconsSavesdpsolGetPrimalMatrixNonzeros (SCIP *scip, SCIP_CONS *cons, int nblocks, int *startXnblocknonz) |
EXTERN SCIP_RETCODE | SCIPconsSavesdpsolGetPrimalMatrix (SCIP *scip, SCIP_CONS *cons, int nblocks, int *startXnblocknonz, int **startXrow, int **startXcol, SCIP_Real **startXval) |
constraint handler for saving SDP solutions in nodes
Definition in file cons_savesdpsol.h.
EXTERN SCIP_RETCODE SCIPincludeConshdlrSavesdpsol | ( | SCIP * | scip | ) |
include Savesdpsol constraint handler
scip | SCIP data structure |
Definition at line 221 of file cons_savesdpsol.c.
References CONSHDLR_CHECKPRIORITY, CONSHDLR_DESC, CONSHDLR_EAGERFREQ, CONSHDLR_ENFOPRIORITY, CONSHDLR_NAME, and CONSHDLR_NEEDSCONS.
Referenced by runSCIP(), and SCIP_DECL_CONSHDLRCOPY().
EXTERN SCIP_RETCODE createConsSavesdpsol | ( | SCIP * | scip, |
SCIP_CONS ** | cons, | ||
const char * | name, | ||
SCIP_Longint | node, | ||
SCIP_SOL * | sol, | ||
SCIP_Real | maxprimalentry, | ||
int | nblocks, | ||
int * | startXnblocknonz, | ||
int ** | startXrow, | ||
int ** | startXcol, | ||
SCIP_Real ** | startXval | ||
) |
create a Savesdpsol-Cons, i.e. save the current optimal solution for the SDP-relaxation of this node
scip | SCIP data structure |
cons | pointer to hold the created constraint |
name | name of constraint |
node | index of the node the solution belongs to |
sol | optimal solution for SDP-relaxation of this node |
maxprimalentry | maximum absolute value of primal matrix |
nblocks | number of blocks INCLUDING lp-block |
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 if nblocks = 0 |
startXrow | primal matrix X as starting point for the solver: row indices for each block; or NULL if nblocks = 0 |
startXcol | primal matrix X as starting point for the solver: column indices for each block; or NULL if nblocks = 0 |
startXval | primal matrix X as starting point for the solver: values for each block; or NULL if nblocks = 0 |
Definition at line 249 of file cons_savesdpsol.c.
Referenced by calcRelax().
EXTERN SCIP_Longint SCIPconsSavesdpsolGetNodeIndex | ( | SCIP * | scip, |
SCIP_CONS * | cons | ||
) |
for the given cons of type Savesdpsol returns the node the information belongs to
scip | SCIP data structure |
cons | constraint to get starting point for |
Definition at line 327 of file cons_savesdpsol.c.
Referenced by calcRelax().
EXTERN SCIP_SOL* SCIPconsSavesdpsolGetDualVector | ( | SCIP * | scip, |
SCIP_CONS * | cons | ||
) |
for the given cons of type Savesdpsol returns the previous dual solution vector y
scip | SCIP data structure |
cons | constraint to get starting point for |
Definition at line 345 of file cons_savesdpsol.c.
Referenced by calcRelax().
EXTERN SCIP_Real SCIPconsSavesdpsolGetMaxPrimalEntry | ( | SCIP * | scip, |
SCIP_CONS * | cons | ||
) |
for the given cons of type Savesdpsol returns the maximum entry of primal solution X
scip | SCIP data structure |
cons | constraint to get maximum primal entry for |
Definition at line 363 of file cons_savesdpsol.c.
Referenced by calcRelax().
EXTERN SCIP_RETCODE SCIPconsSavesdpsolGetPrimalMatrixNonzeros | ( | SCIP * | scip, |
SCIP_CONS * | cons, | ||
int | nblocks, | ||
int * | startXnblocknonz | ||
) |
for the given cons of type Savesdpsol returns the number of nonzeros for each block of previous primal solution X
scip | SCIP data structure |
cons | constraint to get maximum primal entry for |
nblocks | number of blocks INCLUDING lp-block |
startXnblocknonz | input: allocated memory for startXrow/col/val output: length of startXrow/col/val |
Definition at line 381 of file cons_savesdpsol.c.
Referenced by calcRelax().
EXTERN SCIP_RETCODE SCIPconsSavesdpsolGetPrimalMatrix | ( | SCIP * | scip, |
SCIP_CONS * | cons, | ||
int | nblocks, | ||
int * | startXnblocknonz, | ||
int ** | startXrow, | ||
int ** | startXcol, | ||
SCIP_Real ** | startXval | ||
) |
for the given cons of type Savesdpsol returns the previous primal solution X
scip | SCIP data structure |
cons | constraint to get maximum primal entry for |
nblocks | number of blocks INCLUDING lp-block |
startXnblocknonz | input: allocated memory for startXrow/col/val output: length of startXrow/col/val |
startXrow | pointer to store pointer to row indices of X |
startXcol | pointer to store pointer to column indices of X |
startXval | pointer to store pointer to values of X |
Definition at line 412 of file cons_savesdpsol.c.
Referenced by calcRelax().