• DEVEX

  • Referenced in 100 articles [sw08378]
  • Pivot selection methods of the devex LP code. Pivot column and row selection methods used ... computer would imply, a wider choice of pivot row is made available, so making room ... further selection criterion based on pivot size. Three examples are given of problems having between ... iteration advantages over the standard simplex methods used today. The final illustration highlights why these...
  • Miniball

  • Referenced in 43 articles [sw05179]
  • balls. Consequently, the existing adaptations of the method to the ball case are incorrect ... moreover, there is a variety of pivoting methods for unique sink orientations which have...
  • YSMP

  • Referenced in 73 articles [sw17947]
  • current release features direct methods based on Gaussian elimination without pivoting, and is described ... number of preconditioned conjugate-gradient-like methods as described in Section...
  • LPbook

  • Referenced in 51 articles [sw31782]
  • that illustrate various pivot rules and variants of the simplex method, both for linear programming...
  • BalancedSampling

  • Referenced in 10 articles [sw15761]
  • included sampling methods. The local pivotal method and spatially correlated Poisson sampling (for spatially balanced...
  • ARMS

  • Referenced in 65 articles [sw00048]
  • presented and cover various features of the method. They show that the solver ARMS ... factorization with threshold and with threshold and pivoting...
  • SuiteSparseQR

  • Referenced in 41 articles [sw07348]
  • method is not always exact, it has the advantage of not requiring column pivoting...
  • WinGULF

  • Referenced in 20 articles [sw19224]
  • primal simplex method developed by B.Martos[1] with various pivoting rules and branch-and-bound...
  • RIDE

  • Referenced in 4 articles [sw12147]
  • resonance. The Gaussian Elimination with partial Pivoting (GEP) method for a banded matrix equation...
  • Pfaffian

  • Referenced in 6 articles [sw10808]
  • implementation of a pivoting strategy unnecessary. The second method considered is based on Aitken...
  • ISUD

  • Referenced in 13 articles [sw34491]
  • constructive method that finds this sequence by only using normal pivots on positive coefficients...
  • CyLP

  • Referenced in 2 articles [sw24590]
  • aspects such as the pivot rule. Similarly, most relaxation methods for mixed-integer programming differ ... with primal and dual pivot rules for the simplex method, by building upon COIN...
  • PathAVI

  • Referenced in 1 article [sw23744]
  • structure-preserving pivotal method for affine variational inequalities. Affine variational inequalities (AVI) are an important ... This paper describes PathAVI, a structure-preserving pivotal approach, that can efficiently process (solve...
  • COLAMD

  • Referenced in 32 articles [sw00145]
  • matrices in two contexts: (1) sparse partial pivoting, which requires a sparsity preserving column ... least-squares problems and interior point methods for linear programming problems. The two routines...
  • ABDPACK

  • Referenced in 14 articles [sw01221]
  • multiple shooting techniques and implicit Runge-Kutta methods for solving two-point boundary value problems ... based on an alternate column and row pivoting scheme which avoids most of the fill...
  • ILUCP

  • Referenced in 3 articles [sw20260]
  • pivoting. A new preconditioner ILUCP is introduced to be used with an iterative method ... Crout’s formulation of Gaussian elimination with pivoting by columns. It is usually faster than...
  • MOCHA

  • Referenced in 4 articles [sw08579]
  • methods primarily use the local adjacency structure inherent in matroid polytopes to pivot to feasible...
  • ILU++

  • Referenced in 9 articles [sw20261]
  • solving sparse linear systems with iterative methods using state-of-the-art incomplete multilevel ... matrix more suitable for LU-factorisation), different pivoting strategies and a number of dropping rules...
  • na31

  • Referenced in 9 articles [sw11500]
  • Cauchy-like matrix. It includes various pivoting strategies, already discussed in the literature ... provides a robust implementation of the above method. Our package also includes solvers for Toeplitz...
  • BQPD

  • Referenced in 1 article [sw06198]
  • constraint violations. The Devex method for avoiding near-zero pivots is used to promote stability ... that it also provides an efficient method for linear programming...