✦ LIBER ✦

On the information-based complexity of stochastic programming

✍ Scribed by Tavares, Gabriela; Parpas, Panos

Book ID: 125468338
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 363 KB
Volume: 41
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2013.08.011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computational complexity of stochastic p

Computational complexity of stochastic programming problems

✍ Martin Dyer; Leen Stougie 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 157 KB

Information-Based Complexity, Feedback a

Information-Based Complexity, Feedback and Dynamics in Convex Programming

✍ Raginsky, M.; Rakhlin, A. 📂 Article 📅 2011 🏛 IEEE 🌐 English ⚖ 478 KB

On complexity of multistage stochastic p

On complexity of multistage stochastic programs

✍ Alexander Shapiro 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 189 KB

The Value of Information and Stochastic

The Value of Information and Stochastic Programming

✍ M. Avriel and A. C. Williams 📂 Article 📅 1970 🏛 INFORMS 🌐 English ⚖ 219 KB

Spatial Sampling Design Based on Stochas

Spatial Sampling Design Based on Stochastic Complexity

✍ M.C. Bueso; J.M. Angulo; G. Qian; F.J. Alonso 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 164 KB

A new methodology is introduced for spatial sampling design when the variable of interest cannot be directly observed, but information on it can be obtained by sampling a related variable, and estimation of the underlying model is required. An approach based on entropy has been proposed by Bueso, An

Information-Theoretic Lower Bounds on th

Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization

✍ Agarwal, A.; Bartlett, P.L.; Ravikumar, P.; Wainwright, M.J. 📂 Article 📅 2012 🏛 IEEE 🌐 English ⚖ 401 KB