• SDPT3

  • Referenced in 697 articles [sw04009]
  • problems in either SDPA or SeDuMi format. Sparsity and block diagonal structure are exploited...
  • PHCpack

  • Referenced in 236 articles [sw00705]
  • polynomial system, in particular its sparsity. In this paper the structure and design...
  • CSDP

  • Referenced in 202 articles [sw00169]
  • systems, and it makes effective use of sparsity in the constraint matrices. CSDP has been...
  • SuperLU

  • Referenced in 194 articles [sw00930]
  • user supplied routines. This preordering for sparsity is completely separate from the factorization. Working precision...
  • SDPA

  • Referenced in 184 articles [sw03275]
  • interior-point method. It fully exploits the sparsity of given problems. There are some variants...
  • ve08

  • Referenced in 148 articles [sw05141]
  • structure. This structure is always implied by sparsity of G, and depends only...
  • TAF

  • Referenced in 85 articles [sw07492]
  • reverse mode of AD and Automatic Sparsity Detection (ASD) for detection of the sparsity structure...
  • hgam

  • Referenced in 73 articles [sw11201]
  • dimensional Additive Modelling. We propose a new sparsity-smoothness penalty for high-dimensional generalized additive ... models. The combination of sparsity and smoothness is crucial for mathematical theory as well ... models. Finally, an adaptive version of our sparsity-smoothness penalized approach yields large additional performance...
  • SuperLU-DIST

  • Referenced in 90 articles [sw00002]
  • user supplied routines. This preordering for sparsity is completely separate from the factorization. Working precision...
  • SoPlex

  • Referenced in 88 articles [sw04063]
  • simplex algorithm. It features preprocessing techniques, exploits sparsity, and offers primal and dual solving routines...
  • BLOOMP

  • Referenced in 28 articles [sw06454]
  • four performance metrics: dynamic range, noise stability, sparsity, and resolution. With respect to dynamic range ... best performer. With respect to sparsity, BLOOMP is the best performer for high dynamic range...
  • LowRankModels

  • Referenced in 37 articles [sw27002]
  • scalings to the model without destroying sparsity, which is useful when the data is poorly...
  • SSS

  • Referenced in 34 articles [sw07794]
  • priors over the model space that induce sparsity and parsimony over and above the traditional...
  • SFSDP

  • Referenced in 33 articles [sw04793]
  • FSDP, SFSDP exploits the aggregated and correlative sparsity of a sensor network localization problem...
  • COLAMD

  • Referenced in 32 articles [sw00145]
  • sparse partial pivoting, which requires a sparsity preserving column pre-ordering prior to numerical factorization...
  • ADMAT

  • Referenced in 31 articles [sw04864]
  • employs many sophisticated techniques such as exploiting sparsity and structure to achieve high efficiency...
  • ParaSails

  • Referenced in 29 articles [sw11521]
  • compute a sparse approximate inverse. The sparsity pattern used is the pattern of a power...
  • LSRN

  • Referenced in 25 articles [sw09555]
  • solver from SuiteSparseQR on sparse problems without sparsity patterns that can be exploited to reduce...
  • DAEPACK

  • Referenced in 17 articles [sw12958]
  • automatically generate new code which determines the sparsity pattern of the model for a given ... inputs (sparsity pattern generation), automatic generation of a discontinuity-locked model and extraction of hidden...
  • Sparsity

  • Referenced in 13 articles [sw08686]
  • Sparsity: Optimization Framework for Sparse Matrix Kernels. Sparse matrix–vector multiplication is an important computational ... zero structure of the matrix. The SPARSITY system is designed to address these problems ... tuned to their matrices and machines. SPARSITY combines traditional techniques such as loop transformations with...