Home
last modified time | relevance | path

Searched refs:nlrows (Results 1 – 24 of 24) sorted by relevance

/dports/math/SCIP/scip-7.0.3/src/scip/
H A Dsepa_gauge.c138 assert(nlrows != NULL); in storeNonlinearConvexNlrows()
153 nlrow = nlrows[i]; in storeNonlinearConvexNlrows()
165 sepadata->nlrows[sepadata->nnlrows] = nlrow; in storeNonlinearConvexNlrows()
377 assert(nlrows != NULL); in findPointPosition()
390 nlrow = nlrows[nlrowsidx[i]]; in findPointPosition()
504 assert(nlrows != NULL); in findBoundaryPoint()
735 SCIP_NLROW** nlrows; in separateCuts() local
750 nlrows = sepadata->nlrows; in separateCuts()
756 assert(nlrows != NULL); in separateCuts()
828 nlrow = nlrows[nlrowsidx[i]]; in separateCuts()
[all …]
H A Dheur_multistart.c211 SCIP_NLROW** nlrows, /**< array containing all nlrows */ in getMinFeas() argument
223 assert(nlrows != NULL); in getMinFeas()
230 assert(nlrows[i] != NULL); in getMinFeas()
232 SCIP_CALL( SCIPgetNlRowSolFeasibility(scip, nlrows[i], sol, &tmp) ); in getMinFeas()
370 assert(nlrows != NULL); in improvePoint()
377 SCIP_CALL( getMinFeas(scip, nlrows, nnlrows, point, minfeas) ); in improvePoint()
440 …if( !SCIPisInfinity(scip, SCIPnlrowGetRhs(nlrows[i])) && SCIPisGT(scip, activity, SCIPnlrowGetRhs(… in improvePoint()
469 SCIP_CALL( getMinFeas(scip, nlrows, nnlrows, point, minfeas) ); in improvePoint()
801 SCIP_NLROW** nlrows; in applyHeur() local
824 nlrows = SCIPgetNLPNlRows(scip); in applyHeur()
[all …]
H A Dprop_nlobbt.c152 SCIP_NLROW** nlrows; in isNlobbtApplicable() local
159 nlrows = SCIPgetNLPNlRows(scip); in isNlobbtApplicable()
167 if( SCIPnlrowGetNQuadElems(nlrows[i]) == 0 && SCIPnlrowGetExprtree(nlrows[i]) == NULL ) in isNlobbtApplicable()
169 else if( SCIPnlrowGetCurvature(nlrows[i]) == SCIP_EXPRCURV_CONVEX ) in isNlobbtApplicable()
171 if( !SCIPisInfinity(scip, SCIPnlrowGetRhs(nlrows[i])) ) in isNlobbtApplicable()
173 if( !SCIPisInfinity(scip, -SCIPnlrowGetLhs(nlrows[i])) ) in isNlobbtApplicable()
176 else if( SCIPnlrowGetCurvature(nlrows[i]) == SCIP_EXPRCURV_CONCAVE ) in isNlobbtApplicable()
178 if( !SCIPisInfinity(scip, SCIPnlrowGetRhs(nlrows[i])) ) in isNlobbtApplicable()
180 if( !SCIPisInfinity(scip, -SCIPnlrowGetLhs(nlrows[i])) ) in isNlobbtApplicable()
185 if( !SCIPisInfinity(scip, SCIPnlrowGetRhs(nlrows[i])) ) in isNlobbtApplicable()
[all …]
H A Dsepa_convexproj.c100 SCIP_NLROW** nlrows; /**< convex nlrows */ member
135 SCIPfreeBlockMemoryArray(scip, &sepadata->nlrows, sepadata->nlrowssize); in sepadataClear()
402 assert(sepadata->nlrows != NULL); in separateCuts()
506 nlrow = sepadata->nlrows[i]; in separateCuts()
638 assert(sepadata->nlrows != NULL); in computeMaxViolation()
648 nlrow = sepadata->nlrows[i]; in computeMaxViolation()
687 SCIP_NLROW** nlrows, /**< nlrows from which to store convex ones */ in storeNonlinearConvexNlrows() argument
699 SCIP_CALL( SCIPallocBlockMemoryArray(scip, &(sepadata->nlrows), nnlrows) ); in storeNonlinearConvexNlrows()
709 nlrow = nlrows[i]; in storeNonlinearConvexNlrows()
721 sepadata->nlrows[sepadata->nnlrows] = nlrow; in storeNonlinearConvexNlrows()
[all …]
H A Dnlp.c3600 assert(nlp->nlrows[oldpos] != NULL); in nlpMoveNlrow()
3605 nlp->nlrows[newpos] = nlp->nlrows[oldpos]; in nlpMoveNlrow()
3634 assert(nlp->nlrows != NULL); in nlpDelNlRowPos()
3636 nlrow = nlp->nlrows[pos]; in nlpDelNlRowPos()
3937 nlrow = nlp->nlrows[i]; in nlpDelVarPos()
4443 nlrow = nlp->nlrows[i]; in nlpFlushNlRowAdditions()
4816 … nlp->nlrows[i]->dualsol = nlrowdualvals != NULL ? nlrowdualvals[nlp->nlrows[i]->nlpiindex] : 0.0; in nlpSolve()
5161 (*nlp)->nlrows = NULL; in SCIPnlpCreate()
5856 nlrow = nlp->nlrows[c]; in SCIPnlpGetVarsNonlinearity()
5912 nlrow = nlp->nlrows[c]; in SCIPnlpHasContinuousNonlinearity()
[all …]
H A Dstruct_nlp.h137 SCIP_NLROW** nlrows; /**< nonlinear rows */ member
H A Dscip_nonlinear.h174 SCIP_NLROW** nlrows, /**< nonlinear rows */
H A Dheur_undercover.c1255 SCIP_NLROW** nlrows; in createCoveringProblem() local
1262 nlrows = SCIPgetNLPNlRows(scip); in createCoveringProblem()
1266 assert(nlrows[i] != NULL); in createCoveringProblem()
1269 if( SCIPhashmapExists(nlrowmap, nlrows[i]) ) in createCoveringProblem()
1274 … SCIP_CALL( processNlRow(scip, nlrows[i], exprint, &hessiandata, coveringscip, nvars, coveringvars, in createCoveringProblem()
3356 SCIP_NLROW** nlrows; in SCIP_DECL_HEUREXEC() local
3362 nlrows = SCIPgetNLPNlRows(scip); in SCIP_DECL_HEUREXEC()
3368 assert(nlrows[i] != NULL); in SCIP_DECL_HEUREXEC()
3369 …run = SCIPnlrowGetExprtree(nlrows[i]) != NULL && SCIPexprtreeGetNVars(SCIPnlrowGetExprtree(nlrows[… in SCIP_DECL_HEUREXEC()
3370 run = run || SCIPnlrowGetNQuadVars(nlrows[i]) > 0; in SCIP_DECL_HEUREXEC()
H A Dscip_nlp.h234 …SCIP_NLROW*** nlrows, /**< pointer to store the array of NLP nonlinear rows, o…
H A Dscip_nlp.c391 …SCIP_NLROW*** nlrows, /**< pointer to store the array of NLP nonlinear rows, o… in SCIPgetNLPNlRowsData() argument
403 if( nlrows != NULL ) in SCIPgetNLPNlRowsData()
404 *nlrows = SCIPnlpGetNlRows(scip->nlp); in SCIPgetNLPNlRowsData()
H A Dscip_nonlinear.c962 SCIP_NLROW** nlrows, /**< nonlinear rows */ in SCIPcreateNlpiProb() argument
999 assert(nlrows != NULL); in SCIPcreateNlpiProb()
1109 nlrow = nlrows[i]; in SCIPcreateNlpiProb()
H A Dnlp.h483 SCIP_NLROW** nlrows /**< rows to add */
/dports/math/SCIP/scip-7.0.3/tests/src/prop/
H A Dnlobbt.c90 SCIP_NLROW* nlrows[5]; variable
133 …SCIP_CALL( SCIPcreateNlRow(scip, &nlrows[0], "nlrow_0", 0.0, 2, vars, lincoefs, 2, vars, 2, quadel…
142 …SCIP_CALL( SCIPcreateNlRow(scip, &nlrows[1], "nlrow_1", 0.0, 0, NULL, NULL, 2, vars, 2, quadelems,…
148 …SCIP_CALL( SCIPcreateNlRow(scip, &nlrows[2], "nlrow_2", 0.0, 0, NULL, NULL, 2, vars, 1, quadelems,…
153 …SCIP_CALL( SCIPcreateNlRow(scip, &nlrows[3], "nlrow_3", -1.0, 2, vars, lincoefs, 0, NULL, 0, NULL,…
163 …SCIP_CALL( SCIPcreateNlRow(scip, &nlrows[4], "nlrow_4", 0.0, 2, vars, lincoefs, 0, NULL, 0, NULL, …
169 …SCIP_CALL( SCIPcreateNlpiProb(scip, nlpi, nlrows, 5, nlpiprob, var2idx, NULL, nlscore, -1.5, FALSE…
250 SCIP_CALL( SCIPreleaseNlRow(scip, &nlrows[i]) );
/dports/math/SCIP/scip-7.0.3/tests/src/heur/
H A Dmultistart.c216 SCIP_NLROW* nlrows[2]; variable
235 …SCIP_CALL( SCIPcreateNlRow(scip, &nlrows[0], "nlrow1", 0.0, 2, vars, lincoefs, 0, NULL, 0, NULL, N…
237 …SCIP_CALL( improvePoint(scip, nlrows, 1, varindex, exprint, sol, 1, 0.0, INT_MAX, &minfeas, nlrowg…
248 …SCIP_CALL( SCIPcreateNlRow(scip, &nlrows[1], "nlrow2", 0.0, 0, NULL, NULL, 2, vars, 2, quadelems, …
254 …SCIP_CALL( improvePoint(scip, &nlrows[1], 1, varindex, exprint, sol, 10, 0.0, INT_MAX, &minfeas, n…
261 …SCIP_CALL( improvePoint(scip, &nlrows[1], 1, varindex, exprint, sol, 100, 0.0, INT_MAX, &minfeas, …
268 …SCIP_CALL( improvePoint(scip, nlrows, 2, varindex, exprint, sol, 100, 0.0, INT_MAX, &minfeas, nlro…
273 SCIP_CALL( SCIPreleaseNlRow(scip, &nlrows[1]) );
274 SCIP_CALL( SCIPreleaseNlRow(scip, &nlrows[0]) );
/dports/math/SCIP/scip-7.0.3/examples/Relaxator/src/
H A Drelax_nlp.c74 SCIP_NLROW** nlrows; in SCIP_DECL_RELAXEXEC() local
88 nlrows = SCIPgetNLPNlRows(scip); in SCIP_DECL_RELAXEXEC()
98 …SCIP_CALL( SCIPcreateNlpiProb(scip, nlpi, nlrows, nnlrows, nlpiprob, var2idx, NULL, NULL, SCIPgetC… in SCIP_DECL_RELAXEXEC()
/dports/math/SCIP/scip-7.0.3/tests/src/sepa/
H A Dgauge.c317 SCIP_NLROW* nlrows[2]; in evaluate_gauge() local
326 nlrows[0] = nlrow1; in evaluate_gauge()
327 nlrows[1] = nlrow2; in evaluate_gauge()
343 …SCIP_CALL( findBoundaryPoint(scip, nlrows, nlrowsidx, nnlrowsidx, convexsides, interior_sol, tosep… in evaluate_gauge()
364 …SCIP_CALL( findBoundaryPoint(scip, nlrows, nlrowsidx, nnlrowsidx, convexsides, interior_sol, tosep… in evaluate_gauge()
385 …SCIP_CALL( findBoundaryPoint(scip, nlrows, nlrowsidx, nnlrowsidx, convexsides, interior_sol, tosep… in evaluate_gauge()
H A Dconvexproj.c262 SCIP_NLROW* nlrows[3] = {nlrow1, nlrow2, nlrow3}; in setup_sepadata() local
267 SCIP_CALL( storeNonlinearConvexNlrows(scip, sepadata, nlrows, 3) ); in setup_sepadata()
284 SCIP_CALL( SCIPcreateNlpiProb(scip, sepadata->nlpi, nlrows, 3, in setup_sepadata()
/dports/science/py-gpaw/gpaw-21.6.0/gpaw/lrtddft2/
H A Dlr_transitions.py88 nlrows = self.K_matrix.values.shape[0]
98 self.eigenvectors = np.zeros((nlrows, nlcols), dtype=float)
113 nlrows = self.K_matrix.values.shape[0]
127 omega_matrix = np.zeros((nlrows, nlcols), dtype=float)
H A Dlr_response.py539 nlrows = self.lrtddft2.K_matrix.values.shape[0]
556 KN_matrix_T = np.zeros([nlcols, nlrows])
557 A_matrix_T = np.zeros((nlcols * 4, nlrows * 4))
/dports/math/dbcsr/dbcsr-2.1.0/src/dist/
H A Ddbcsr_dist_methods.F494 group_size, i, last_row, nlrows, & local
509 nlrows = dbcsr_distribution_nlocal_rows(dist)
/dports/science/cp2k/cp2k-2e995eec7fd208c8a72d9544807bd8b8ba8cd1cc/exts/dbcsr/src/dist/
H A Ddbcsr_dist_methods.F497 group_size, i, last_row, nlrows, & local
512 nlrows = dbcsr_distribution_nlocal_rows(dist)
/dports/science/PETSc/petsc-3.14.1/src/mat/impls/dense/mpi/
H A Dmpidense.c263 PetscInt lda,i,j,rstart,rend,nrows,ncols,Ncols,nlrows,nlcols; in MatCreateSubMatrix_MPIDense() local
287 ierr = MatGetLocalSize(A,&nlrows,&nlcols);CHKERRQ(ierr); in MatCreateSubMatrix_MPIDense()
/dports/math/py-PySCIPOpt/PySCIPOpt-3.0.2/src/pyscipopt/
H A Dscip.pyx2790 cdef SCIP_NLROW** nlrows
2792 nlrows = SCIPgetNLPNlRows(self._scip)
2793 return [NLRow.create(nlrows[i]) for i in range(self.getNNlRows())]
/dports/math/SCIP/scip-7.0.3/
H A DCHANGELOG503 - SCIPcreateNlpiProb takes a hashmap to store the map between the nlrows and the index in the nlrow…