Level bundle methods for oracles with on-demand accuracy

References

• A. Ben-Tal and A. Nemirovski, Non-Euclidean restricted memory level method for large-scale convex optimization, Math. Program. 102 (2005), pp. 407–456. doi: 10.1007/s10107-004-0553-4
   Web of Science ®Google Scholar
• J.R. Birge and F. Louveaux, Introduction to Stochastic programming, Springer Series in Operations Research and Financial Engineering, Springer, New York, 1997.
   Google Scholar
• J. Bonnans, J. Gilbert, C. Lemaréchal, and C. Sagastizábal, Numerical Optimization. Theoretical and Practical Aspects, 2nd ed., Universitext, Springer-Verlag, Berlin, 2006, ppp. xiv+490.
   Google Scholar
• U. Brannlund, K.C. Kiwiel, and P.O. Lindberg, A descent proximal level bundle method for convex nondifferentiable optimization, Oper. Res. Lett. 17 (1995), pp. 121–126. doi: 10.1016/0167-6377(94)00056-C
   Web of Science ®Google Scholar
• G. Emiel and C. Sagastizábal, Incremental-like bundle methods with application to energy planning, Comput. Optim. Appl. 46 (2010), pp. 305–332. doi: 10.1007/s10589-009-9288-8
   Web of Science ®Google Scholar
• C. Fábián, Bundle-type methods for inexact data, Cent. Eur. J. Oper. Res. 8 (special issue, T. Csendes and T. Rapcsk, eds.) (2000), pp. 35–55.
   Google Scholar
• C. Fábián and Z. Szőke, Solving two-stage stochastic programming problems with level decomposition, Comput. Manag. Sci. 4 (2007), pp. 313–353. doi: 10.1007/s10287-006-0026-8
   Google Scholar
• M. Hintermüller, A proximal bundle method based on approximate subgradients, Comput. Optim. Appl. 20 (2001), pp. 245–266. doi: 10.1023/A:1011259017643
   Web of Science ®Google Scholar
• J.B. Hiriart-Urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms, no. 305-306 in Grund. der math. Wiss, Springer-Verlag, 1993 (two volumes).
   Google Scholar
• K.C. Kiwiel, Proximity control in bundle methods for convex nondifferentiable minimization, Math. Program. 46 (1990), pp. 105–122. doi: 10.1007/BF01585731
   Web of Science ®Google Scholar
• K.C. Kiwiel, Proximal level bundle methods for convex nondiferentiable optimization, saddle-point problems and variational inequalities, Math. Program. 69 (1995), pp. 89–109.
   Web of Science ®Google Scholar
• K.C. Kiwiel, A proximal bundle method with approximate subgradient linearizations, SIAM J. Optim. 16 (2006), pp. 1007–1023. doi: 10.1137/040603929
   Web of Science ®Google Scholar
• K.C. Kiwiel, Bundle methods for convex minimization with partially inexact oracles, Tech. Rep., Systems Research Institute, Polish Academy of Sciences, Warsaw, 2009; available at http://www.optimization-online.org/DB_HTML/2009/03/2257.html.
   Google Scholar
• C. Lemaréchal and C. Sagastizábal, Variable metric bundle methods: From conceptual to implementable forms, Math. Program. 76 (1997), pp. 393–410. doi: 10.1007/BF02614390
   Web of Science ®Google Scholar
• C. Lemaréchal, A. Nemirovskii, and Y. Nesterov, New variants of bundle methods, Math. Program. 69 (1995), pp. 111–147. doi: 10.1007/BF01585555
   Web of Science ®Google Scholar
• W. Oliveira, C. Sagastizábal, and S. Scheimberg, Inexact bundle methods for two-stage stochastic programming, SIAM J. Optim. 21 (2011), pp. 517–544. doi: 10.1137/100808289
   Web of Science ®Google Scholar
• P. Richtárik, Approximate level method for nonsmooth convex minimization, J. Optim. Theory Appl. 152 (2) (2011), pp. 1–17.
   Google Scholar
• A. Shapiro, D. Dentcheva, and A. Ruszczyński, Lectures on Stochastic Programming: Modeling and Theory, MPS-SIAM Series on Optimization, SIAM—Society for Industrial and Applied Mathematics and Mathematical Programming Society, Philadelphia, 2009.
   Google Scholar
• R.V. Slyke and R.B. Wets, L-shaped linear programs with applications to optimal control and stochastic programming, SIAM J. Appl. Math. 17 (1969), pp. 638–663. doi: 10.1137/0117061
   Web of Science ®Google Scholar
• M.V. Solodov, On approximations with finite precision in bundle methods for nonsmooth optimization, J. Optim. Theory Appl. 119 (2003), pp. 151–165. doi: 10.1023/B:JOTA.0000005046.70410.02
   Web of Science ®Google Scholar
• G. Zakeri, A.B. Philpott, and D.M. Ryan, Inexact cuts in benders decomposition, SIAM J. Optim. 10 (2000), pp. 643–657. doi: 10.1137/S1052623497318700
   Web of Science ®Google Scholar
• V. Zverovich, C. Fábián, F. Ellison, and G. Mitra, A computational study of a solver system for processing two-stage stochastic lps with enhanced benders decomposition, Math. Program. Comput. 4 (2012), pp. 211–238. doi: 10.1007/s12532-012-0038-z
   Google Scholar