{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,16]],"date-time":"2022-04-16T04:40:40Z","timestamp":1650084040727},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,9,3]],"date-time":"2014-09-03T00:00:00Z","timestamp":1409702400000},"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":["J Optim Theory Appl"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s10957-014-0646-z","type":"journal-article","created":{"date-parts":[[2014,9,2]],"date-time":"2014-09-02T16:32:32Z","timestamp":1409675552000},"page":"257-277","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Group Update Method for Sparse Minimax Problems"],"prefix":"10.1007","volume":"166","author":[{"given":"Junxiang","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingsong","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuting","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,9,3]]},"reference":[{"key":"646_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":"646_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":"2","key":"646_CR3","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1109\/TEVC.2008.2004422","volume":"13","author":"A Cramer","year":"2009","unstructured":"Cramer, A., Sudhoff, S., Zivi, E.: Evolutionary algorithms for minimax problems in robust design. IEEE Trans. Evol. Comput. 13(2), 444\u2013453 (2009)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"7","key":"646_CR4","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."},{"issue":"3","key":"646_CR5","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1287\/msom.1070.0172","volume":"10","author":"S Bhulai","year":"2008","unstructured":"Bhulai, S., Koole, G., Pot, A.: Simple methods for shift scheduling in multiskill call centers. Manuf. Serv. Oper. Manag. 10(3), 411\u2013420 (2008)","journal-title":"Manuf. Serv. Oper. Manag."},{"key":"646_CR6","doi-asserted-by":"crossref","first-page":"1284","DOI":"10.1057\/jors.2011.135","volume":"63","author":"B Mor","year":"2012","unstructured":"Mor, B., Mosheiov, G.: Minmax scheduling problems with common flow-allowance. J. Oper. Res. Soc. 63, 1284\u20131293 (2012)","journal-title":"J. Oper. Res. Soc."},{"key":"646_CR7","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/net.21473","volume":"60","author":"S Ruzika","year":"2012","unstructured":"Ruzika, S., Thiemann, M.: Min-Max quickest path problems. Networks 60, 253\u2013258 (2012)","journal-title":"Networks"},{"key":"646_CR8","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1016\/j.omega.2012.03.007","volume":"41","author":"SS Liu","year":"2013","unstructured":"Liu, S.S., Papageorgiou, L.G.: Multiobjective optimisation of production, distribution and capacity planning of global supply chains in the process industry. Omega 41, 369\u2013382 (2013)","journal-title":"Omega"},{"key":"646_CR9","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, X.H.: 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":"646_CR10","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1007\/s10957-012-0109-3","volume":"155","author":"JO Royset","year":"2012","unstructured":"Royset, J.O., Pee, E.Y.: Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems. J. Optim. Theory Appl. 155, 855\u2013882 (2012)","journal-title":"J. Optim. Theory Appl."},{"key":"646_CR11","unstructured":"Luk\u0161an L., Vl\u010dek, J.: Test problems for nonsmooth unconstrained and linearly constrained optimization. Report V-798, Prague, ICS AS CR (2000)"},{"key":"646_CR12","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)"},{"key":"646_CR13","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.jmaa.2009.08.046","volume":"362","author":"JB Jian","year":"2010","unstructured":"Jian, J.B., Chao, M.T.: A sequential quadratically constrained quadratic programming method for unconstrained minimax problems. J. Math. Anal. Appl. 362, 34\u201345 (2010)","journal-title":"J. Math. Anal. Appl."},{"key":"646_CR14","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. Optim. Theory Appl. 144, 291\u2013318 (2010)","journal-title":"J. Optim. Theory Appl."},{"key":"646_CR15","doi-asserted-by":"crossref","first-page":"8033","DOI":"10.1016\/j.amc.2013.01.071","volume":"219","author":"FS Wang","year":"2013","unstructured":"Wang, F.S., Wang, C.L.: An adaptive nonmonotone trust-region method with curvilinear search for minimax problem. Appl. Math. Comput. 219, 8033\u20138041 (2013)","journal-title":"Appl. Math. Comput."},{"key":"646_CR16","doi-asserted-by":"crossref","first-page":"2750","DOI":"10.1016\/j.amc.2011.08.017","volume":"218","author":"JX Li","year":"2011","unstructured":"Li, J.X., Huo, J.Z.: Inexact smoothing method for large sparse minimax optimization. Appl. Math. Comput. 218, 2750\u20132760 (2011)","journal-title":"Appl. Math. Comput."},{"key":"646_CR17","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1080\/03052159208941026","volume":"18","author":"XS Li","year":"1992","unstructured":"Li, X.S.: An entropy-based aggregate method for minimax optimization. Eng. Optim. 18, 277\u2013285 (1992)","journal-title":"Eng. Optim."},{"key":"646_CR18","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, 459\u2013484 (2003)","journal-title":"J. Optim. Theory Appl."},{"key":"646_CR19","first-page":"287","volume":"19","author":"B Yu","year":"2003","unstructured":"Yu, B., Liu, G.X., Feng, G.C.: The aggregate homotopy methods for constrained sequential max-min problems. Northeast. Math. J. 19, 287\u2013290 (2003)","journal-title":"Northeast. Math. J."},{"key":"646_CR20","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/s10957-010-9759-1","volume":"148","author":"EY 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, 390\u2013421 (2011)","journal-title":"J. Optim. Theory Appl."},{"key":"646_CR21","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/BF00940683","volume":"69","author":"E Polak","year":"1991","unstructured":"Polak, E., Mayne, D.Q., Higgins, J.E.: Superlinearly convergent algorithm for min-max problems. J. Optim. Theory Appl. 69, 407\u2013439 (1991)","journal-title":"J. Optim. Theory Appl."},{"key":"646_CR22","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1137\/0330023","volume":"30","author":"E Polak","year":"1992","unstructured":"Polak, E., Mayne, D.Q., Higgins, J.E.: On the extension of Newton\u2019s method to semi-infinite minimax problems. SIAM J. Control Optim. 30, 367\u2013389 (1992)","journal-title":"SIAM J. Control Optim."},{"key":"646_CR23","first-page":"316","volume":"27","author":"ST Zhang","year":"2005","unstructured":"Zhang, S.T., Yu, B.: A globally convergent method for nonconvex generalized semi-infinite minimax problems. Numer. Math. A 27, 316\u2013319 (2005)","journal-title":"Numer. Math. A"},{"key":"646_CR24","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/j.amc.2006.07.107","volume":"186","author":"JX Li","year":"2007","unstructured":"Li, J.X., Zhang, H.W.: On the convergence of partitioning group correction algorithms. Appl. Math. Comput. 186, 365\u2013378 (2007)","journal-title":"Appl. Math. Comput."},{"key":"646_CR25","volume-title":"Practical Optimization","author":"P Gill","year":"1981","unstructured":"Gill, P., Murray, W., Wright, M.H.: Practical Optimization. Academic Press, London (1981)"},{"key":"646_CR26","doi-asserted-by":"crossref","first-page":"1010","DOI":"10.1016\/j.amc.2006.05.001","volume":"182","author":"JX Li","year":"2006","unstructured":"Li, J.X., Zhang, H.W.: Partitioning group correction Cholesky techniques for large scale sparse unconstrained optimization. Appl. Math. Comput. 182, 1010\u20131020 (2006)","journal-title":"Appl. Math. Comput."},{"key":"646_CR27","doi-asserted-by":"crossref","first-page":"1060","DOI":"10.1137\/0716078","volume":"16","author":"MJD Powell","year":"1979","unstructured":"Powell, M.J.D., Toint, PhL: On the estimation of sparse Hessian matrices. SIAM J. Numer. Anal. 16, 1060\u20131074 (1979)","journal-title":"SIAM J. Numer. Anal."},{"key":"646_CR28","volume-title":"Optimization Algorithm and Consistent Approximations","author":"E Polak","year":"1997","unstructured":"Polak, E.: Optimization Algorithm and Consistent Approximations. Springer, New York (1997)"},{"key":"646_CR29","doi-asserted-by":"crossref","first-page":"637","DOI":"10.3934\/jimo.2014.10.637","volume":"10","author":"JX Li","year":"2014","unstructured":"Li, J.X., Gao, Y., Dai, T., Ye, C.M., Su, Q., Huo, J.Z.: Substitution Secant\/finite difference method to large sparse minimax problems. J. Ind. Manag. Optim. 10, 637\u2013663 (2014)","journal-title":"J. Ind. Manag. Optim."},{"key":"646_CR30","volume-title":"Optimization Theorem and Methods","author":"YX Yuan","year":"2001","unstructured":"Yuan, Y.X., Sun, W.Y.: Optimization Theorem and Methods. Science Press, Beijing (2001)"},{"key":"646_CR31","volume-title":"Iterative Solution of Nonlinear Equations in Several Variables","author":"JM Ortega","year":"1970","unstructured":"Ortega, J.M., Rheinboldt, W.C.: Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York (1970)"},{"key":"646_CR32","unstructured":"Luk\u0161an, L., Vl\u010dek, J.: Sparse and partially separable test problems for unconstrained and equality constrained optimization. Report V-767, Prague, ICS AS CR (1999)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-014-0646-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-014-0646-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-014-0646-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,16]],"date-time":"2022-04-16T04:09:51Z","timestamp":1650082191000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-014-0646-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,3]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["646"],"URL":"https:\/\/doi.org\/10.1007\/s10957-014-0646-z","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,3]]}}}