Loading...
Searching...
No Matches
statistics.h
Go to the documentation of this file.
109 Timer* syncTime; ///< time for synchronization between real and rational LP (included in solving time)
112 Timer* initialPrecisionTime; ///< solving time with initial precision (included in solving time)
113 Timer* extendedPrecisionTime; ///< solving time with extended precision (included in solving time)
115 Timer* boostingStepTime; ///< time for the precision boosting step: boost, load LP, load basis, decrease tols (included in solving time)
118 Real multTimeSparse; ///< time for computing A*x exploiting sparsity (setupPupdate(), PRICE step)
121 Real multTimeUnsetup; ///< time for computing A*x w/o sparsity information (setupPupdate(), PRICE step)
122 int multSparseCalls; ///< number of products A*x exploiting sparsity (setupPupdate(), PRICE step)
125 int multUnsetupCalls; ///< number of products A*x w/o sparsity information (setupPupdate(), PRICE step)
129 Real luFactorizationTimeRational; ///< time for factorizing bases matrices in rational precision
144 int luSolvesReal; ///< number of (forward and backward) solves with basis matrix in real precision
159 int callsReducedProb; ///< number of times the reduced problem is solved. This includes the initial solve.
167 int degenPivotCandPrimal; ///< number of pivoting candidates that will produce a degenerate step in the primal
168 int degenPivotCandDual; ///< number of pivoting candidates that will produce a degenerate step in the dual
171 R totalBoundViol; ///< the sum of the bound violations in the original problem using the red prob sol
172 R totalRowViol; ///< the sum of the row violations in the original problem using the red prob sol
Timer * boostingStepTime time for the precision boosting step: boost, load LP, load basis, decrease tols (included in solving ... Definition statistics.h:115 Timer * extendedPrecisionTime solving time with extended precision (included in solving time) Definition statistics.h:113 Real luFactorizationTimeRational time for factorizing bases matrices in rational precision Definition statistics.h:129 Real multTimeFull time for computing A*x ignoring sparsity (setupPupdate(), PRICE step) Definition statistics.h:119 int pivotRefinements number of refinement steps until final basis is reached Definition statistics.h:149 int multFullCalls number of products A*x ignoring sparsity (setupPupdate(), PRICE step) Definition statistics.h:123 R finalBasisCondition condition number estimate of the optimal basis matrix Definition statistics.h:180 int luFactorizationsRational number of basis matrix factorizations in rational precision Definition statistics.h:145 Real multTimeUnsetup time for computing A*x w/o sparsity information (setupPupdate(), PRICE step) Definition statistics.h:121 int iterationsFP number of iterations/pivots in first floating-point solve Definition statistics.h:136 R totalBoundViol the sum of the bound violations in the original problem using the red prob sol Definition statistics.h:171 int multColwiseCalls number of products A*x columnwise (setupPupdate(), PRICE step) Definition statistics.h:124 R sumPrimalDegen the sum of the rate of primal degeneracy at each iteration Definition statistics.h:170 Statistics(Timer::TYPE ttype=Timer::USER_TIME) default constructor int multSparseCalls number of products A*x exploiting sparsity (setupPupdate(), PRICE step) Definition statistics.h:122 Timer * transformTime time for transforming LPs (included in solving time) Definition statistics.h:110 int callsReducedProb number of times the reduced problem is solved. This includes the initial solve. Definition statistics.h:159 int luFactorizationsReal number of basis matrix factorizations in real precision Definition statistics.h:143 int degenPivotCandDual number of pivoting candidates that will produce a degenerate step in the dual Definition statistics.h:168 Timer * initialPrecisionTime solving time with initial precision (included in solving time) Definition statistics.h:112 Real multTimeColwise time for computing A*x columnwise (setupPupdate(), PRICE step) Definition statistics.h:120 Statistics & operator=(const Statistics &rhs) assignment operator R totalRowViol the sum of the row violations in the original problem using the red prob sol Definition statistics.h:172 Timer * rationalTime time for rational LP solving (included in solving time) Definition statistics.h:111 Real multTimeSparse time for computing A*x exploiting sparsity (setupPupdate(), PRICE step) Definition statistics.h:118 int pivotPrecBoosts number of precision boosts until final basis is reached Definition statistics.h:154 int degenPivotCandPrimal number of pivoting candidates that will produce a degenerate step in the primal Definition statistics.h:167 int multUnsetupCalls number of products A*x w/o sparsity information (setupPupdate(), PRICE step) Definition statistics.h:125 R maxRowViol the max row violations in the original problem using the red prob sol Definition statistics.h:174 void clearSolvingData() clears statistics on solving process Timer * syncTime time for synchronization between real and rational LP (included in solving time) Definition statistics.h:109 Real luSolveTimeRational time for solving linear systems in rational precision Definition statistics.h:130 Real luFactorizationTimeReal time for factorizing bases matrices in real precision Definition statistics.h:127 int luSolvesReal number of (forward and backward) solves with basis matrix in real precision Definition statistics.h:144 int boostedIterationsPolish number of iterations during solution polishing Definition statistics.h:141 R maxBoundViol the max bound violation in the original problem using the red prob sol Definition statistics.h:173 Definition soplex.h:121 Everything should be within this namespace. Preconfigured SoPlex LP solver. Timer class.
|