|
DSDP
|
| DSDP Basics | DSDP can be used within a C application through a set of subroutines |
| DSDP Convergence | The subroutines listed below define convergence and termination criteria for the solver and problems in DSDP Standard Form |
| DSDP Statistics for Data and Current Solution | DSDP can provide information about the problem and its current solution in DSDP Standard Form |
| DSDP Tuning Options | Improve performance of DSDP and customize the solver for problems in DSDP Standard Form |
| Semidefinite Blocks (Basics) | Routines that create the SDPCone object, set the data, and get the solution for problems |
| Semidefinite Blocks (Operational Routines) | Additional routines that operate on the data |
| Semidefinite Blocks (Advanced Data) | Less frequently used routines to set data into the SDPCone object and operate on the variables |
| Linear Programming | Routines that create the LP cone object for linear inequalites, set the data, and provide access to the solutions |
| Bounds | Bounds on the variables y are a special type of semidefinite and LP cone. Corresponding to lower and upper bounds on the y variables are surplus and slack variables in (P) with an a cost |
| Examples | Examples that formulate problems in DSDP Standard Form. and solve them using DSDP |
1.8.17