Dakota Reference Manual: orthogonal_matching_pursuit

| Dakota Reference Manual Version 6.15 Explore and Predict with Confidence

- Main Page
- Related Pages

All Pages
orthogonal_matching_pursuit

Compute the coefficients of a polynomial expansion using orthogonal matching pursuit (OMP)

## Specification

Alias: omp

Argument(s): none

Child Keywords:

| Required/Optional | Description of Group | Dakota Keyword | Dakota Keyword Description
--- | --- | --- | --- | ---
| Optional | noise_tolerance | The noise tolerance used when performing cross validation in the presence of noise or truncation errors.

## Description

Compute the coefficients of a polynomial expansion using orthogonal matching pursuit (OMP). Orthogonal matching pursuit (OMP) is a greedy algorithm that is usefult when solving underdetermined linear systems.