14 #ifndef OR_TOOLS_GLOP_BASIS_REPRESENTATION_H_
15 #define OR_TOOLS_GLOP_BASIS_REPRESENTATION_H_
19 #include "ortools/glop/parameters.pb.h"
81 void LeftSolveWithDenseEta(
DenseRow* y)
const;
82 void LeftSolveWithSparseEta(
DenseRow* y)
const;
93 const ColIndex eta_col_;
119 void Update(ColIndex entering_col, RowIndex leaving_variable_row,
135 std::vector<EtaMatrix*> eta_matrix_;
159 max_num_updates_ =
parameters.basis_refactorization_period();
160 use_middle_product_form_update_ =
209 ABSL_MUST_USE_RESULT
Status Update(ColIndex entering_col,
210 RowIndex leaving_variable_row,
276 return stats_.StatString() + lu_factorization_.
StatString();
287 bool IsIdentityBasis()
const;
292 ABSL_MUST_USE_RESULT
Status
293 MiddleProductFormUpdate(ColIndex entering_col, RowIndex leaving_variable_row);
297 void BumpDeterministicTimeForSolve(
int num_entries)
const;
303 refactorization_interval(
"refactorization_interval", this) {}
309 mutable Stats stats_;
310 GlopParameters parameters_;
313 const CompactSparseMatrix& compact_matrix_;
318 RankOneUpdateFactorization rank_one_factorization_;
320 mutable std::vector<RowIndex> scratchpad_non_zeros_;
325 mutable ScatteredColumn tau_;
343 mutable bool tau_computation_can_be_optimized_;
344 mutable bool tau_is_computed_;
350 mutable CompactSparseMatrix storage_;
351 mutable CompactSparseMatrix right_storage_;
355 bool use_middle_product_form_update_;
356 int max_num_updates_;
358 EtaFactorization eta_factorization_;
359 LuFactorization lu_factorization_;
362 mutable double deterministic_time_;
#define DCHECK(condition)
Fractional ComputeInverseOneNorm() const
BasisFactorization(const CompactSparseMatrix *compact_matrix, const RowToColMapping *basis)
Fractional ComputeInfinityNormConditionNumberUpperBound() const
ABSL_MUST_USE_RESULT Status Refactorize()
Fractional ComputeInverseInfinityNorm() const
Fractional ComputeInfinityNorm() const
const DenseColumn & RightSolveForTau(const ScatteredColumn &a) const
void LeftSolveForUnitRow(ColIndex j, ScatteredRow *y) const
Fractional RightSolveSquaredNorm(const ColumnView &a) const
const ColumnPermutation & GetColumnPermutation() const
Fractional ComputeOneNorm() const
Fractional ComputeOneNormConditionNumber() const
ABSL_MUST_USE_RESULT Status Initialize()
bool IsRefactorized() const
void TemporaryLeftSolveForUnitRow(ColIndex j, ScatteredRow *y) const
ABSL_MUST_USE_RESULT Status Update(ColIndex entering_col, RowIndex leaving_variable_row, const ScatteredColumn &direction)
virtual ~BasisFactorization()
Fractional DualEdgeSquaredNorm(RowIndex row) const
void LeftSolve(ScatteredRow *y) const
void RightSolveForProblemColumn(ColIndex col, ScatteredColumn *d) const
Fractional ComputeInfinityNormConditionNumber() const
void SetColumnPermutationToIdentity()
RowIndex GetNumberOfRows() const
void SetParameters(const GlopParameters ¶meters)
void RightSolve(ScatteredColumn *d) const
double DeterministicTime() const
ABSL_MUST_USE_RESULT Status ForceRefactorization()
std::string StatString() const
RowIndex num_rows() const
void RightSolve(DenseColumn *d) const
void LeftSolve(DenseRow *y) const
virtual ~EtaFactorization()
void SparseLeftSolve(DenseRow *y, ColIndexVector *pos) const
void Update(ColIndex entering_col, RowIndex leaving_variable_row, const ScatteredColumn &direction)
void RightSolve(DenseColumn *d) const
void LeftSolve(DenseRow *y) const
EtaMatrix(ColIndex eta_col, const ScatteredColumn &direction)
void SparseLeftSolve(DenseRow *y, ColIndexVector *pos) const
const ColumnPermutation & GetColumnPermutation() const
void SetColumnPermutationToIdentity()
void SetParameters(const GlopParameters ¶meters)
std::string StatString() const
std::vector< ColIndex > ColIndexVector
StrictITIVector< RowIndex, ColIndex > RowToColMapping
StrictITIVector< RowIndex, Fractional > DenseColumn
StrictITIVector< ColIndex, ColIndex > ColMapping
The vehicle routing library lets one model and solve generic vehicle routing problems ranging from th...