{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T06:26:55Z","timestamp":1778048815923,"version":"3.51.4"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,10,14]],"date-time":"2010-10-14T00:00:00Z","timestamp":1287014400000},"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":[[2011,2]]},"DOI":"10.1007\/s10957-010-9759-1","type":"journal-article","created":{"date-parts":[[2010,10,14]],"date-time":"2010-10-14T07:39:49Z","timestamp":1287041989000},"page":"390-421","source":"Crossref","is-referenced-by-count":33,"title":["On Solving Large-Scale Finite Minimax Problems Using Exponential Smoothing"],"prefix":"10.1007","volume":"148","author":[{"given":"E. Y.","family":"Pee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. O.","family":"Royset","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,10,14]]},"reference":[{"key":"9759_CR1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1137\/1029002","volume":"29","author":"E. Polak","year":"1987","unstructured":"Polak, E.: On the mathematical foundations of nondifferentiable optimization in engineering design. SIAM Rev. 29, 21\u201389 (1987)","journal-title":"SIAM Rev."},{"key":"9759_CR2","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1109\/TAC.1987.1104614","volume":"32","author":"E. Polak","year":"1987","unstructured":"Polak, E., Salcudean, S., Mayne, D.Q.: Adaptive control of ARMA plants using worst case design by semi-infinite optimization. IEEE Trans. Autom. Control 32, 388\u2013397 (1987)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"7","key":"9759_CR3","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1287\/mnsc.46.7.957.12039","volume":"46","author":"X. Cai","year":"2000","unstructured":"Cai, X., Teo, K., Yang, X., Zhou, X.: Portfolio optimization under a minimax rule. Manag. Sci. 46(7), 957\u2013972 (2000)","journal-title":"Manag. Sci."},{"key":"9759_CR4","volume-title":"Introduction to Minimax","author":"V.F. Demyanov","year":"1974","unstructured":"Demyanov, V.F., Malozemov, V.N.: Introduction to Minimax. Wiley, New York (1974)"},{"issue":"8","key":"9759_CR5","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1109\/9.29441","volume":"34","author":"E.R. Panier","year":"1989","unstructured":"Panier, E.R., Tits, A.L.: A globally convergent algorithm with adaptively refined discretization for semi-infinite optimization problems arising in engineering design. IEEE Trans. Autom. Control 34(8), 903\u2013908 (1989)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"2","key":"9759_CR6","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":"3","key":"9759_CR7","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.\u00a0Optim. Theory Appl. 119(3), 459\u2013484 (2003)","journal-title":"J.\u00a0Optim. Theory Appl."},{"key":"9759_CR8","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s10957-009-9599-z","volume":"144","author":"E. Obasanjo","year":"2010","unstructured":"Obasanjo, E., Tzallas-Regas, G., Rustem, B.: An interior-point algorithm for nonlinear minimax problems. J.\u00a0Optim. Theory Appl. 144, 291\u2013318 (2010)","journal-title":"J.\u00a0Optim. Theory Appl."},{"issue":"4","key":"9759_CR9","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/j.aml.2008.06.017","volume":"22","author":"Z. Zhu","year":"2009","unstructured":"Zhu, Z., Cai, X., Jian, J.: An improved SQP algorithm for solving minimax problems. Appl. Math. Lett. 22(4), 464\u2013469 (2009)","journal-title":"Appl. Math. Lett."},{"key":"9759_CR10","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/978-1-4613-3557-3_4","volume-title":"Minimax and Applications","author":"J.F. Sturm","year":"1995","unstructured":"Sturm, J.F., Zhang, S.: A dual and interior-point approach to solve convex min-max problems. In: Du, D.Z., Pardalos, P.M. (eds.) Minimax and Applications, pp. 69\u201378. Kluwer Academic, Dordrecht (1995)"},{"key":"9759_CR11","unstructured":"Luksan, L., Matonoha, C., Vlcek, J.: Primal interior-point method for large sparse minimax optimization. Technical Report 941, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague, Czech Republic (2005)"},{"issue":"2","key":"9759_CR12","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":"9759_CR13","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.\u00a0Optim. Theory Appl. 138, 311\u2013328 (2008)","journal-title":"J.\u00a0Optim. Theory Appl."},{"key":"9759_CR14","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":"9759_CR15","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."},{"key":"9759_CR16","first-page":"343","volume-title":"Proceedings 1972 IEEE Conf. 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 Conf. Decision and Control, vol.\u00a082, pp.\u00a0343\u2013362 (1972)"},{"key":"9759_CR17","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"A.S. Nemirovski","year":"1983","unstructured":"Nemirovski, A.S., Yudin, D.B.: Problem Complexity and Method Efficiency in Optimization. Wiley, New York (1983)"},{"issue":"2","key":"9759_CR18","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF02604643","volume":"38","author":"Z. Drezner","year":"1987","unstructured":"Drezner, Z.: On the complexity of the exchange algorithm for minimax optimization problems. Math. Program. 38(2), 219\u2013222 (1987)","journal-title":"Math. Program."},{"issue":"1","key":"9759_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00940037","volume":"71","author":"E.J. Wiest","year":"1991","unstructured":"Wiest, E.J., Polak, E.: On the rate of convergence of two minimax algorithms. J.\u00a0Optim. Theory Appl. 71(1), 1\u201330 (1991)","journal-title":"J.\u00a0Optim. Theory Appl."},{"issue":"1","key":"9759_CR20","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF01585556","volume":"69","author":"Yu. Nesterov","year":"1995","unstructured":"Nesterov, Yu.: Complexity estimates of some cutting plane methods based on the analytic barrier. Math. Program. 69(1), 149\u2013176 (1995)","journal-title":"Math. Program."},{"issue":"2","key":"9759_CR21","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1023\/A:1026422013954","volume":"107","author":"K.A. Ariyawansa","year":"2000","unstructured":"Ariyawansa, K.A., Jiang, P.L.: On complexity of the translational-cut algorithm for convex minimax problems. J.\u00a0Optim. Theory Appl. 107(2), 223\u2013243 (2000)","journal-title":"J.\u00a0Optim. Theory Appl."},{"issue":"1","key":"9759_CR22","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s10107-003-0392-8","volume":"99","author":"Yu. Nesterov","year":"2004","unstructured":"Nesterov, Yu., Vial, J.Ph.: Augmented self-concordant barriers and nonlinear optimization problems with finite complexity. Math. Program. 99(1), 149\u2013174 (2004)","journal-title":"Math. Program."},{"key":"9759_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A\u00a0Basic Course (Applied Optimization)","author":"Yu. Nesterov","year":"2004","unstructured":"Nesterov, Yu.: Introductory Lectures on Convex Optimization: A\u00a0Basic Course (Applied Optimization). Kluwer Academic, Dordrecht (2004)"},{"key":"9759_CR24","volume-title":"Optimization. Algorithms and Consistent Approximations","author":"E. Polak","year":"1997","unstructured":"Polak, E.: Optimization. Algorithms and Consistent Approximations. Springer, New York (1997)"},{"key":"9759_CR25","volume-title":"Convex Analysis and Minimization Algorithms\u00a01. Fundamentals","author":"H. Urruty","year":"1996","unstructured":"Urruty, H., Baptiste, J.: Convex Analysis and Minimization Algorithms\u00a01. Fundamentals. Springer, Berlin (1996)"},{"key":"9759_CR26","volume-title":"Numerical Linear Algebra and Optimization","author":"P.E. Gill","year":"1991","unstructured":"Gill, P.E., Murray, W., Wright, M.H.: Numerical Linear Algebra and Optimization. Addison-Wesley, Redwood (1991)"},{"issue":"1","key":"9759_CR27","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 II: Convex quadratic programming. Math. Program. 44(1), 43\u201366 (1989)","journal-title":"Math. Program."},{"key":"9759_CR28","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"R.T. Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis. Springer, Heidelberg (1998)"},{"key":"9759_CR29","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 semi-infinite min-max-min problems. In: Pillo, G.D., Murli, A. (eds.) High Performance Algorithms and Software for Nonlinear Optimization. Kluwer Academic, Dordrecht (2003)"},{"issue":"2","key":"9759_CR30","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/s10957-008-9354-x","volume":"138","author":"E. Polak","year":"2008","unstructured":"Polak, E.: On the convergence of the Pshenichnyi-Pironneau-Polak minimax algorithm with an active set strategy. J.\u00a0Optim. Theory Appl. 138(2), 305\u2013309 (2008)","journal-title":"J.\u00a0Optim. Theory Appl."},{"key":"9759_CR31","unstructured":"Mathworks Inc.: MATLAB 7 Getting Started Guide. Natick, MA (2009)"},{"key":"9759_CR32","unstructured":"Tomlab Optimization Inc.: User\u2019s Guide for TOMLAB\/CPLEX v12.1. Pullman, WA (2009)"},{"key":"9759_CR33","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\u00a0Fortran Package for Constrained Linear Least-Squares and Convex Quadratic Programming. Stanford, CA (1986)","DOI":"10.21236\/ADA169115"},{"key":"9759_CR34","unstructured":"Lawrence, C., Zhou, J.L., Tits, A.L.: User\u2019s Guide for CFSQP Version 2.5: A C Code for Solving (Large Scale) Constrained Nonlinear (Minimax) Optimization Problems, Generating Iterates Satisfying All Inequality Constraints. Technical Report (1997)"},{"key":"9759_CR35","volume-title":"Introductory Combinatorics","author":"R.A. Brualdi","year":"2004","unstructured":"Brualdi, R.A.: Introductory Combinatorics. Prentice-Hall, Upper Saddle River (2004)"},{"issue":"4","key":"9759_CR36","first-page":"15","volume":"27","author":"Z. Zhu","year":"2005","unstructured":"Zhu, Z., Zhang, K.: A superlinearly convergent sequential quadratic programming algorithm for minimax problems. Chin. J. Numer. Math. Appl. 27(4), 15\u201332 (2005)","journal-title":"Chin. J. Numer. Math. Appl."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-010-9759-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-010-9759-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-010-9759-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,11]],"date-time":"2021-11-11T20:59:02Z","timestamp":1636664342000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-010-9759-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,14]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["9759"],"URL":"https:\/\/doi.org\/10.1007\/s10957-010-9759-1","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10,14]]}}}