SoPlex Documentation
Loading...
Searching...
No Matches
SoPlexBase< R >::Statistics Class Reference

#include <statistics.h>

Public Member Functions

Construction, resetting, printing
 Statistics (Timer::TYPE ttype=Timer::USER_TIME)
 default constructor
 
 Statistics (const Statistics &base)
 copy constructor
 
Statisticsoperator= (const Statistics &rhs)
 assignment operator
 
 ~Statistics ()
 destructor
 
void clearAllData ()
 clears all statistics
 
void clearSolvingData ()
 clears statistics on solving process
 
void print (std::ostream &os)
 prints statistics
 

Public Attributes

Data
TimerreadingTime
 reading time not included in solving time
 
TimersolvingTime
 solving time
 
TimerpreprocessingTime
 preprocessing time
 
TimersimplexTime
 simplex time
 
TimersyncTime
 time for synchronization between real and rational LP (included in solving time)
 
TimertransformTime
 time for transforming LPs (included in solving time)
 
TimerrationalTime
 time for rational LP solving (included in solving time)
 
TimerinitialPrecisionTime
 solving time with initial precision (included in solving time)
 
TimerextendedPrecisionTime
 solving time with extended precision (included in solving time)
 
TimerreconstructionTime
 time for rational reconstructions
 
TimerboostingStepTime
 time for the precision boosting step: boost, load LP, load basis, decrease tols (included in solving time)
 
Timer::TYPE timerType
 type of timer (user or wallclock)
 
Real multTimeSparse
 time for computing A*x exploiting sparsity (setupPupdate(), PRICE step)
 
Real multTimeFull
 time for computing A*x ignoring sparsity (setupPupdate(), PRICE step)
 
Real multTimeColwise
 time for computing A*x columnwise (setupPupdate(), PRICE step)
 
Real multTimeUnsetup
 time for computing A*x w/o sparsity information (setupPupdate(), PRICE step)
 
int multSparseCalls
 number of products A*x exploiting sparsity (setupPupdate(), PRICE step)
 
int multFullCalls
 number of products A*x ignoring sparsity (setupPupdate(), PRICE step)
 
int multColwiseCalls
 number of products A*x columnwise (setupPupdate(), PRICE step)
 
int multUnsetupCalls
 number of products A*x w/o sparsity information (setupPupdate(), PRICE step)
 
Real luFactorizationTimeReal
 time for factorizing bases matrices in real precision
 
Real luSolveTimeReal
 time for solving linear systems in real precision
 
Real luFactorizationTimeRational
 time for factorizing bases matrices in rational precision
 
Real luSolveTimeRational
 time for solving linear systems in rational precision
 
Real fpTime
 time for first floating-point LP solve
 
int iterations
 number of iterations/pivots
 
int iterationsPrimal
 number of iterations with Primal
 
int iterationsFromBasis
 number of iterations from Basis
 
int iterationsPolish
 number of iterations during solution polishing
 
int iterationsFP
 number of iterations/pivots in first floating-point solve
 
int boundflips
 number of dual bound flips
 
int boostedIterations
 number of iterations/pivots in extended precision
 
int boostedIterationsPrimal
 number of iterations with Primal
 
int boostedIterationsFromBasis
 number of iterations from Basis
 
int boostedIterationsPolish
 number of iterations during solution polishing
 
int boostedBoundflips
 number of dual bound flips
 
int luFactorizationsReal
 number of basis matrix factorizations in real precision
 
int luSolvesReal
 number of (forward and backward) solves with basis matrix in real precision
 
int luFactorizationsRational
 number of basis matrix factorizations in rational precision
 
int rationalReconstructions
 number of rational reconstructions performed
 
int refinements
 number of refinement steps
 
int stallRefinements
 number of refinement steps without pivots
 
int pivotRefinements
 number of refinement steps until final basis is reached
 
int feasRefinements
 number of refinement steps during infeasibility test
 
int unbdRefinements
 number of refinement steps during undboundedness test
 
int precBoosts
 number of precision boosts
 
int stallPrecBoosts
 number of precision boosts without pivots
 
int pivotPrecBoosts
 number of precision boosts until final basis is reached
 
int feasPrecBoosts
 number of precision boosts during infeasibility test
 
int unbdPrecBoosts
 number of precision boosts during undboundedness test
 
