A sparsity-exploiting variant of the Bartels - Golub decomposition for linear programming bases.
John K. ReidPublished in: Math. Program. (1982)
Keyphrases
- linear programming
- linear program
- high dimensional
- decomposition methods
- feasible solution
- data sets
- dynamic programming
- nonlinear programming
- quadratic programming
- objective function
- optimal solution
- decomposition method
- lagrangian dual
- hierarchical decomposition
- image decomposition
- primal dual
- wavelet packet
- integer programming
- support vector machine
- lower bound
- bayesian networks
- image processing
- machine learning