
fminsearch
 Referenced in 271 articles
[sw07467]
 Mead simplex algorithm, first published in 1965, is an enormously popular direct search method...

testmatrix
 Referenced in 81 articles
[sw14347]
 directions method, the multidirectional search method and the NelderMead simplex method...

subplex
 Referenced in 25 articles
[sw04818]
 SUBPLEX is a subspacesearching simplex method for the unconstrained optimization of general multivariate functions...

JuliBootS
 Referenced in 32 articles
[sw40366]
 simplex method capable of handling arbitrary precision linear programming problems with continuous search spaces. Current...

WinGULF
 Referenced in 19 articles
[sw19224]
 problem using simplex method, the package may be used to check correctness of your interim ... package can assist you to generate appropriate search tree with detailed information on subproblems ... special extended version of primal simplex method developed by B.Martos[1] with various pivoting rules ... branchandbound procedure (with various searching strategies and branching rules) for integer...

nelmead
 Referenced in 1 article
[sw05267]
 depends on few variables,NelderMead simplexsearch method (no sound theoretical basis...

neldermead
 Referenced in 2 articles
[sw23545]
 Provides several direct search optimization algorithms based on the simplex method. The provided algorithms ... direct search algorithms, i.e. algorithms which do not use the derivative of the cost function ... simplex. The following algorithms are available: the fixed shape simplex method of Spendley, Hext...

CyLP
 Referenced in 2 articles
[sw24590]
 solvers with python. Implementations of the simplex method differ mostly in specific aspects such ... pivot rule. Similarly, most relaxation methods for mixedinteger programming differ mostly in the type ... cuts and the exploration of the search tree. We provide a scripting mechanism to easily ... dual pivot rules for the simplex method, by building upon COINOR’s opensource...

QPsimplex
 Referenced in 5 articles
[sw31751]
 Simplex QPbased methods for minimizing a conic quadratic objective over polyhedra. We consider minimizing ... relaxations repeatedly at the nodes of the search tree. In order to overcome this shortcoming ... descent and bisection algorithms utilizing the simplex method for quadratic programming, which makes the solution...

simps
 Referenced in 0 articles
[sw25357]
 iterations of fulldimensional simplex calls (NelderMead direct search method), each time followed...

BBOB
 Referenced in 1 article
[sw38130]
 known problem in the simplex search behaviour. We also give a reasonably good populationbased ... variant of the NelderMead method...

UMDA/S
 Referenced in 1 article
[sw24583]
 Marginal Distribution Algorithm with NelderMead Simplex Search, which utilizes the optimization space structure ... excellent parameters, as compared to existing static methods and search algorithms...

BARON
 Referenced in 354 articles
[sw00066]
 BARON is a computational system for solving nonconvex...

CGAL
 Referenced in 384 articles
[sw00118]
 The goal of the CGAL Open Source Project...

CoCoA
 Referenced in 654 articles
[sw00143]
 CoCoA is a system for Computations in Commutative...

Coq
 Referenced in 1880 articles
[sw00161]
 Coq is a formal proof management system. It...

GAP
 Referenced in 3154 articles
[sw00320]
 GAP is a system for computational discrete algebra...

GLOB
 Referenced in 37 articles
[sw00357]
 GLOB  a new VNSbased software for global...

gmp
 Referenced in 282 articles
[sw00363]
 GMP is a free library for arbitrary precision...