Back to Results
First PageMeta Content
Numerical linear algebra / Mathematical optimization / Operations research / Regression analysis / Least squares / Linear programming / Quadratic programming / Cholesky decomposition / Sparse matrix / Mathematics / Algebra / Numerical analysis


tsnnls: A solver for large sparse least squares problems with non-negative variables Jason Cantarella∗ Department of Mathematics, University of Georgia, Athens, GA[removed]Michael Piatek†
Add to Reading List

Open Document

File Size: 94,02 KB

Share Result on Facebook

City

Philadelphia / Berlin / MATLAB / /

Country

Portugal / /

/

Facility

University of Georgia / Duquesne University / TAUCS library / /

IndustryTerm

block pivoting algorithm / final unconstrained solution / interior point algorithm / parallel algorithms / infeasible complementary basic solutions / feasible solution / interior-point algorithms / normal equations solution / intermediate solutions / final solution / dot product / uga.edu/research/software/tsnnls/ / basic solution / digital signal processing / infeasible solution / /

MarketIndex

set 10 / /

OperatingSystem

Mac OS X / GNU / Macintosh / /

Organization

North Atlantic Treaty Organization / Michael Piatek† Department of Mathematics and Computer Science / University of Georgia / Athens / National Science Foundation / Jason Cantarella∗ Department of Mathematics / Society for Industrial / University of Georgia VIGRE / Society for Industrial and Applied Mathematics / Duquesne University / Pittsburgh / /

Person

Jason Cantarella / John E. Dennis / Jr. / Eric Rawdon / /

ProgrammingLanguage

ANSI C / MATLAB / /

ProvinceOrState

Pennsylvania / North Carolina / Georgia / /

Technology

main algorithm / block pivoting algorithm / ANSI C / interior-point algorithms / 2 ALGORITHMS / interior point algorithm / Cholesky algorithm / caching / sparse Cholesky algorithm / same algorithm / DSP / ATG / /

URL

http /

SocialTag