Loading...
Searching...
No Matches
statistics.h
Go to the documentation of this file.
103 Timer* syncTime; ///< time for synchronization between real and rational LP (included in solving time)
109 Real multTimeSparse; ///< time for computing A*x exploiting sparsity (setupPupdate(), PRICE step)
112 Real multTimeUnsetup; ///< time for computing A*x w/o sparsity information (setupPupdate(), PRICE step)
113 int multSparseCalls; ///< number of products A*x exploiting sparsity (setupPupdate(), PRICE step)
116 int multUnsetupCalls; ///< number of products A*x w/o sparsity information (setupPupdate(), PRICE step)
120 Real luFactorizationTimeRational; ///< time for factorizing bases matrices in rational precision
128 int luSolvesReal; ///< number of (forward and backward) solves with basis matrix in real precision
138 int callsReducedProb; ///< number of times the reduced problem is solved. This includes the initial solve.
146 int degenPivotCandPrimal; ///< number of pivoting candidates that will produce a degenerate step in the primal
147 int degenPivotCandDual; ///< number of pivoting candidates that will produce a degenerate step in the dual
151 R totalBoundViol; ///< the sum of the bound violations in the original problem using the red prob sol
152 R totalRowViol; ///< the sum of the row violations in the original problem using the red prob sol
Real luFactorizationTimeRational time for factorizing bases matrices in rational precision Definition statistics.h:120 Real multTimeFull time for computing A*x ignoring sparsity (setupPupdate(), PRICE step) Definition statistics.h:110 int pivotRefinements number of refinement steps until final basis is reached Definition statistics.h:133 int multFullCalls number of products A*x ignoring sparsity (setupPupdate(), PRICE step) Definition statistics.h:114 R finalBasisCondition condition number estimate of the optimal basis matrix Definition statistics.h:160 int luFactorizationsRational number of basis matrix factorizations in rational precision Definition statistics.h:129 Real multTimeUnsetup time for computing A*x w/o sparsity information (setupPupdate(), PRICE step) Definition statistics.h:112 R totalBoundViol the sum of the bound violations in the original problem using the red prob sol Definition statistics.h:151 int multColwiseCalls number of products A*x columnwise (setupPupdate(), PRICE step) Definition statistics.h:115 R sumPrimalDegen the sum of the rate of primal degeneracy at each iteration Definition statistics.h:149 Statistics(Timer::TYPE ttype=Timer::USER_TIME) default constructor int multSparseCalls number of products A*x exploiting sparsity (setupPupdate(), PRICE step) Definition statistics.h:113 Timer * transformTime time for transforming LPs (included in solving time) Definition statistics.h:104 int callsReducedProb number of times the reduced problem is solved. This includes the initial solve. Definition statistics.h:138 int luFactorizationsReal number of basis matrix factorizations in real precision Definition statistics.h:127 int degenPivotCandDual number of pivoting candidates that will produce a degenerate step in the dual Definition statistics.h:147 Real multTimeColwise time for computing A*x columnwise (setupPupdate(), PRICE step) Definition statistics.h:111 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:152 Timer * rationalTime time for rational LP solving (included in solving time) Definition statistics.h:105 Real multTimeSparse time for computing A*x exploiting sparsity (setupPupdate(), PRICE step) Definition statistics.h:109 R decompBasisCondNum the condition number for the basis used to perform the decomposition Definition statistics.h:150 int degenPivotCandPrimal number of pivoting candidates that will produce a degenerate step in the primal Definition statistics.h:146 int multUnsetupCalls number of products A*x w/o sparsity information (setupPupdate(), PRICE step) Definition statistics.h:116 R maxRowViol the max row violations in the original problem using the red prob sol Definition statistics.h:154 void clearSolvingData() clears statistics on solving process Timer * syncTime time for synchronization between real and rational LP (included in solving time) Definition statistics.h:103 Real luSolveTimeRational time for solving linear systems in rational precision Definition statistics.h:121 Real luFactorizationTimeReal time for factorizing bases matrices in real precision Definition statistics.h:118 int luSolvesReal number of (forward and backward) solves with basis matrix in real precision Definition statistics.h:128 R maxBoundViol the max bound violation in the original problem using the red prob sol Definition statistics.h:153 Definition soplex.h:121 Everything should be within this namespace. Preconfigured SoPlex LP solver. Timer class.
|