• fminsearch

  • Referenced in 258 articles [sw07467]
  • dimensions The Nelder--Mead simplex algorithm, first published in 1965, is an enormously popular direct...
  • SoPlex

  • Referenced in 89 articles [sw04063]
  • solver based on the revised simplex algorithm. It features preprocessing techniques, exploits sparsity, and offers ... Wunderling’s Ph.D. thesis Paralleler und Objektorientierter Simplex-Algorithmus (in German) and is available...
  • MarPlex

  • Referenced in 25 articles [sw06750]
  • simplex algorithm initializing This paper discusses the importance of a starting point in the simplex ... problems have better performances than the classical algorithm for finding initial solution. The comparison ... number of iterations required by the simplex algorithm to find the optimal solution...
  • ISUD

  • Referenced in 12 articles [sw34491]
  • polytope and proposed adaptations of the simplex algorithm that find an optimal solution ... paper uses ideas from the improved primal simplex to deal efficiently with degeneracy and find ... leads to a better integer solution, the algorithm ... referred to as the integral simplex using decomposition algorithm uses a subproblem to find...
  • LPbook

  • Referenced in 49 articles [sw31782]
  • that implement the major algorithms studied: -- The two-phase simplex method; -- The primal-dual simplex...
  • FASTCLIME

  • Referenced in 12 articles [sw10889]
  • package efficiently implements the parametric simplex algorithm, which provides a scalable and sophisticated tool...
  • DistMesh

  • Referenced in 269 articles [sw12766]
  • scientific computing and computer graphics. An unstructured simplex mesh requires a choice of meshpoints (vertex ... reset the topology by the Delaunay algorithm. The geometry is described implicitly by its distance...
  • DEVEX

  • Referenced in 100 articles [sw08378]
  • time and iteration advantages over the standard simplex methods used today. The final illustration highlights ... standard methods take so many iterations. These algorithms were originally coded for the Atlas computer...
  • V-Clip

  • Referenced in 11 articles [sw33996]
  • Canny, and the Enhanced GJK algorithm, a simplex-based algorithm that is widely used...
  • COCA

  • Referenced in 9 articles [sw05004]
  • algorithm for complex linear approximation based on semi-infinite programming Complex linear approximation, even with ... single step in the simplex algorithm which increases the lower bound for the maximal error...
  • AS 47

  • Referenced in 16 articles [sw03898]
  • Algorithm AS 47. Function minimization using a simplex procedure...
  • PARSMI

  • Referenced in 7 articles [sw22139]
  • PARSMI, a parallel revised simplex algorithm incorporating minor iterations and Devex pricing. When solving linear ... programming problems using the revised simplex method, two common variants are the incorporation of minor ... iterations of the standard simplex method applied to a small subset of the variables ... parallel algorithm PARSMI is presented in which computational components of the revised simplex method with...
  • subplex

  • Referenced in 25 articles [sw04818]
  • than the simplex method. It can be used like the Matlab fminsearch algorithm. SUBPLEX...
  • LEBFEK

  • Referenced in 15 articles [sw32027]
  • Lebesgue points: simplex, square, disk we have described some algorithms for computing (quasi-)Lebesgue...
  • PipLib

  • Referenced in 19 articles [sw23763]
  • parametrized Gomory’s cuts algorithm followed by the parameterized dual simplex method. The PIP Library...
  • XA

  • Referenced in 7 articles [sw21986]
  • implements primal simplex, dual simplex, and barrier algorithms for solving linear problems. The primal/dual simplex ... particularly efficient on large models. Both algorithms benefit from XA’s presolver, which reduces...
  • SIMPAR

  • Referenced in 4 articles [sw10423]
  • implementation of a robust simplex algorithm on a PC enhanced with a ring...
  • SimpleS

  • Referenced in 4 articles [sw04413]
  • Algorithm 860: SimpleS -- an extension of Freudenthal’s simplex subdivision. This article presents a simple ... efficient algorithm for the subdivision of a $d$-dimensional simplex in $k^d$ simplices, where ... Freudenthal’s strategy. The proposed simplex subdivision algorithm is motivated by a problem...
  • linprog

  • Referenced in 4 articles [sw11614]
  • Linear Optimization problems by using the simplex algorithm...
  • SIAD

  • Referenced in 4 articles [sw25997]
  • Object Pascal coding for writing the Simplex algorithm to solve LPPs and also...