• HOPDM

  • Referenced in 73 articles [sw04342]
  • infeasible primal-dual interior point method. It uses multiple centrality correctors; their number is chosen ... HOPDM automatically chooses the most efficient factorization method for a given problem (either normal equations...
  • MINOS

  • Referenced in 440 articles [sw05095]
  • methods are employed throughout. Features include a new basis package (for maintaining sparse LU factors...
  • CGS

  • Referenced in 301 articles [sw08225]
  • conjugate gradient method) with a preconditioning called ILLU (an incomplete line-LU-factorization). The conclusion...
  • ARPACK

  • Referenced in 781 articles [sw04218]
  • Lanczos process called the Implicitly Restarted Lanczos Method (IRLM). These variants may be viewed ... problems. For many standard problems, a matrix factorization is not required. Only the action...
  • TRON

  • Referenced in 109 articles [sw04714]
  • preconditioned conjugate gradient method with an incomplete Cholesky factorization to generate a direction...
  • DRIC

  • Referenced in 23 articles [sw12610]
  • method.A new incomplete factorization method is proposed, differing from previous ones ... which the diagonal entries of the triangular factors are defined. A comparison ... given with the dynamic modified incomplete factorization methods of O. Axelsson and V. A. Barker...
  • GLLAMM

  • Referenced in 34 articles [sw06517]
  • with method d0). In the case of discrete random effects or factors, the marginal ... continuous (multivariate) normal random effects or factors. Two methods are available for numerical integration: Quadrature...
  • NeNMF

  • Referenced in 30 articles [sw17586]
  • NeNMF: An optimal gradient method for non-negative matrix factorization. Nonnegative matrix factorization ... product of two low-rank nonnegative matrix factors. It has been widely applied to signal ... Nesterov’s optimal gradient method to alternatively optimize one factor with another fixed. In particular ... round, the matrix factor is updated by using the PG method performed on a smartly...
  • ARMS

  • Referenced in 63 articles [sw00048]
  • BILUTM. All these methods are based on a block incomplete LU factorization. The ARMS ... presented and cover various features of the method. They show that the solver ARMS ... slower than ILUT and ILUTP (incomplete LU factorization with threshold and with threshold and pivoting...
  • Superiso

  • Referenced in 19 articles [sw00929]
  • Hamiltonian approach and within the QCD factorization method. We show that isospin symmetry breaking proves...
  • PARAFAC

  • Referenced in 20 articles [sw14789]
  • factor analysis. We review the method of Parallel Factor Analysis, which simultaneously fits multiple ... model is fully identified; the orientation of factors is uniquely determined by minimizing residual error ... from different studies, etc. To demonstrate the method we analyze data from an experiment ... need to increase the method’s robustness against nonstationary factor structures and qualitative (nonproportional) factor...
  • PENSDP

  • Referenced in 21 articles [sw05119]
  • using iterative solvers The limiting factors of second-order methods for large-scale semidefinite optimization ... factorization of the Newton matrix. For a particular algorithm based on the modified barrier method ... routinely used direct factorization techniques. The preconditioned conjugate gradient method proves to be a viable...
  • AFMULT

  • Referenced in 21 articles [sw08201]
  • Multiple factor analysis (AFMULT package). Multiple Factor Analysis (MFA) studies several groups of variables (numerical ... view already used in others methods as: factor analysis in which groups of variables...
  • CAPUSHE

  • Referenced in 48 articles [sw13365]
  • multiplicative factor: the “slope heuristics”. Theoretical works validate this heuristic method in some situations...
  • CONOPT

  • Referenced in 162 articles [sw02791]
  • algorithm with the popular methods based on sequential linearized subproblems forms the basis for discussions ... critical components in a GRG code: basis factorizations, search directions, line-searches, and Newton iterations...
  • CFRAC

  • Referenced in 9 articles [sw25814]
  • algorithm. One of the most popular methods for factoring large integers is the continued fraction ... CFRAC results is a very powerful factoring method. Indeed, the use of EAS alone increases...
  • SPARSE-QR

  • Referenced in 17 articles [sw05215]
  • factorization. Sparse linear least squares problems are instead solved by the augmented system method ... heuristic. We describe a multifrontal method for sparse QR factorization and its implementation in MATLAB ... Using the new routine, we implement two methods for the solution of sparse linear least ... method as accurate as the methods based on QR factorization...
  • mdp

  • Referenced in 9 articles [sw14129]
  • Locally Linear Embedding), several classifiers, probabilistic methods (Factor Analysis, RBM), data pre-processing methods...
  • PESTO

  • Referenced in 21 articles [sw20864]
  • conditional gradient method by more than a factor of two. We also show...
  • ALCON

  • Referenced in 35 articles [sw05315]
  • iteration the Gauss-Newton method is used where the QR-factorization of the Jacobian ... gebraic system of equations (Con)tinuation method. Pathfollowing method for parameter-dependent nonlinear systems...