{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T00:51:00Z","timestamp":1778547060076,"version":"3.51.4"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,7,4]],"date-time":"2012-07-04T00:00:00Z","timestamp":1341360000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s10957-012-0109-3","type":"journal-article","created":{"date-parts":[[2012,7,3]],"date-time":"2012-07-03T16:48:05Z","timestamp":1341334085000},"page":"855-882","source":"Crossref","is-referenced-by-count":11,"title":["Rate of Convergence Analysis of Discretization and Smoothing Algorithms for Semiinfinite Minimax Problems"],"prefix":"10.1007","volume":"155","author":[{"given":"J. O.","family":"Royset","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E. Y.","family":"Pee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,7,4]]},"reference":[{"key":"109_CR1","volume-title":"Algorithms for Worst-Case Design and Applications to Risk Management","author":"B. Rustem","year":"2002","unstructured":"Rustem, B., Howe, M.: Algorithms for Worst-Case Design and Applications to Risk Management. Princeton University Press, Princeton (2002)"},{"key":"109_CR2","doi-asserted-by":"crossref","DOI":"10.1515\/9781400831050","volume-title":"Robust Optimization","author":"A. Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust Optimization. Princeton University Press, Princeton (2009)"},{"key":"109_CR3","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D. Bertsimas","year":"2011","unstructured":"Bertsimas, D., Brown, D.B., Caramanis, C.: Theory and applications of robust optimization. SIAM Rev. 53, 464\u2013501 (2011)","journal-title":"SIAM Rev."},{"issue":"3","key":"109_CR4","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1137\/1035089","volume":"35","author":"R. Hettich","year":"1993","unstructured":"Hettich, R., Kortanek, K.O.: Semi-infinite programming: theory, methods, and applications. SIAM Rev. 35(3), 380\u2013429 (1993)","journal-title":"SIAM Rev."},{"key":"109_CR5","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/978-1-4757-2868-2_7","volume-title":"Semi-Infinite Programming","author":"R. Reemtsen","year":"1998","unstructured":"Reemtsen, R., Gorner, S.: Numerical methods for semi-infinite programming: a survey. In: Reemtsen, R., Ruckmann, J.-J. (eds.) Semi-Infinite Programming, pp.\u00a0195\u2013275. Kluwer Academic, Dordrecht (1998)"},{"issue":"3","key":"109_CR6","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1137\/S1052623400376366","volume":"14","author":"K.C. Kiwiel","year":"2004","unstructured":"Kiwiel, K.C.: Convergence of approximate and incremental subgradient methods for convex optimization. SIAM J. Optim. 14(3), 807\u2013840 (2004)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"109_CR7","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/j.ejor.2006.08.045","volume":"180","author":"M. Lopez","year":"2007","unstructured":"Lopez, M., Still, G.: Semi-infinite programming. Eur. J. Oper. Res. 180(2), 491\u2013518 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"109_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10589-007-9117-x","volume":"42","author":"L. Qi","year":"2009","unstructured":"Qi, L., Ling, C., Tong, X., Zhou, G.: A smoothing projected Newton-type algorithm for semi-infinite programming. Comput. Optim. Appl. 42, 1\u201330 (2009)","journal-title":"Comput. Optim. Appl."},{"key":"109_CR9","unstructured":"Devolder, O., Glineur, F., Nesterov, Y.: First order methods of smooth convex optimization with inexact oracle. Optim. (Online) (2011)"},{"key":"109_CR10","volume-title":"Optimization. Algorithms and Consistent Approximations","author":"E. Polak","year":"1997","unstructured":"Polak, E.: Optimization. Algorithms and Consistent Approximations. Springer, New York (1997)"},{"issue":"2","key":"109_CR11","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1137\/0806025","volume":"6","author":"J.L. Zhou","year":"1996","unstructured":"Zhou, J.L., Tits, A.L.: An SQP algorithm for finely discretized continuous minimax problems and other minimax problems with many objective functions. SIAM J. Optim. 6(2), 461\u2013487 (1996)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"109_CR12","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/s10957-010-9759-1","volume":"148","author":"E.Y. Pee","year":"2011","unstructured":"Pee, E.Y., Royset, J.O.: On solving large-scale finite minimax problems using exponential smoothing. J. Optim. Theory Appl. 148(2), 390\u2013421 (2011)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"109_CR13","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1080\/02331930902730070","volume":"58","author":"A. Shapiro","year":"2009","unstructured":"Shapiro, A.: Semi-infinite programming, duality, discretization and optimality conditions. Optimization 58(2), 133\u2013161 (2009)","journal-title":"Optimization"},{"key":"109_CR14","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s101070100239","volume":"91","author":"G. Still","year":"2001","unstructured":"Still, G.: Discretization in semi-infinite programming: the rate of convergence. Math. Program. 91, 53\u201369 (2001)","journal-title":"Math. Program."},{"issue":"3","key":"109_CR15","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1137\/0330032","volume":"30","author":"E. Polak","year":"1992","unstructured":"Polak, E., He, L.: Rate-preserving discretization strategies for semi-infinite programming and optimal control. SIAM J. Control Optim. 30(3), 548\u2013572 (1992)","journal-title":"SIAM J. Control Optim."},{"issue":"2","key":"109_CR16","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1137\/0330023","volume":"30","author":"E. Polak","year":"1992","unstructured":"Polak, E., Mayne, D.Q., Higgins, J.: On the extension of Newton\u2019s method to semi-infinite minimax problems. SIAM J. Control Optim. 30(2), 376\u2013389 (1992)","journal-title":"SIAM J. Control Optim."},{"key":"109_CR17","first-page":"247","volume-title":"Tutorials in Operations Research","author":"C.H. Chen","year":"2008","unstructured":"Chen, C.H., Fu, M., Shi, L.: Simulation and optimization. In: Tutorials in Operations Research, pp.\u00a0247\u2013260. INFORMS, Hanover (2008)"},{"key":"109_CR18","volume-title":"Proceedings of the 2007 INFORMS Simulation Society Research Workshop","author":"Y.L. Chia","year":"2007","unstructured":"Chia, Y.L., Glynn, P.W.: Optimal convergence rate for random search. In: Proceedings of the 2007 INFORMS Simulation Society Research Workshop (2007). www.informs-sim.org\/2007informs-csworkshop\/2007workshop.html"},{"issue":"1","key":"109_CR19","first-page":"133","volume":"20","author":"D. He","year":"2010","unstructured":"He, D., Lee, L.H., Chen, C.-H., Fu, M.C., Wasserkrug, S.: Simulation optimization using the cross-entropy method with optimal computing budget allocation. ACM Trans. Model. Comput. Simul. 20(1), 133\u2013161 (2010)","journal-title":"ACM Trans. Model. Comput. Simul."},{"key":"109_CR20","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1287\/opre.1090.0773","volume":"58","author":"R. Pasupathy","year":"2010","unstructured":"Pasupathy, R.: On choosing parameters in retrospective-approximation algorithms for stochastic root finding and simulation optimization. Oper. Res. 58, 889\u2013901 (2010)","journal-title":"Oper. Res."},{"key":"109_CR21","unstructured":"Royset, J.O., Szechtman, R.: Optimal budget allocation for sample average approximation (2011). http:\/\/faculty.nps.edu\/joroyset\/docs\/RoysetSzechtman.pdf"},{"issue":"3","key":"109_CR22","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1145\/937332.937334","volume":"13","author":"S.-H. Lee","year":"2003","unstructured":"Lee, S.-H., Glynn, P.W.: Computing the distribution function of a conditional expectation via Monte Carlo: discrete conditioning spaces. ACM Trans. Model. Comput. Simul. 13(3), 238\u2013258 (2003)","journal-title":"ACM Trans. Model. Comput. Simul."},{"issue":"4","key":"109_CR23","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1287\/ijoc.1080.0268","volume":"20","author":"C.H. Chen","year":"2008","unstructured":"Chen, C.H., He, D., Fu, M., Lee, L.H.: Efficient simulation budget allocation for selecting an optimal subset. INFORMS J. Comput. 20(4), 579\u2013595 (2008)","journal-title":"INFORMS J. Comput."},{"key":"109_CR24","unstructured":"Pee, E.Y.: On algorithms for nonlinear minimax and min-max-min problems and their efficiency. Ph.D. Thesis, Naval Postgraduate School, Monterey, California (2011)"},{"issue":"1","key":"109_CR25","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10589-010-9324-8","volume":"51","author":"J.H. Jung","year":"2012","unstructured":"Jung, J.H., O\u2019Leary, D.P., Tits, A.L.: Adaptive constraint reduction for convex quadratic programming. Comput. Optim. Appl. 51(1), 125\u2013157 (2012)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"109_CR26","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01587076","volume":"44","author":"R.D.C. Monteiro","year":"1989","unstructured":"Monteiro, R.D.C., Adler, I.: Interior path following primal-dual algorithms. Part\u00a0II: convex quadratic programming. Math. Program. 44(1), 43\u201366 (1989)","journal-title":"Math. Program."},{"key":"109_CR27","doi-asserted-by":"crossref","unstructured":"Gill, P.E., Hammarling, S.J., Murray, W., Saunders, M.A., Wright, M.H.: User\u2019s guide for LSSOL version 1.0: a Fortran package for constrained linear least-squares and convex quadratic programming. Systems Optimization Laboratory, University of Stanford, Stanford, CA (1986)","DOI":"10.21236\/ADA169115"},{"key":"109_CR28","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s10957-008-9355-9","volume":"138","author":"E. Polak","year":"2008","unstructured":"Polak, E., Womersley, R.S., Yin, H.X.: An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems. J. Optim. Theory Appl. 138, 311\u2013328 (2008)","journal-title":"J. Optim. Theory Appl."},{"key":"109_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization","author":"Y. Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization. Kluwer Academic, Boston (2004)"},{"key":"109_CR30","first-page":"343","volume-title":"Proceedings 1972 IEEE Conference Decision and Control","author":"B.W. Kort","year":"1972","unstructured":"Kort, B.W., Bertsekas, D.P.: A new penalty function algorithm for constrained minimization. In: Proceedings 1972 IEEE Conference Decision and Control, pp.\u00a0343\u2013362 (1972)"},{"key":"109_CR31","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1080\/03052159208941026","volume":"18","author":"X. Li","year":"1992","unstructured":"Li, X.: An entropy-based aggregate method for minimax optimization. Eng. Optim. 18, 277\u2013285 (1992)","journal-title":"Eng. Optim."},{"key":"109_CR32","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1023\/A:1011211101714","volume":"20","author":"S. Xu","year":"2001","unstructured":"Xu, S.: Smoothing method for minimax problems. Comput. Optim. Appl. 20, 267\u2013279 (2001)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"109_CR33","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1023\/B:JOTA.0000006685.60019.3e","volume":"119","author":"E. Polak","year":"2003","unstructured":"Polak, E., Royset, J.O., Womersley, R.S.: Algorithms with adaptive smoothing for finite minimax problems. J. Optim. Theory Appl. 119(3), 459\u2013484 (2003)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"109_CR34","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1016\/j.amc.2007.10.070","volume":"199","author":"F. Ye","year":"2008","unstructured":"Ye, F., Liu, H., Zhou, S., Liu, S.: A smoothing trust-region Newton-CG method for minimax problem. Appl. Math. Comput. 199(2), 581\u2013589 (2008)","journal-title":"Appl. Math. Comput."},{"key":"109_CR35","volume-title":"High Performance Algorithms and Software for Nonlinear Optimization","author":"E. Polak","year":"2003","unstructured":"Polak, E.: Smoothing techniques for the solution of finite and semiinfinite min-max-min problems. In: Pillo, G.D., Murli, A. (eds.) High Performance Algorithms and Software for Nonlinear Optimization. Kluwer Academic, Dordrecht (2003)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-012-0109-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-012-0109-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-012-0109-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T03:38:48Z","timestamp":1642649928000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-012-0109-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,4]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["109"],"URL":"https:\/\/doi.org\/10.1007\/s10957-012-0109-3","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,4]]}}}