Computing c-optimal experimental designs using the simplex method of linear programming.
Radoslav HarmanTomás JuríkPublished in: Comput. Stat. Data Anal. (2008)
Keyphrases
- linear programming
- simplex method
- linear program
- optimal solution
- experimental designs
- dynamic programming
- linear fractional
- linear programming problems
- primal dual
- simplex algorithm
- interior point algorithm
- column generation
- integer programming
- np hard
- average cost
- objective function
- experimental design
- worst case
- interior point methods
- semidefinite programming
- learning tasks
- quadratic programming
- support vector
- semi supervised