# Semi-Definite Quadratic Linear Programming Solver

## Documentation for package ‘sdpt3r’ version 0.3

- DESCRIPTION file.
- User guides, package vignettes and other documentation.

## Help Pages

Andwd | An Configuration Matrix for Distance Weighted Discrimination
Apdwd | Ap Configuration Matrix for Distance Weighted Discrimination
Betp | Symmetric Matrix for Educational Testing Problem
Bgpp | Adjacency Matrix for Graph Partitioning Problem
Blogcheby | B Matrix for the Log Chebyshev Approximation Problem
Bmaxcut | Adjacency Matrix for Max-Cut
Bmaxkcut | Adjacency Matrix for Max-kCut
control_theory | Control Theory
DoptDesign | Test Vector Matrix for D-Optimal Design
doptimal | D-Optimal Experimental Design
dwd | Distance Weighted Discrimination
etp | Educational Testing Problem
flogcheby | f vector for the Log Chebyshev Approximation Problem
Ftoep | Symmetric Matrix for the Toeplitz Approximatin Problem
Glovasz | Adjacency Matrix on which to find the Lovasz Number
gpp | Graph Partitioning Problem
Hnearcorr | Approximate Correlation Matrix for Nearest Correlation Matrix Problem
lmi1 | Linear Matrix Inequality 1
lmi2 | Linear Matrix Inequality 2
lmi3 | Linear Matrix Inequality 3
logcheby | Log Chebyshev Approximation
lovasz | Lovasz Number of a Graph
maxcut | Max-Cut Problem
maxkcut | Max-kCut Problem
minelips | The Minimum Ellipsoid Problem
nearcorr | Nearest Correlation Matrix Problem
smat | Create a Symmetrix Matrix
sqlp | Semidefinite Quadratic Linear Programming Solver
svec | Upper Triangular Vectorization
toep | Toeplitz Approximation Problem
Vminelips | Configuration Matrix for Minimum Ellipse Problem