ClpCholeskyWssmpKKT.hpp
Go to the documentation of this file.
1 /* $Id: ClpCholeskyWssmpKKT.hpp 1525 2010-02-26 17:27:59Z mjs $ */
2 // Copyright (C) 2004, International Business Machines
3 // Corporation and others. All Rights Reserved.
4 #ifndef ClpCholeskyWssmpKKT_H
5 #define ClpCholeskyWssmpKKT_H
6 
7 #include "ClpCholeskyBase.hpp"
8 class ClpMatrixBase;
9 class ClpCholeskyDense;
10 
11 
16 
17 public:
22  virtual int order(ClpInterior * model) ;
27  virtual int symbolic();
30  virtual int factorize(const double * diagonal, int * rowsDropped) ;
32  virtual void solve (double * region) ;
35  virtual void solveKKT (double * region1, double * region2, const double * diagonal,
36  double diagonalScaleFactor);
38 
39 
44  ClpCholeskyWssmpKKT(int denseThreshold = -1);
46  virtual ~ClpCholeskyWssmpKKT();
47  // Copy
49  // Assignment
52  virtual ClpCholeskyBase * clone() const ;
54 
55 
56 private:
59 
60 };
61 
62 #endif
char * rowsDropped() const
rowsDropped - which rows are gone
Base class for Clp Cholesky factorization Will do better factorization.
longDouble * diagonal() const
Return diagonal.
This solves LPs using interior point methods.
Definition: ClpInterior.hpp:72
virtual int factorize(const double *diagonal, int *rowsDropped)
Factorize - filling in rowsDropped and returning number dropped.
ClpCholeskyWssmpKKT(int denseThreshold=-1)
Constructor which has dense columns activated.
virtual int symbolic()
Does Symbolic factorization given permutation.
virtual int order(ClpInterior *model)
Orders rows and saves pointer to matrix.and model.
WssmpKKT class for Clp Cholesky factorization.
Abstract base class for Clp Matrices.
virtual void solveKKT(double *region1, double *region2, const double *diagonal, double diagonalScaleFactor)
Uses factorization to solve.
virtual void solve(double *region)
Uses factorization to solve.
virtual ~ClpCholeskyWssmpKKT()
Destructor.
ClpCholeskyWssmpKKT & operator=(const ClpCholeskyWssmpKKT &)
Constructor which has dense columns activated.
virtual ClpCholeskyBase * clone() const
Clone.