6 #ifndef ClpCholeskyWssmpKKT_H
7 #define ClpCholeskyWssmpKKT_H
33 virtual void solve(
double *region);
36 virtual void solveKKT(
double *region1,
double *region2,
const double *diagonal,
37 double diagonalScaleFactor);
virtual ~ClpCholeskyWssmpKKT()
Destructor.
Abstract base class for Clp Matrices.
This solves LPs using interior point methods.
char * rowsDropped() const
rowsDropped - which rows are gone
virtual ClpCholeskyBase * clone() const
Clone.
Base class for Clp Cholesky factorization Will do better factorization.
WssmpKKT class for Clp Cholesky factorization.
longDouble * diagonal() const
Return diagonal.
ClpCholeskyWssmpKKT(int denseThreshold=-1)
Constructor which has dense columns activated.
virtual void solveKKT(double *region1, double *region2, const double *diagonal, double diagonalScaleFactor)
Uses factorization to solve.
virtual int order(ClpInterior *model)
Orders rows and saves pointer to matrix.and model.
ClpCholeskyWssmpKKT & operator=(const ClpCholeskyWssmpKKT &)
virtual int factorize(const double *diagonal, int *rowsDropped)
Factorize - filling in rowsDropped and returning number dropped.
virtual int symbolic()
Does Symbolic factorization given permutation.
virtual void solve(double *region)
Uses factorization to solve.