Back to Results
First PageMeta Content
Robust statistics / Operations research / Econometrics / RANSAC / Principal component analysis / Convex optimization / Least absolute deviations / Iteratively reweighted least squares / Linear regression / Statistics / Regression analysis / Mathematical optimization


ROBUST COMPUTATION OF LINEAR MODELS, OR HOW TO FIND A NEEDLE IN A HAYSTACK GILAD LERMAN∗ , MICHAEL MCCOY† , JOEL A. TROPP† , AND TENG ZHANG◦
Add to Reading List

Document Date: 2012-02-21 11:36:38

Open Document

File Size: 944,29 KB

Share Result on Facebook

Facility

University of Minnesota / California Institute of Technology / /

IndustryTerm

tractable algorithms / numerical algorithm / inner product / iterative algorithm / analytic solution / accuracy solution / tractable algorithm / recent algorithms / approximate solution / energy / /

Organization

California Institute of Technology / Department of Mathematics / Institute for Mathematics / U.S. Securities and Exchange Commission / University of Minnesota / Department of Computing and Mathematical Sciences / /

Person

MICHAEL MCCOY / Xin Xout / JOEL A. TROPP / /

Position

linear model for the inliers / /

ProvinceOrState

Minnesota / California / /

Technology

numerical algorithm / single nucleotide polymorphism / bioinformatics / 3 Algorithm / IRLS algorithm / SNP / machine learning / recent algorithms / genotype / 1.1 Prototype algorithm / EM algorithm / /

SocialTag