- See also
Basis pursuit is the mathematical optimization problem of the form:
where x is a N × 1 solution vector (signal), y is a M × 1 vector of observations (measurements), A is a M × N transform matrix (usually measurement matrix) and M < N.
It is usually applied in cases where there is an underdetermined system of linear equations y = Ax that must be exactly satisfied, and the sparsest solution in the L1 sense is desired.
When it is desirable to trade off exact congruence of Ax and y in exchange for a sparser x, basis pursuit denoising is preferred.
See also
- Compressed sensing
- Group testing
- Lasso (statistics)
- Matching pursuit
- Sparse approximation
2 : Mathematical optimization|Constraint programming
- Hist Anthropol
- Hist. Anthropol.
- Histatins
- Hist. Biol.
- Hist Biol
- Hist. Chem. Newsl.
- Hist Chem Newsl
- Hist. Child. Q.
- Hist Child Q
- Hist Compass
- Hist. Compass
- Hist. eccl.
- Histed, Christopher
- Hist Educ J
- Hist. Educ. J.
- Hist Educ Q
- Hist. Educ. Q.
- Hist Educ Quart
- Hist. Educ. Quart.
- HIST EDUC QUART
- Hist Environ
- Hist. Environ.
- Hister abbreviatus
- Histeranthous
- Hister civilis