{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T19:55:56Z","timestamp":1775591756449,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T00:00:00Z","timestamp":1555286400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Serbian Ministry of Education, Science and Technological Development","award":["174030"],"award-info":[{"award-number":["174030"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s11075-019-00699-6","type":"journal-article","created":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T05:02:54Z","timestamp":1555304574000},"page":"701-718","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Penalty variable sample size method for solving optimization problems with equality constraints in a form of mathematical expectation"],"prefix":"10.1007","volume":"83","author":[{"given":"Nata\u0161a","family":"Krklec Jerinki\u0107","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2895-8355","authenticated-orcid":false,"given":"Andrea","family":"Ro\u017enjik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,15]]},"reference":[{"key":"699_CR1","unstructured":"Bastin, F.: Trust-region algorithms for nonlinear stochastic programming and mixed logit models, PhD thesis, University of Namur, Belgium (2004)"},{"issue":"1","key":"699_CR2","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10287-005-0044-y","volume":"3","author":"F Bastin","year":"2006","unstructured":"Bastin, F., Cirillo, C., Toint, P.L.: An adaptive Monte Carlo algorithm for computing mixed logit estimators. Comput. Manag. Sci. 3(1), 55\u201379 (2006)","journal-title":"Comput. Manag. Sci."},{"issue":"2\u20133","key":"699_CR3","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10107-006-0708-6","volume":"108","author":"F Bastin","year":"2006","unstructured":"Bastin, F., Cirillo, C., Toint, P.L.: Convergence theory for nonconvex stochastic programming with an application to mixed logit. Math. Program. 108 (2\u20133), 207\u2013234 (2006)","journal-title":"Math. Program."},{"key":"699_CR4","volume-title":"Introduction to stochastic programming. Springer Series in Operations Research and Financial Engineering","author":"JR Birge","year":"2011","unstructured":"Birge, J.R., Louveaux, F.: Introduction to stochastic programming. Springer Series in Operations Research and Financial Engineering. Springer Science+Business Media, LLC, New York (2011)"},{"issue":"1\u20132","key":"699_CR5","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s10107-007-0164-y","volume":"117","author":"G Deng","year":"2009","unstructured":"Deng, G., Ferris, M.C.: Variable-number sample path optimization. Math. Program. 117(1\u20132), 81\u2013109 (2009)","journal-title":"Math. Program."},{"issue":"3","key":"699_CR6","doi-asserted-by":"publisher","first-page":"1380","DOI":"10.1137\/110830629","volume":"34","author":"MP Friedlander","year":"2012","unstructured":"Friedlander, M.P., Schmidt, M.: Hybrid deterministic-stochastic methods for data fitting. SIAM J. Sci. Comput. 34(3), 1380\u20131405 (2012)","journal-title":"SIAM J. Sci. Comput."},{"key":"699_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-48320-2","volume-title":"Test examples for nonlinear programming codes, Lecture Notes in Economics and Mathematical Systems 187","author":"W Hock","year":"1981","unstructured":"Hock, W., Schittkowski, K.: Test examples for nonlinear programming codes, Lecture Notes in Economics and Mathematical Systems 187. Springer, New York (1981)"},{"issue":"2","key":"699_CR8","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1145\/858481.858483","volume":"13","author":"T Homem-de-Mello","year":"2003","unstructured":"Homem-de-Mello, T.: Variable-sample methods for stochastic optimization. ACM Trans. Model. Comput. Simul. 13(2), 108\u2013133 (2003)","journal-title":"ACM Trans. Model. Comput. Simul."},{"issue":"2","key":"699_CR9","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1137\/060657418","volume":"19","author":"T Homem-de-Mello","year":"2008","unstructured":"Homem-de-Mello, T.: On rates of convergence for stochastic optimization problems under nonindependent and identically distributed sampling. SIAM J. Optim. 19(2), 524\u2013551 (2008)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"699_CR10","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1137\/S1052623499363220","volume":"12","author":"A Kleywegt","year":"2001","unstructured":"Kleywegt, A., Shapiro, A., Homem-de-Mello, T.: The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2), 479\u2013502 (2001)","journal-title":"SIAM J. Optim."},{"key":"699_CR11","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.cam.2012.12.020","volume":"245","author":"N Kreji\u0107","year":"2013","unstructured":"Kreji\u0107, N., Krklec, N.: Line search methods with variable sample size for unconstrained optimization. J. Comput. Appl. Math. 245, 213\u2013231 (2013)","journal-title":"J. Comput. Appl. Math."},{"issue":"4","key":"699_CR12","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/s11075-014-9869-1","volume":"68","author":"N Kreji\u0107","year":"2015","unstructured":"Kreji\u0107, N., Krklec Jerinki\u0107, N.: Nonmonotone line search methods with variable sample size. Numer. Algorithms 68(4), 711\u2013739 (2015)","journal-title":"Numer. Algorithms"},{"issue":"1","key":"699_CR13","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10898-018-0682-6","volume":"73","author":"N Kreji\u0107","year":"2019","unstructured":"Kreji\u0107, N., Krklec Jerinki\u0107, N.: Spectral projected gradient method for stochastic optimization. J. Global Optim. 73(1), 59\u201381 (2019)","journal-title":"J. Global Optim."},{"issue":"3","key":"699_CR14","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s11590-017-1143-8","volume":"12","author":"N Kreji\u0107","year":"2018","unstructured":"Kreji\u0107, N., Krklec Jerinki\u0107, N., Ro\u017enjik, A.: Variable sample size method for equality constrained optimization problems. Optim. Lett. 12(3), 485\u2013497 (2018)","journal-title":"Optim. Lett."},{"key":"699_CR15","doi-asserted-by":"publisher","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, 215\u2013241 (2006)","journal-title":"Ann. Oper. Res."},{"key":"699_CR16","volume-title":"Numerical Optimization, Springer Series in Operations Research","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, Springer Series in Operations Research. Springer, New York (2006)"},{"issue":"4-part-1","key":"699_CR17","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1287\/opre.1090.0773","volume":"58","author":"Raghu Pasupathy","year":"2010","unstructured":"Pasupathy, R.: On choosing parameters in retrospective-approximation algorithms for stochastic root finding and simulation optimization. Oper. Res. 58(4), 889\u2013901","journal-title":"Operations Research"},{"issue":"2","key":"699_CR18","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.cam.2007.02.014","volume":"217","author":"E Polak","year":"2008","unstructured":"Polak, E., Royset, J.O.: Eficient sample sizes in stochastic nonlinear programming. J. Comput. Appl. Math. 217(2), 301\u2013310 (2008)","journal-title":"J. Comput. Appl. Math."},{"issue":"3","key":"699_CR19","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1287\/opre.2013.1163","volume":"61","author":"JO Royset","year":"2013","unstructured":"Royset, J.O., Szechtman, R.: Optimal budget allocation for sample average approximation. Oper. Res. 61(3), 777\u2013790 (2013)","journal-title":"Oper. Res."},{"key":"699_CR20","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.ejor.2004.01.046","volume":"167","author":"T Santoso","year":"2005","unstructured":"Santoso, T., Ahmed, S., Goetschalckx, M., Shapiro, A.: A stochastic programming approach for supply chain network design under uncertainty. Eur. J. Oper. Res. 167, 96\u2013115 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"699_CR21","doi-asserted-by":"crossref","unstructured":"Shapiro, A.: Monte Carlo sampling methods. In: Stochastic Programming, Handbook in Operations Research and Management Science 10, pp 353\u2013425. Elsevier (2003)","DOI":"10.1016\/S0927-0507(03)10006-0"},{"key":"699_CR22","doi-asserted-by":"crossref","unstructured":"Shapiro, A., Dentcheva, D., Ruszczynski, A.: Lectures on stochastic programming: modeling and theory. MPS-SIAM Series on Optimization (2009)","DOI":"10.1137\/1.9780898718751"},{"key":"699_CR23","volume-title":"Applications of stochastic programming","year":"2005","unstructured":"Wallace, S.W., Ziemba, W.T. (eds.): Applications of stochastic programming. SIAM, Philadelphia (2005)"},{"issue":"5","key":"699_CR24","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/j.orl.2008.05.003","volume":"36","author":"W Wang","year":"2008","unstructured":"Wang, W., Ahmed, S.: Sample average approximation of expected value constrained stochastic programs. Oper. Res. Lett. 36(5), 515\u2013519 (2008)","journal-title":"Oper. Res. Lett."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-019-00699-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-019-00699-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-019-00699-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,13]],"date-time":"2020-04-13T23:49:03Z","timestamp":1586821743000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-019-00699-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,15]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["699"],"URL":"https:\/\/doi.org\/10.1007\/s11075-019-00699-6","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,15]]},"assertion":[{"value":"30 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}