• SPGL1

  • Referenced in 154 articles [sw08365]
  • basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem...
  • ParNes

  • Referenced in 12 articles [sw08366]
  • squares problem with a 1-norm constraint on the solution. We prove under the assumption ... sparsity condition on the solution, that nesta-lasso is guaranteed to be almost always locally ... bpdn) problem (i.e., approximating the minimum 1-norm solution to an underdetermined least squares problem...
  • DGELSS

  • Referenced in 3 articles [sw05210]
  • LAPACK: SUBROUTINE DGELSS DGELSS computes the minimum norm solution to a real linear least squares...
  • PDNET

  • Referenced in 39 articles [sw04752]
  • implementation of this algorithm for solving the minimum-cost network flow problem. In each iteration ... search direction is computed inexactly, and the norm of the resulting residual vector is used ... iterative solver employed for the solution of the system. In the implementation, a preconditioned conjugate ... tested on a large set of standard minimum-cost network flow test problems. Computational results...
  • CGLS-GCV

  • Referenced in 1 article [sw02400]
  • rank-deficient problems: construction of a minimum norm solution of the unperturbed least squares problem...
  • GMBACK

  • Referenced in 12 articles [sw02139]
  • GMBACK: A generalised minimum backward error algorithm for nonsymmetric linear systems A drawback of employing ... residual error norm as a stopping condition in an iterative process is that the error ... present an algorithm which computes an approximate solution to the linear system $Ax = b$ such...
  • SpaRSA

  • Referenced in 3 articles [sw20467]
  • Reconstruction by Separable Approximation. Finding sparse approximate solutions to large underdetermined linear systems of equations ... sparsity-inducing (usually the 1-norm) regularizer. We present an algorithmic framework for the more ... proposed iterative algorithm to a minimum of the objective function. In addition to solving ... yields efficient solution techniques for other regularizers, such as an 1-norm and group-separable...
  • BEDFix

  • Referenced in 8 articles [sw04469]
  • constant 1 with respect to the infinity norm; such functions are commonly found in economics ... highly efficient when used to compute residual solutions for bivariate functions, having a bound ... gradient information; also, it handles functions with minimum Lipschitz constants equal to 1, whereas...
  • ANSYS

  • Referenced in 647 articles [sw00044]
  • ANSYS offers a comprehensive software suite that spans...
  • Expokit

  • Referenced in 171 articles [sw00258]
  • Expokit provides a set of routines aimed at...
  • GAP

  • Referenced in 2707 articles [sw00320]
  • GAP is a system for computational discrete algebra...
  • GAUSS

  • Referenced in 114 articles [sw00322]
  • The GAUSS Mathematical and Statistical System is a...
  • HSL

  • Referenced in 265 articles [sw00418]
  • HSL (formerly the Harwell Subroutine Library) is a...
  • KANT/KASH

  • Referenced in 155 articles [sw00481]
  • KASH/KANT is a computer algebra system (CAS) for...
  • LANCELOT

  • Referenced in 293 articles [sw00500]
  • LANCELOT. A Fortran package for large-scale nonlinear...
  • LAPACK

  • Referenced in 1590 articles [sw00503]
  • LAPACK is written in Fortran 90 and provides...
  • LSQR

  • Referenced in 343 articles [sw00530]
  • Algorithm 583: LSQR: Sparse Linear Equations and Least...
  • Macaulay2

  • Referenced in 1579 articles [sw00537]
  • Macaulay2 is a software system devoted to supporting...
  • Magma

  • Referenced in 2720 articles [sw00540]
  • Computer algebra system (CAS). Magma is a large...
  • Maple

  • Referenced in 4933 articles [sw00545]
  • The result of over 30 years of cutting...