36 search results - page 5 / 8 » A Shadow Simplex Method for Infinite Linear Programs |
99
Voted
ML
2002
ACM
14 years 9 months ago
2002
ACM
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
AUTOMATICA
2007
14 years 9 months ago
2007
Optimal control problems for constrained linear systems with a linear cost can be posed as multiparametric linear programs with a parameter in the cost, or equivalently the right-...
AISS
2010
14 years 7 months ago
2010
A mathematical multi objective model for the selection of a portfolio of investment is presented and its application in the Mexican Stock Exchange (BMV). The multi objective model...
162
click to vote
POPL
2007
ACM
15 years 9 months ago
2007
ACM
A method is presented for computing all higher-order partial derivatives of a multivariate function Rn R. This method works by evaluating the function under a nonstandard interpre...
84
Voted
SIAMJO
2000
14 years 9 months ago
2000
Let F be a compact subset of the n-dimensional Euclidean space Rn represented by (finitely or infinitely many) quadratic inequalities. We propose two methods, one based on successi...