{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T01:39:17Z","timestamp":1777426757876,"version":"3.51.4"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,12,21]],"date-time":"2015-12-21T00:00:00Z","timestamp":1450656000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s10589-015-9813-x","type":"journal-article","created":{"date-parts":[[2015,12,21]],"date-time":"2015-12-21T15:21:51Z","timestamp":1450711311000},"page":"379-406","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Clustering-based preconditioning for stochastic programs"],"prefix":"10.1007","volume":"64","author":[{"given":"Yankai","family":"Cao","sequence":"first","affiliation":[]},{"given":"Carl D.","family":"Laird","sequence":"additional","affiliation":[]},{"given":"Victor M.","family":"Zavala","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,21]]},"reference":[{"key":"9813_CR1","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02591859","volume":"31","author":"J Birge","year":"1985","unstructured":"Birge, J.: Aggregation bounds in stochastic linear programming. Math. Progr. 31, 25\u201341 (1985)","journal-title":"Math. Progr."},{"key":"9813_CR2","volume-title":"Pattern recognition and machine learning","author":"CM Bishop","year":"2006","unstructured":"Bishop, C.M., et al.: Pattern recognition and machine learning, vol. 4. Springer, New York (2006)"},{"issue":"3","key":"9813_CR3","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1137\/10079923X","volume":"21","author":"RH Byrd","year":"2011","unstructured":"Byrd, R.H., Chin, G.M., Neveitt, W., Nocedal, J.: On the use of stochastic Hessian information in optimization methods for machine learning. SIAM J. Optim. 21(3), 977\u2013995 (2011)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"9813_CR4","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1109\/TAC.2006.875041","volume":"51","author":"GC Calafiore","year":"2006","unstructured":"Calafiore, G.C., Campi, M.C.: The scenario approach to robust control design. IEEE Trans. Autom. Control 51(5), 742\u2013753 (2006)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"3","key":"9813_CR5","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1287\/moor.1050.0146","volume":"30","author":"MS Casey","year":"2005","unstructured":"Casey, M.S., Sen, S.: The scenario generation algorithm for multistage stochastic linear programming. Math. Oper. Res. 30(3), 615\u2013631 (2005)","journal-title":"Math. Oper. Res."},{"key":"9813_CR6","unstructured":"Chiang, N., Grothey, A.: Solving security constrained optimal power flow problems by a structure exploiting interior point method. Optim. Eng. pp. 1\u201323 (2012)"},{"issue":"2","key":"9813_CR7","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10107-009-0290-9","volume":"127","author":"M Colombo","year":"2011","unstructured":"Colombo, M., Gondzio, J., Grothey, A.: A warm-start approach for large-scale stochastic linear programs. Math. Progr. 127(2), 371\u2013397 (2011)","journal-title":"Math. Progr."},{"issue":"6","key":"9813_CR8","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1080\/10556780903420135","volume":"25","author":"WL Oliveira de","year":"2010","unstructured":"de Oliveira, W.L., Sagastiz\u00e1bal, C., Penna, D., Maceira, M., Dam\u00e1zio, J.M.: Optimal scenario tree reduction for stochastic streamflows in power generation planning problems. Optim. Methods Softw. 25(6), 917\u2013936 (2010)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"9813_CR9","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1137\/050626168","volume":"29","author":"HS Dollar","year":"2007","unstructured":"Dollar, H.S.: Constraint-style preconditioners for regularized saddle point problems. SIAM J. Matrix Anal. Appl. 29(2), 672\u2013684 (2007)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"9813_CR10","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/s10107-002-0331-0","volume":"95","author":"J Dupa\u010dov\u00e1","year":"2003","unstructured":"Dupa\u010dov\u00e1, J., Gr\u00f6we-Kuska, N., R\u00f6misch, W.: Scenario reduction in stochastic programming. Math. Progr. 95(3), 493\u2013511 (2003)","journal-title":"Math. Progr."},{"issue":"3","key":"9813_CR11","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1137\/S1052623400374379","volume":"13","author":"MC Ferris","year":"2002","unstructured":"Ferris, M.C., Munson, T.S.: Interior-point methods for massive support vector machines. SIAM J. Optim. 13(3), 783\u2013804 (2002)","journal-title":"SIAM J. Optim."},{"key":"9813_CR12","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1137\/S1052623401393141","volume":"13","author":"J Gondzio","year":"2003","unstructured":"Gondzio, J., Grothey, A.: Reoptimization with the primal-dual interior point method. SIAM J. Optim. 13, 842\u2013864 (2003)","journal-title":"SIAM J. Optim."},{"key":"9813_CR13","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s10287-008-0087-y","volume":"6","author":"H Heitsch","year":"2009","unstructured":"Heitsch, H., R\u00f6misch, W.: Scenario tree reduction for multistage stochastic programs. Comput. Manag. Sci. 6, 117\u2013133 (2009)","journal-title":"Comput. Manag. Sci."},{"key":"9813_CR14","first-page":"156","volume":"31","author":"J Jung","year":"2008","unstructured":"Jung, J., Oleary, D.P., Tits, A.L.: Adaptive constraint reduction for training support vector machines. Electron. Trans. Numer. Anal. 31, 156\u2013177 (2008)","journal-title":"Electron. Trans. Numer. Anal."},{"key":"9813_CR15","doi-asserted-by":"crossref","unstructured":"Kang, J., Cao, Y., Word, D.P., Laird, C.D.: An interior-point method for efficient solution of block-structured NLP problems using an implicit Schur-complement decomposition. Comput. Chem. Eng. (2014, in press)","DOI":"10.1016\/j.compchemeng.2014.09.013"},{"issue":"3","key":"9813_CR16","doi-asserted-by":"crossref","first-page":"1339","DOI":"10.1016\/j.ejor.2005.11.045","volume":"181","author":"JM Latorre","year":"2007","unstructured":"Latorre, J.M., Cerisola, S., Ramos, A.: Clustering algorithms for scenario tree generation: application to natural hydro inflows. Eur. J. Oper. Res. 181(3), 1339\u20131353 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9813_CR17","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s10479-006-6169-8","volume":"142","author":"J Linderoth","year":"2006","unstructured":"Linderoth, J., Shapiro, A., Wright, S.: The empirical behavior of sampling methods for stochastic programming. Ann. Oper. Res. 142(1), 215\u2013241 (2006)","journal-title":"Ann. Oper. Res."},{"key":"9813_CR18","doi-asserted-by":"crossref","unstructured":"Lubin, M., Petra, C.G., Anitescu, M., Zavala, V.M.: Scalable stochastic optimization of complex energy systems. In: IEEE international conference for high performance computing, networking, storage and analysis (SC). pp. 1\u201310 (2011)","DOI":"10.1145\/2063384.2063470"},{"key":"9813_CR19","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S Mehrotra","year":"1992","unstructured":"Mehrotra, S.: On the implementation of a primal-dual interior point method. SIAM J. Optim. 2, 575\u2013601 (1992)","journal-title":"SIAM J. Optim."},{"key":"9813_CR20","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s10589-011-9418-y","volume":"52","author":"C Petra","year":"2012","unstructured":"Petra, C., Anitescu, M.: A preconditioning technique for Schur complement systems arising in stochastic optimization. Comput. Optim. Appl. 52, 315\u2013344 (2012)","journal-title":"Comput. Optim. Appl."},{"issue":"4\u2013part\u20132","key":"9813_CR21","doi-asserted-by":"crossref","first-page":"1210","DOI":"10.1287\/opre.1090.0800","volume":"58","author":"G Pritchard","year":"2010","unstructured":"Pritchard, G., Zakeri, G., Philpott, A.: A single-settlement, energy-only electric power market for unpredictable and intermittent participants. Oper. Res. 58(4\u2013part\u20132), 1210\u20131219 (2010)","journal-title":"Oper. Res."},{"issue":"5","key":"9813_CR22","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/0305-0548(87)90035-9","volume":"14","author":"CM Shetty","year":"1987","unstructured":"Shetty, C.M., Taylor, R.W.: Solving large-scale linear programs by aggregation. Comput. Oper. Res. 14(5), 385\u2013393 (1987)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9813_CR23","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1137\/S106482750037336X","volume":"23","author":"DB Szyld","year":"2001","unstructured":"Szyld, D.B., Vogel, J.A.: Fqmr: a flexible quasi-minimal residual method with inexact preconditioning. SIAM J. Sci. Comput. 23(2), 363\u2013380 (2001)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"9813_CR24","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/050633421","volume":"17","author":"A Tits","year":"2006","unstructured":"Tits, A., Absil, P., Woessner, W.: Constraint reduction for linear programs with many inequality constraints. SIAM J. Optim. 17(1), 119\u2013146 (2006)","journal-title":"SIAM J. Optim."},{"key":"9813_CR25","doi-asserted-by":"crossref","unstructured":"Zavala, V.M., Botterud, A., Constantinescu, E.M., Wang, J.: Computational and economic limitations of dispatch operations in the next-generation power grid. In: IEEE conference on innovative technologies for and efficient and reliable power supply (2010)","DOI":"10.1109\/CITRES.2010.5619768"},{"issue":"10","key":"9813_CR26","doi-asserted-by":"crossref","first-page":"1725","DOI":"10.1016\/j.jprocont.2009.07.004","volume":"19","author":"VM Zavala","year":"2009","unstructured":"Zavala, V.M., Constantinescu, E.M., Krause, T., Anitescu, M.: On-line economic optimization of energy systems using weather forecast information. J. Process Control 19(10), 1725\u20131736 (2009)","journal-title":"J. Process Control"},{"key":"9813_CR27","unstructured":"Zavala, V.M., Kim, K., Anitescu, M., Birge, J.: A stochastic market clearing formulation with consistent pricing properties. Technical Report ANL\/MCS-P5110-0314, Argonne National Laboratory (2015)"},{"issue":"4","key":"9813_CR28","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1287\/opre.28.4.903","volume":"28","author":"PH Zipkin","year":"1980","unstructured":"Zipkin, P.H.: Bounds for row-aggregation in linear programming. Oper. Res. 28(4), 903\u2013916 (1980)","journal-title":"Oper. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-015-9813-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-015-9813-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-015-9813-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:37:41Z","timestamp":1559241461000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-015-9813-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,21]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["9813"],"URL":"https:\/\/doi.org\/10.1007\/s10589-015-9813-x","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,21]]}}}