Home
last modified time | relevance | path

Searched refs:rank_deficiency (Results 1 – 22 of 22) sorted by relevance

/dports/math/highs/HiGHS-cfe064e/src/simplex/
H A DHFactorDebug.cpp186 if (rank_deficiency > 100) return; in debugReportRankDeficiency()
190 for (int i = 0; i < rank_deficiency; i++) in debugReportRankDeficiency()
228 if (rank_deficiency > 10) return; in debugReportRankDeficientASM()
230 ASM = (double*)malloc(sizeof(double) * rank_deficiency * rank_deficiency); in debugReportRankDeficientASM()
233 ASM[i + j * rank_deficiency] = 0; in debugReportRankDeficientASM()
243 if (i < 0 || i >= rank_deficiency) { in debugReportRankDeficientASM()
247 rank_deficiency); in debugReportRankDeficientASM()
263 for (int j = 0; j < rank_deficiency; j++) in debugReportRankDeficientASM()
267 for (int j = 0; j < rank_deficiency; j++) in debugReportRankDeficientASM()
271 for (int j = 0; j < rank_deficiency; j++) in debugReportRankDeficientASM()
[all …]
H A DHFactorDebug.h28 const int rank_deficiency,
36 const vector<int>& iwork, const int rank_deficiency,
45 const int message_level, const int rank_deficiency,
H A DHFactor.cpp273 rank_deficiency = buildKernel(); in build()
275 if (rank_deficiency) { in build()
294 kernel_dim -= rank_deficiency; in build()
299 return rank_deficiency; in build()
703 rank_deficiency = nwork + 1; in buildKernel()
704 return rank_deficiency; in buildKernel()
718 return rank_deficiency; in buildKernel()
871 rank_deficiency = 0; in buildKernel()
872 return rank_deficiency; in buildKernel()
886 noPvR.resize(rank_deficiency); in buildHandleRankDeficiency()
[all …]
H A DHSimplex.cpp291 const int rank_deficiency = computeFactor(highs_model_object); in initialiseSimplexLpBasisAndFactor() local
293 if (rank_deficiency) { in initialiseSimplexLpBasisAndFactor()
299 return rank_deficiency; in initialiseSimplexLpBasisAndFactor()
340 const int rank_deficiency = computeFactor(highs_model_object); in initialiseSimplexLpBasisAndFactor() local
342 assert(!rank_deficiency); in initialiseSimplexLpBasisAndFactor()
2442 int rank_deficiency = factor.rank_deficiency; in simplexHandleRankDeficiency() local
2445 for (int k = 0; k < rank_deficiency; k++) { in simplexHandleRankDeficiency()
2478 const int rank_deficiency = factor.build(factor_timer_clock_pointer); in computeFactor() local
2544 const bool force = rank_deficiency; in computeFactor()
2548 if (rank_deficiency) { in computeFactor()
[all …]
H A DHPrimal.cpp338 int rank_deficiency = computeFactor(workHMO); in primalRebuild() local
340 if (rank_deficiency) { in primalRebuild()
H A DHDual.cpp1983 int rank_deficiency = computeFactor(workHMO); in getNonsingularInverse() local
1992 rank_deficiency = 1; in getNonsingularInverse()
1999 rank_deficiency = 1; in getNonsingularInverse()
2003 if (rank_deficiency) { in getNonsingularInverse()
2026 rank_deficiency, simplex_update_count, in getNonsingularInverse()
H A DHFactor.h190 int rank_deficiency; variable
H A DHQPrimal.cpp378 int rank_deficiency = computeFactor(workHMO); in primalRebuild() local
380 if (rank_deficiency) { in primalRebuild()
/dports/science/py-scipy/scipy-1.7.1/scipy/optimize/_highs/src/simplex/
H A DHFactorDebug.cpp189 if (rank_deficiency > 100) return; in debugReportRankDeficiency()
193 for (int i = 0; i < rank_deficiency; i++) in debugReportRankDeficiency()
231 if (rank_deficiency > 10) return; in debugReportRankDeficientASM()
233 ASM = (double*)malloc(sizeof(double) * rank_deficiency * rank_deficiency); in debugReportRankDeficientASM()
236 ASM[i + j * rank_deficiency] = 0; in debugReportRankDeficientASM()
246 if (i < 0 || i >= rank_deficiency) { in debugReportRankDeficientASM()
250 rank_deficiency); in debugReportRankDeficientASM()
266 for (int j = 0; j < rank_deficiency; j++) in debugReportRankDeficientASM()
270 for (int j = 0; j < rank_deficiency; j++) in debugReportRankDeficientASM()
274 for (int j = 0; j < rank_deficiency; j++) in debugReportRankDeficientASM()
[all …]
H A DHFactorDebug.h28 const int rank_deficiency,
36 const vector<int>& iwork, const int rank_deficiency,
45 const int message_level, const int rank_deficiency,
H A DHFactor.cpp273 rank_deficiency = buildKernel(); in build()
275 if (rank_deficiency) { in build()
294 kernel_dim -= rank_deficiency; in build()
299 return rank_deficiency; in build()
703 rank_deficiency = nwork + 1; in buildKernel()
704 return rank_deficiency; in buildKernel()
716 return rank_deficiency; in buildKernel()
869 rank_deficiency = 0; in buildKernel()
870 return rank_deficiency; in buildKernel()
884 noPvR.resize(rank_deficiency); in buildHandleRankDeficiency()
[all …]
H A DHSimplex.cpp291 const int rank_deficiency = computeFactor(highs_model_object); in initialiseSimplexLpBasisAndFactor() local
293 if (rank_deficiency) { in initialiseSimplexLpBasisAndFactor()
299 return rank_deficiency; in initialiseSimplexLpBasisAndFactor()
340 const int rank_deficiency = computeFactor(highs_model_object); in initialiseSimplexLpBasisAndFactor() local
342 assert(!rank_deficiency); in initialiseSimplexLpBasisAndFactor()
2442 int rank_deficiency = factor.rank_deficiency; in simplexHandleRankDeficiency() local
2445 for (int k = 0; k < rank_deficiency; k++) { in simplexHandleRankDeficiency()
2478 const int rank_deficiency = factor.build(factor_timer_clock_pointer); in computeFactor() local
2544 const bool force = rank_deficiency; in computeFactor()
2548 if (rank_deficiency) { in computeFactor()
[all …]
H A DHPrimal.cpp338 int rank_deficiency = computeFactor(workHMO); in primalRebuild() local
340 if (rank_deficiency) { in primalRebuild()
H A DHDual.cpp1979 int rank_deficiency = computeFactor(workHMO); in getNonsingularInverse() local
1988 rank_deficiency = 1; in getNonsingularInverse()
1995 rank_deficiency = 1; in getNonsingularInverse()
1999 if (rank_deficiency) { in getNonsingularInverse()
2022 rank_deficiency, simplex_update_count, in getNonsingularInverse()
H A DHFactor.h190 int rank_deficiency; variable
H A DHQPrimal.cpp378 int rank_deficiency = computeFactor(workHMO); in primalRebuild() local
380 if (rank_deficiency) { in primalRebuild()
/dports/science/InsightToolkit/ITK-5.0.1/Modules/ThirdParty/VNL/src/vxl/core/vnl/algo/
H A Dvnl_cholesky.h70 int rank_deficiency() const { return num_dims_rank_def_; } in rank_deficiency() function
H A Dvnl_ldl_cholesky.h89 int rank_deficiency() const { return num_dims_rank_def_; } in rank_deficiency() function
H A Dvnl_sparse_lm.cxx181 if ( Sa_cholesky.rank_deficiency() > 0 ) in minimize()
229 if ( Sa_cholesky.rank_deficiency() > 0 ) in minimize()
503 if ( Vj_cholesky.rank_deficiency() > 0 ) in compute_invV_Y()
656 if ( Sc_cholesky.rank_deficiency() > 0 ) in solve_dc()
/dports/misc/vxl/vxl-3.3.2/core/vnl/algo/
H A Dvnl_cholesky.h70 int rank_deficiency() const { return num_dims_rank_def_; } in rank_deficiency() function
H A Dvnl_ldl_cholesky.h89 int rank_deficiency() const { return num_dims_rank_def_; } in rank_deficiency() function
H A Dvnl_sparse_lm.cxx183 if (Sa_cholesky.rank_deficiency() > 0) in minimize()
231 if (Sa_cholesky.rank_deficiency() > 0) in minimize()
523 if (Vj_cholesky.rank_deficiency() > 0) in compute_invV_Y()
678 if (Sc_cholesky.rank_deficiency() > 0) in solve_dc()