int callsReducedProb
 number of times the reduced problem is solved. This includes the initial solve.
 
int iterationsInit
 number of iterations in the initial LP
 
int iterationsRedProb
 number of iterations of the reduced problem
 
int iterationsCompProb
 number of iterations of the complementary problem
 
int numRedProbRows
 number of rows in the reduced problem
 
int numRedProbCols
 number of columns in the reduced problem
 
int degenPivotsPrimal
 number of primal degenerate pivots
 
int degenPivotsDual
 number of dual degenerate pivots
 
int degenPivotCandPrimal
 number of pivoting candidates that will produce a degenerate step in the primal
 
int degenPivotCandDual
 number of pivoting candidates that will produce a degenerate step in the dual
 
sumDualDegen
 the sum of the rate of dual degeneracy at each iteration
 
sumPrimalDegen
 the sum of the rate of primal degeneracy at each iteration
 
totalBoundViol
 the sum of the bound violations in the original problem using the red prob sol
 
totalRowViol
 the sum of the row violations in the original problem using the red prob sol
 
maxBoundViol
 the max bound violation in the original problem using the red prob sol
 
maxRowViol
 the max row violations in the original problem using the red prob sol
 
int redProbStatus
 status of the reduced problem
 
int compProbStatus
 status of the complementary problem
 
finalCompObj
 the final objective function of the complementary problem
 
finalBasisCondition
 condition number estimate of the optimal basis matrix
 

Detailed Description

template<class R>
class soplex::SoPlexBase< R >::Statistics

Definition at line 43 of file statistics.h.

Constructor & Destructor Documentation

◆ Statistics() [1/2]

template<class R >
Statistics ( Timer::TYPE ttype = Timer::USER_TIME)

default constructor

◆ Statistics() [2/2]

template<class R >
Statistics ( const Statistics & base)

copy constructor

◆ ~Statistics()

template<class R >
~Statistics ( )

destructor

Definition at line 62 of file statistics.h.

References soplex::spx_free().

Member Function Documentation

◆ clearAllData()

template<class R >
void clearAllData ( )

clears all statistics

◆ clearSolvingData()

template<class R >
void clearSolvingData ( )

clears statistics on solving process

◆ operator=()

template<class R >
Statistics & operator= ( const Statistics & rhs)

assignment operator

◆ print()

template<class R >
void print ( std::ostream & os)

prints statistics

Member Data Documentation

◆ boostedBoundflips

template<class R >
int boostedBoundflips

number of dual bound flips

Definition at line 142 of file statistics.h.

◆ boostedIterations

template<class R >
int boostedIterations

number of iterations/pivots in extended precision

Definition at line 138 of file statistics.h.

◆ boostedIterationsFromBasis

template<class R >
int boostedIterationsFromBasis

number of iterations from Basis

Definition at line 140 of file statistics.h.

◆ boostedIterationsPolish

template<class R >
int boostedIterationsPolish

number of iterations during solution polishing

Definition at line 141 of file statistics.h.

◆ boostedIterationsPrimal

template<class R >
int boostedIterationsPrimal

number of iterations with Primal

Definition at line 139 of file statistics.h.

◆ boostingStepTime

template<class R >
Timer* boostingStepTime

time for the precision boosting step: boost, load LP, load basis, decrease tols (included in solving time)

Definition at line 115 of file statistics.h.

◆ boundflips

template<class R >
int boundflips

number of dual bound flips

Definition at line 137 of file statistics.h.

◆ callsReducedProb

template<class R >
int callsReducedProb

number of times the reduced problem is solved. This includes the initial solve.

Definition at line 159 of file statistics.h.

◆ compProbStatus

template<class R >
int compProbStatus

status of the complementary problem

Definition at line 176 of file statistics.h.

◆ degenPivotCandDual

template<class R >
int degenPivotCandDual

number of pivoting candidates that will produce a degenerate step in the dual

Definition at line 168 of file statistics.h.

◆ degenPivotCandPrimal

template<class R >
int degenPivotCandPrimal

number of pivoting candidates that will produce a degenerate step in the primal

Definition at line 167 of file statistics.h.

◆ degenPivotsDual

template<class R >
int degenPivotsDual

number of dual degenerate pivots

Definition at line 166 of file statistics.h.

◆ degenPivotsPrimal

template<class R >
int degenPivotsPrimal

number of primal degenerate pivots

