Compression for data archiving and backup revisited
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
Stochastic multi-stage linear programs are rarely used in practical applications due to their size and complexity. Using a general matrix to aggregate the constraints of the deterministic equivalent yields a lower bound. A similar aggregation in the dual space provides an upper bound on the optimal value of the given stochastic program. Jensen's inequality and other approximations based on aggregation are a special case of the suggested approach. The lower and upper bounds are tightened by updating the aggregating weights.
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007