| /dports/math/asymptote/asymptote-2.67/doc/ |
| H A D | makepen.asy | 6 pen nonconvex=scale(10)*
8 draw((0.5,-1.5),nonconvex);
9 draw((0,-1.5)..(1,-0.5)..(2,-1.5),nonconvex);
|
| /dports/print/texlive-base/texlive-20150521-source/utils/asymptote/doc/ |
| H A D | makepen.asy | 6 pen nonconvex=scale(10)*
8 draw((0.5,-1.5),nonconvex);
9 draw((0,-1.5)..(1,-0.5)..(2,-1.5),nonconvex);
|
| /dports/math/vtk8/VTK-8.2.0/Common/DataModel/Testing/Cxx/ |
| H A D | TestPolygon.cxx | 93 bool nonconvex; in TestPolygon() local
94 nonconvex = !polygon->IsConvex(); in TestPolygon()
95 nonconvex &= !vtkPolygon::IsConvex(polygon->GetPoints(), in TestPolygon()
97 nonconvex &= !vtkPolygon::IsConvex(idArray,polygon->GetPoints()); in TestPolygon()
98 nonconvex &= !vtkPolygon::IsConvex(polygon->GetPoints()); in TestPolygon()
100 if (!nonconvex) in TestPolygon()
|
| /dports/math/vtk9/VTK-9.1.0/Common/DataModel/Testing/Cxx/ |
| H A D | TestPolygon.cxx | 91 bool nonconvex; in TestPolygon() local
92 nonconvex = !polygon->IsConvex(); in TestPolygon()
93 nonconvex &= in TestPolygon()
95 nonconvex &= !vtkPolygon::IsConvex(idArray, polygon->GetPoints()); in TestPolygon()
96 nonconvex &= !vtkPolygon::IsConvex(polygon->GetPoints()); in TestPolygon()
98 if (!nonconvex) in TestPolygon()
|
| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/examples/compiled_interfaces/AMPL/ |
| H A D | rosenbr.mod | 16 # Objective nonseparable, nonconvex
|
| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/acro/packages/colin/test/problems/ |
| H A D | rosenbrock.mod | 16 # Objective nonseparable, nonconvex
|
| /dports/math/nlopt/nlopt-2.7.1/src/algs/ags/ |
| H A D | README | 4 ,Minimization of multiextremal functions under nonconvex constraints,
|
| /dports/math/libmesh/libmesh-1.6.2/contrib/qhull/2012.1/src/libqhullcpp/ |
| H A D | QhullRidge.cpp | 88 if(r.getRidgeT()->nonconvex){ in operator <<()
|
| /dports/math/ipopt/Ipopt-3.12.13/Ipopt/tutorial/Modeling/ |
| H A D | bad1-fix2.mod | 13 # though the original one was very nonconvex, and Ipopt, in some
|
| /dports/math/osqp/osqp-0.6.2/ |
| H A D | CHANGELOG.md | 29 * Added check for nonconvex cost function (non-positive semidefinite `P`) after factorization is pe…
35 * Added check for nonconvex cost function (non-positive semidefinite `P`).
|
| /dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/qhull/src/libqhullcpp/ |
| H A D | QhullRidge.cpp | 110 if(r.getRidgeT()->nonconvex){ in operator <<()
|
| /dports/math/bonmin/Bonmin-releases-1.8.8/Bonmin/doc/ |
| H A D | options_set.tex | 6 \PageSection{Getting good solutions to nonconvex problems}{sec:opt_nonconv}
88 for nonconvex problems.
149 \subsectionH{Getting good solutions to nonconvex problems}{sec:opt_nonconv}
160 No specific heuristic method for treating nonconvex problems is implemented
166 First, in the context of nonconvex problems, {\tt Ipopt} may find different local optima when start…
|
| /dports/math/qhull8/qhull-8.0.2/src/libqhullcpp/ |
| H A D | QhullRidge.cpp | 110 if(r.getRidgeT()->nonconvex){ in operator <<()
|
| /dports/math/qhull/qhull-7.3.2/src/libqhullcpp/ |
| H A D | QhullRidge.cpp | 110 if(r.getRidgeT()->nonconvex){
|
| /dports/math/octave-forge-optim/optim-1.6.1/inst/ |
| H A D | battery.m | 18 ## of a nonconvex function
|
| /dports/science/berkeleygw/BGW-2.0.0/Common/qhull/ |
| H A D | merge.c | 621 ridge->nonconvex= True; in qh_copynonconvex()
915 boolT nonconvex= True, testcentrum= False; in qh_findbestneighbor() local
927 if (ridge->nonconvex) { in qh_findbestneighbor()
935 nonconvex= False; in qh_findbestneighbor()
948 bestfacet->id, facet->id, testcentrum, nonconvex, *distp, *mindistp, *maxdistp)); in qh_findbestneighbor()
1162 if (ridge->tested && !ridge->nonconvex) in qh_getmergeset()
1168 ridge->nonconvex= False; in qh_getmergeset()
1171 ridge->nonconvex= False; in qh_getmergeset()
1174 ridge->nonconvex= True; in qh_getmergeset()
1233 ridge->nonconvex= True; in qh_getmergeset_initial()
[all …]
|
| /dports/science/afni/afni-AFNI_21.3.16/src/qhulldir/ |
| H A D | merge.c | 621 ridge->nonconvex= True; in qh_copynonconvex()
915 boolT nonconvex= True, testcentrum= False; in qh_findbestneighbor() local
927 if (ridge->nonconvex) { in qh_findbestneighbor()
935 nonconvex= False; in qh_findbestneighbor()
948 bestfacet->id, facet->id, testcentrum, nonconvex, *distp, *mindistp, *maxdistp)); in qh_findbestneighbor()
1162 if (ridge->tested && !ridge->nonconvex) in qh_getmergeset()
1168 ridge->nonconvex= False; in qh_getmergeset()
1171 ridge->nonconvex= False; in qh_getmergeset()
1174 ridge->nonconvex= True; in qh_getmergeset()
1233 ridge->nonconvex= True; in qh_getmergeset_initial()
[all …]
|
| /dports/math/py-matplotlib2/matplotlib-2.2.4/extern/libqhull/ |
| H A D | merge.c | 621 ridge->nonconvex= True; in qh_copynonconvex()
916 boolT nonconvex= True, testcentrum= False; in qh_findbestneighbor() local
932 if (ridge->nonconvex) { in qh_findbestneighbor()
940 nonconvex= False; in qh_findbestneighbor()
953 bestfacet->id, facet->id, testcentrum, nonconvex, *distp, *mindistp, *maxdistp)); in qh_findbestneighbor()
1167 if (ridge->tested && !ridge->nonconvex) in qh_getmergeset()
1173 ridge->nonconvex= False; in qh_getmergeset()
1176 ridge->nonconvex= False; in qh_getmergeset()
1179 ridge->nonconvex= True; in qh_getmergeset()
1238 ridge->nonconvex= True; in qh_getmergeset_initial()
[all …]
|
| /dports/cad/meshlab/meshlab-Meshlab-2020.05/src/external/qhull-2003.1/src/ |
| H A D | merge.c | 619 ridge->nonconvex= True; in qh_copynonconvex()
911 boolT nonconvex= True, testcentrum= False; in qh_findbestneighbor() local
923 if (ridge->nonconvex) { in qh_findbestneighbor()
931 nonconvex= False; in qh_findbestneighbor()
944 bestfacet->id, facet->id, testcentrum, nonconvex, *distp, *mindistp, *maxdistp)); in qh_findbestneighbor()
1158 if (ridge->tested && !ridge->nonconvex) in qh_getmergeset()
1164 ridge->nonconvex= False; in qh_getmergeset()
1167 ridge->nonconvex= False; in qh_getmergeset()
1170 ridge->nonconvex= True; in qh_getmergeset()
1229 ridge->nonconvex= True; in qh_getmergeset_initial()
[all …]
|
| /dports/math/libmesh/libmesh-1.6.2/contrib/qhull/2012.1/src/libqhull/ |
| H A D | merge.c | 621 ridge->nonconvex= True; in qh_copynonconvex()
915 boolT nonconvex= True, testcentrum= False; in qh_findbestneighbor() local
927 if (ridge->nonconvex) { in qh_findbestneighbor()
935 nonconvex= False; in qh_findbestneighbor()
948 bestfacet->id, facet->id, testcentrum, nonconvex, *distp, *mindistp, *maxdistp)); in qh_findbestneighbor()
1162 if (ridge->tested && !ridge->nonconvex) in qh_getmergeset()
1168 ridge->nonconvex= False; in qh_getmergeset()
1171 ridge->nonconvex= False; in qh_getmergeset()
1174 ridge->nonconvex= True; in qh_getmergeset()
1233 ridge->nonconvex= True; in qh_getmergeset_initial()
[all …]
|
| /dports/graphics/py-gdal/gdal-3.3.3/alg/internal_libqhull/ |
| H A D | merge.c | 621 ridge->nonconvex= True; in qh_copynonconvex()
915 boolT nonconvex= True, testcentrum= False; in qh_findbestneighbor() local
927 if (ridge->nonconvex) { in qh_findbestneighbor()
935 nonconvex= False; in qh_findbestneighbor()
948 bestfacet->id, facet->id, testcentrum, nonconvex, *distp, *mindistp, *maxdistp)); in qh_findbestneighbor()
1162 if (ridge->tested && !ridge->nonconvex) in qh_getmergeset()
1168 ridge->nonconvex= False; in qh_getmergeset()
1171 ridge->nonconvex= False; in qh_getmergeset()
1174 ridge->nonconvex= True; in qh_getmergeset()
1233 ridge->nonconvex= True; in qh_getmergeset_initial()
[all …]
|
| /dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/qhull/src/libqhull/ |
| H A D | merge.c | 621 ridge->nonconvex= True; in qh_copynonconvex()
916 boolT nonconvex= True, testcentrum= False; in qh_findbestneighbor() local
932 if (ridge->nonconvex) { in qh_findbestneighbor()
940 nonconvex= False; in qh_findbestneighbor()
953 bestfacet->id, facet->id, testcentrum, nonconvex, *distp, *mindistp, *maxdistp)); in qh_findbestneighbor()
1167 if (ridge->tested && !ridge->nonconvex) in qh_getmergeset()
1173 ridge->nonconvex= False; in qh_getmergeset()
1176 ridge->nonconvex= False; in qh_getmergeset()
1179 ridge->nonconvex= True; in qh_getmergeset()
1238 ridge->nonconvex= True; in qh_getmergeset_initial()
[all …]
|
| /dports/math/py-pyhull/pyhull-2015.2.1/src/libqhull/ |
| H A D | merge.c | 621 ridge->nonconvex= True; in qh_copynonconvex()
916 boolT nonconvex= True, testcentrum= False; in qh_findbestneighbor() local
932 if (ridge->nonconvex) { in qh_findbestneighbor()
940 nonconvex= False; in qh_findbestneighbor()
953 bestfacet->id, facet->id, testcentrum, nonconvex, *distp, *mindistp, *maxdistp)); in qh_findbestneighbor()
1167 if (ridge->tested && !ridge->nonconvex) in qh_getmergeset()
1173 ridge->nonconvex= False; in qh_getmergeset()
1176 ridge->nonconvex= False; in qh_getmergeset()
1179 ridge->nonconvex= True; in qh_getmergeset()
1238 ridge->nonconvex= True; in qh_getmergeset_initial()
[all …]
|
| /dports/graphics/p5-Geo-GDAL/gdal-3.3.3/alg/internal_libqhull/ |
| H A D | merge.c | 621 ridge->nonconvex= True; in qh_copynonconvex()
915 boolT nonconvex= True, testcentrum= False; in qh_findbestneighbor() local
927 if (ridge->nonconvex) { in qh_findbestneighbor()
935 nonconvex= False; in qh_findbestneighbor()
948 bestfacet->id, facet->id, testcentrum, nonconvex, *distp, *mindistp, *maxdistp)); in qh_findbestneighbor()
1162 if (ridge->tested && !ridge->nonconvex) in qh_getmergeset()
1168 ridge->nonconvex= False; in qh_getmergeset()
1171 ridge->nonconvex= False; in qh_getmergeset()
1174 ridge->nonconvex= True; in qh_getmergeset()
1233 ridge->nonconvex= True; in qh_getmergeset_initial()
[all …]
|
| /dports/x11-toolkits/wmapp/wmapp-0.0.4.3/ |
| H A D | xwrapper.h | 108 nonconvex = X_MACRO(Nonconvex) }; enumerator
|