Definition at line 165 of file statistics.h.

◆ extendedPrecisionTime

template<class R >
Timer* extendedPrecisionTime

solving time with extended precision (included in solving time)

Definition at line 113 of file statistics.h.

◆ feasPrecBoosts

template<class R >
int feasPrecBoosts

number of precision boosts during infeasibility test

Definition at line 155 of file statistics.h.

◆ feasRefinements

template<class R >
int feasRefinements

number of refinement steps during infeasibility test

Definition at line 150 of file statistics.h.

◆ finalBasisCondition

template<class R >
R finalBasisCondition

condition number estimate of the optimal basis matrix

Definition at line 180 of file statistics.h.

◆ finalCompObj

template<class R >
R finalCompObj

the final objective function of the complementary problem

Definition at line 177 of file statistics.h.

◆ fpTime

template<class R >
Real fpTime

time for first floating-point LP solve

Definition at line 131 of file statistics.h.

◆ initialPrecisionTime

template<class R >
Timer* initialPrecisionTime

solving time with initial precision (included in solving time)

Definition at line 112 of file statistics.h.

◆ iterations

template<class R >
int iterations

number of iterations/pivots

Definition at line 132 of file statistics.h.

◆ iterationsCompProb

template<class R >
int iterationsCompProb

number of iterations of the complementary problem

Definition at line 162 of file statistics.h.

◆ iterationsFP

template<class R >
int iterationsFP

number of iterations/pivots in first floating-point solve

Definition at line 136 of file statistics.h.

◆ iterationsFromBasis

template<class R >
int iterationsFromBasis

number of iterations from Basis

Definition at line 134 of file statistics.h.

◆ iterationsInit

template<class R >
int iterationsInit

number of iterations in the initial LP

Definition at line 160 of file statistics.h.

◆ iterationsPolish

template<class R >
int iterationsPolish

number of iterations during solution polishing

Definition at line 135 of file statistics.h.

◆ iterationsPrimal

template<class R >
int iterationsPrimal

number of iterations with Primal

Definition at line 133 of file statistics.h.

◆ iterationsRedProb

template<class R >
int iterationsRedProb

number of iterations of the reduced problem

Definition at line 161 of file statistics.h.

◆ luFactorizationsRational

template<class R >
int luFactorizationsRational

number of basis matrix factorizations in rational precision

Definition at line 145 of file statistics.h.

◆ luFactorizationsReal

template<class R >
int luFactorizationsReal

number of basis matrix factorizations in real precision

Definition at line 143 of file statistics.h.

◆ luFactorizationTimeRational

template<class R >
Real luFactorizationTimeRational

time for factorizing bases matrices in rational precision

Definition at line 129 of file statistics.h.

◆ luFactorizationTimeReal

template<class R >
Real luFactorizationTimeReal

time for factorizing bases matrices in real precision

Definition at line 127 of file statistics.h.

◆ luSolvesReal

template<class R >
int luSolvesReal

number of (forward and backward) solves with basis matrix in real precision

Definition at line 144 of file statistics.h.

◆ luSolveTimeRational

template<class R >
Real luSolveTimeRational

time for solving linear systems in rational precision

Definition at line 130 of file statistics.h.

◆ luSolveTimeReal

template<class R >
Real luSolveTimeReal

time for solving linear systems in real precision

Definition at line 128 of file statistics.h.

◆ maxBoundViol

template<class R >
R maxBoundViol

the max bound violation in the original problem using the red prob sol

Definition at line 173 of file statistics.h.

◆ maxRowViol

template<class R >
R maxRowViol

the max row violations in the original problem using the red prob sol

Definition at line 174 of file statistics.h.

◆ multColwiseCalls

template<class R >
int multColwiseCalls

number of products A*x columnwise (setupPupdate(), PRICE step)

Definition at line 124 of file statistics.h.

◆ multFullCalls

template<class R >
int multFullCalls

number of products A*x ignoring sparsity (setupPupdate(), PRICE step)

Definition at line 123 of file statistics.h.

◆ multSparseCalls

template<class R >
int multSparseCalls

number of products A*x exploiting sparsity (setupPupdate(), PRICE step)

Definition at line 122 of file statistics.h.

◆ multTimeColwise

template<class R >
Real multTimeColwise

time for computing A*x columnwise (setupPupdate(), PRICE step)

