{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T12:01:44Z","timestamp":1784289704775,"version":"3.55.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T00:00:00Z","timestamp":1586304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T00:00:00Z","timestamp":1586304000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stat Comput"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s11222-020-09930-0","type":"journal-article","created":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T19:08:29Z","timestamp":1586372909000},"page":"1167-1182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["Optimal non-negative forecast reconciliation"],"prefix":"10.1007","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2742-5992","authenticated-orcid":false,"given":"Shanika L.","family":"Wickramasuriya","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8795-471X","authenticated-orcid":false,"given":"Berwin A.","family":"Turlach","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2140-5352","authenticated-orcid":false,"given":"Rob J.","family":"Hyndman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,4,8]]},"reference":[{"issue":"1","key":"9930_CR1","doi-asserted-by":"publisher","first-page":"135171","DOI":"10.1111\/1468-0262.00392","volume":"71","author":"J Bai","year":"2003","unstructured":"Bai, J.: Inferential theory for factor models of large dimensions. Econometrica 71(1), 135171 (2003)","journal-title":"Econometrica"},{"issue":"1","key":"9930_CR2","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, J.M.: Two-point step size gradient methods. IMA J. Numer. Anal. 8(1), 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"key":"9930_CR3","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.csda.2006.11.006","volume":"52","author":"MW Berry","year":"2007","unstructured":"Berry, M.W., Browne, M., Langville, A.N., Paul Pauca, V., Plemmons, R.J.: Algorithms and applications for approximate nonnegative matrix factorization. Comput. Stat. Data Anal. 52, 155\u2013173 (2007)","journal-title":"Comput. Stat. Data Anal."},{"key":"9930_CR4","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1051\/eas\/1359015","volume":"59","author":"M Bertero","year":"2013","unstructured":"Bertero, M., et al.: Scaled gradient projection methods for astronomical imaging. EAS Publ. Ser. 59, 325\u2013356 (2013)","journal-title":"EAS Publ. Ser."},{"issue":"4","key":"9930_CR5","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1093\/imanum\/23.4.539","volume":"23","author":"EG Birgin","year":"2003","unstructured":"Birgin, E.G., Martinez, J.M., Raydan, M.: Inexact spectral projected gradient methods on convex sets. IMA J. Numer. Anal. 23(4), 539\u2013559 (2003)","journal-title":"IMA J. Numer. Anal."},{"issue":"1","key":"9930_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1088\/0266-5611\/25\/1\/015002","volume":"25","author":"S Bonettini","year":"2009","unstructured":"Bonettini, S., Zanella, R., Zanni, L.: A scaled gradient projection method for constrained image deblurring. Inverse Probl. 25(1), 23 (2009)","journal-title":"Inverse Probl."},{"key":"9930_CR7","doi-asserted-by":"publisher","DOI":"10.1201\/9781420036206","volume-title":"Time-Series Forecasting","author":"C Chatfield","year":"2000","unstructured":"Chatfield, C.: Time-Series Forecasting, 1st edn. Chapman and Hall, New York (2000)","edition":"1"},{"key":"9930_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1142\/9789812836267_0008","volume-title":"The Birth of Numerical Analysis","author":"D Chen","year":"2009","unstructured":"Chen, D., Plemmons, R.J.: Non-negativity constraints in numerical analysis. In: Bultheel, A., Cools, R. (eds.) The Birth of Numerical Analysis, pp. 109\u2013140. World Scientific Publishing, New Jersey (2009)"},{"issue":"4","key":"9930_CR9","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1109\/JSTSP.2007.910281","volume":"1","author":"MAT Figueiredo","year":"2007","unstructured":"Figueiredo, M.A.T., Nowak, R.D., Wright, S.J.: Gradient projection for sparse reconstruction: application to compressed sensing and other inverse problems. IEEE J. Sel. Top. Signal Process. 1(4), 586\u2013597 (2007)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"9930_CR10","unstructured":"Hyndman, R.J.: forecast: forecasting functions for time series and linear models. R package version 8.5 (2019). https:\/\/pkg.robjhyndman\/forecast. Accessed Feb 2019"},{"issue":"3","key":"9930_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v027.i03","volume":"27","author":"RJ Hyndman","year":"2008","unstructured":"Hyndman, R.J., Khandakar, Y.: Automatic time series forecasting: the forecast package for R. J. Stat. Softw. 27(3), 1\u201322 (2008)","journal-title":"J. Stat. Softw."},{"key":"9930_CR12","doi-asserted-by":"publisher","first-page":"2579","DOI":"10.1016\/j.csda.2011.03.006","volume":"55","author":"RJ Hyndman","year":"2011","unstructured":"Hyndman, R.J., Ahmed, R.A., Athanasopoulos, G., Shang, H.L.: Optimal combination forecasts for hierarchical time series. Comput. Stat. Data Anal. 55, 2579\u20132589 (2011). https:\/\/doi.org\/10.1016\/j.csda.2011.03.006","journal-title":"Comput. Stat. Data Anal."},{"key":"9930_CR13","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.csda.2015.11.007","volume":"97","author":"RJ Hyndman","year":"2016","unstructured":"Hyndman, R.J., Lee, A.J., Wang, E.: Fast computation of reconciled forecasts for hierarchical and grouped time series. Comput. Stat. Data Anal. 97, 16\u201332 (2016)","journal-title":"Comput. Stat. Data Anal."},{"key":"9930_CR14","volume-title":"Wiley Series in Probability and Mathematical Statistics","author":"NL Johnson","year":"1994","unstructured":"Johnson, N.L., Kotz, S., Balakrishnan, N.: Continuous univariate distributions. In: Barnett, V. (ed.) Wiley Series in Probability and Mathematical Statistics, vol. 1, 2nd edn. Wiley, New York (1994)","edition":"2"},{"issue":"1","key":"9930_CR15","first-page":"5168","volume":"2","author":"JJ J\u00fadice","year":"1989","unstructured":"J\u00fadice, J.J., Pires, F.M.: Bard-type methods for the linear complementarity problem with symmetric positive definite matrices. IMA J. Manag. Math. 2(1), 5168 (1989)","journal-title":"IMA J. Manag. Math."},{"issue":"5","key":"9930_CR16","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/0305-0548(94)90106-6","volume":"21","author":"JJ Judice","year":"1994","unstructured":"Judice, J.J., Pires, F.M.: A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems. Comput. Oper. Res. 21(5), 587\u2013596 (1994)","journal-title":"Comput. Oper. Res."},{"key":"9930_CR17","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0003-2670(91)85070-9","volume":"250","author":"EJ Karjalainen","year":"1991","unstructured":"Karjalainen, E.J., Karjalainen, U.P.: Component reconstruction in the primary space of spectra and concentrations. Alternating regression and related direct methods. Anal. Chim. Acta 250, 169\u2013179 (1991)","journal-title":"Anal. Chim. Acta"},{"issue":"6","key":"9930_CR18","doi-asserted-by":"publisher","first-page":"3261","DOI":"10.1137\/110821172","volume":"33","author":"J Kim","year":"2011","unstructured":"Kim, J., Park, H.: Fast nonnegative matrix factorization: an active-set-like method and comparisons. SIAM J. Sci. Comput. 33(6), 3261\u20133281 (2011)","journal-title":"SIAM J. Sci. Comput."},{"key":"9930_CR19","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0024-3795(78)90083-6","volume":"21","author":"MM Kostreva","year":"1978","unstructured":"Kostreva, M.M.: Block pivot methods for solving the complementarity problem. Linear Algebra Appl. 21, 207\u2013215 (1978)","journal-title":"Linear Algebra Appl."},{"key":"9930_CR20","volume-title":"Solving Least Squares Problems","author":"CL Lawson","year":"1974","unstructured":"Lawson, C.L., Hanson, R.J.: Solving Least Squares Problems. Prentice-Hall, New Jersey (1974)"},{"key":"9930_CR21","unstructured":"Microsoft Corporation and Steve Weston: doParallel: foreach parallel adaptor for the \u2018parallel\u2019 package. R package version 1.0.15 (2019a). https:\/\/CRAN.R-project.org\/package=doParallel. Accessed Feb 2019"},{"key":"9930_CR22","unstructured":"Microsoft Corporation and Steve Weston: foreach: provides foreach looping construct. R package version 1.4.7 (2019b). https:\/\/CRAN.R-project.org\/package=foreach. Accessed Feb 2019"},{"issue":"2\u20133","key":"9930_CR23","first-page":"123","volume":"11","author":"KG Murty","year":"1974","unstructured":"Murty, K.G.: Note on a Bard-type scheme for solving the complementarity problem. OPSEARCH 11(2\u20133), 123\u2013130 (1974)","journal-title":"OPSEARCH"},{"key":"9930_CR24","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: In: Mikosch, T.V., Resnick, S.I., Robinson, S.M. (eds.) Numerical Optimization, 2nd edn. Springer, New York (2006)","edition":"2"},{"key":"9930_CR25","unstructured":"Turlach, B.A., Weingessel, A.: quadprog: functions to solve quadratic programming problems. R package version 1.5-7 (2019). https:\/\/CRAN.R-project.org\/package=quadprog. Accessed Feb 2019"},{"issue":"2","key":"9930_CR26","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1002\/wics.1344","volume":"7","author":"BA Turlach","year":"2015","unstructured":"Turlach, B.A., Wright, S.J.: Quadratic programming. Wiley Interdiscip. Rev. Comput. Stat. 7(2), 153\u2013159 (2015)","journal-title":"Wiley Interdiscip. Rev. Comput. Stat."},{"issue":"526","key":"9930_CR27","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1080\/01621459.2018.1448825","volume":"114","author":"SL Wickramasuriya","year":"2019","unstructured":"Wickramasuriya, S.L., Athanasopoulos, G., Hyndman, R.J.: Optimal forecast reconciliation of hierarchical and grouped time series through trace minimization. J. Am. Stat. Assoc. 114(526), 804\u2013819 (2019)","journal-title":"J. Am. Stat. Assoc."}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-020-09930-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11222-020-09930-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-020-09930-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,7]],"date-time":"2021-04-07T23:29:55Z","timestamp":1617838195000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11222-020-09930-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,8]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["9930"],"URL":"https:\/\/doi.org\/10.1007\/s11222-020-09930-0","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"value":"0960-3174","type":"print"},{"value":"1573-1375","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,8]]},"assertion":[{"value":"14 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}