Definition at line 120 of file statistics.h.

◆ multTimeFull

template<class R >
Real multTimeFull

time for computing A*x ignoring sparsity (setupPupdate(), PRICE step)

Definition at line 119 of file statistics.h.

◆ multTimeSparse

template<class R >
Real multTimeSparse

time for computing A*x exploiting sparsity (setupPupdate(), PRICE step)

Definition at line 118 of file statistics.h.

◆ multTimeUnsetup

template<class R >
Real multTimeUnsetup

time for computing A*x w/o sparsity information (setupPupdate(), PRICE step)

Definition at line 121 of file statistics.h.

◆ multUnsetupCalls

template<class R >
int multUnsetupCalls

number of products A*x w/o sparsity information (setupPupdate(), PRICE step)

Definition at line 125 of file statistics.h.

◆ numRedProbCols

template<class R >
int numRedProbCols

number of columns in the reduced problem

Definition at line 164 of file statistics.h.

◆ numRedProbRows

template<class R >
int numRedProbRows

number of rows in the reduced problem

Definition at line 163 of file statistics.h.

◆ pivotPrecBoosts

template<class R >
int pivotPrecBoosts

number of precision boosts until final basis is reached

Definition at line 154 of file statistics.h.

◆ pivotRefinements

template<class R >
int pivotRefinements

number of refinement steps until final basis is reached

Definition at line 149 of file statistics.h.

◆ precBoosts

template<class R >
int precBoosts

number of precision boosts

Definition at line 152 of file statistics.h.

◆ preprocessingTime

template<class R >
Timer* preprocessingTime

preprocessing time

Definition at line 107 of file statistics.h.

◆ rationalReconstructions

template<class R >
int rationalReconstructions

number of rational reconstructions performed

Definition at line 146 of file statistics.h.

◆ rationalTime

template<class R >
Timer* rationalTime

time for rational LP solving (included in solving time)

Definition at line 111 of file statistics.h.

◆ readingTime

template<class R >
Timer* readingTime

reading time not included in solving time

Definition at line 105 of file statistics.h.

◆ reconstructionTime

template<class R >
Timer* reconstructionTime

time for rational reconstructions

Definition at line 114 of file statistics.h.

◆ redProbStatus

template<class R >
int redProbStatus

status of the reduced problem

Definition at line 175 of file statistics.h.

◆ refinements

template<class R >
int refinements

number of refinement steps

Definition at line 147 of file statistics.h.

◆ simplexTime

template<class R >
Timer* simplexTime

simplex time

Definition at line 108 of file statistics.h.

◆ solvingTime

template<class R >
Timer* solvingTime

solving time

Definition at line 106 of file statistics.h.

◆ stallPrecBoosts

template<class R >
int stallPrecBoosts

number of precision boosts without pivots

Definition at line 153 of file statistics.h.

◆ stallRefinements

template<class R >
int stallRefinements

number of refinement steps without pivots

Definition at line 148 of file statistics.h.

◆ sumDualDegen

template<class R >
R sumDualDegen

the sum of the rate of dual degeneracy at each iteration

Definition at line 169 of file statistics.h.

◆ sumPrimalDegen

template<class R >
R sumPrimalDegen

the sum of the rate of primal degeneracy at each iteration

Definition at line 170 of file statistics.h.

◆ syncTime

template<class R >
Timer* syncTime

time for synchronization between real and rational LP (included in solving time)

Definition at line 109 of file statistics.h.

◆ timerType

template<class R >
Timer::TYPE timerType

type of timer (user or wallclock)

Definition at line 116 of file statistics.h.

◆ totalBoundViol

template<class R >
R totalBoundViol

the sum of the bound violations in the original problem using the red prob sol

Definition at line 171 of file statistics.h.

◆ totalRowViol

template<class R >
R totalRowViol

the sum of the row violations in the original problem using the red prob sol

Definition at line 172 of file statistics.h.

◆ transformTime

template<class R >
Timer* transformTime

time for transforming LPs (included in solving time)

Definition at line 110 of file statistics.h.

◆ unbdPrecBoosts

template<class R >
int unbdPrecBoosts

number of precision boosts during undboundedness test

Definition at line 156 of file statistics.h.

◆ unbdRefinements

template<class R >
int unbdRefinements

number of refinement steps during undboundedness test

Definition at line 151 of file statistics.h.