{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:05:54Z","timestamp":1758823554140},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,12,13]],"date-time":"2013-12-13T00:00:00Z","timestamp":1386892800000},"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":[[2014,12]]},"DOI":"10.1007\/s10957-013-0503-5","type":"journal-article","created":{"date-parts":[[2013,12,12]],"date-time":"2013-12-12T12:42:01Z","timestamp":1386852121000},"page":"859-883","source":"Crossref","is-referenced-by-count":6,"title":["Superlinearly Convergent Norm-Relaxed SQP Method Based on Active Set Identification and New Line Search for Constrained Minimax Problems"],"prefix":"10.1007","volume":"163","author":[{"given":"Jin-bao","family":"Jian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qing-juan","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chun-ming","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,12,13]]},"reference":[{"key":"503_CR1","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/BF00939377","volume":"76","author":"J.L. Zhou","year":"1993","unstructured":"Zhou, J.L., Tits, A.L.: Nonmonotone line search for minimax problems. J. Optim. Theory Appl. 76, 455\u2013476 (1993)","journal-title":"J. Optim. Theory Appl."},{"key":"503_CR2","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1137\/S1056263493260386","volume":"8","author":"B. Rustem","year":"1998","unstructured":"Rustem, B., Nguyen, Q.: An algorithm for the inequality-constrained discrete minimax problem. SIAM J. Optim. 8, 265\u2013283 (1998)","journal-title":"SIAM J. Optim."},{"key":"503_CR3","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1023\/A:1020896407415","volume":"115","author":"Y.H. Yu","year":"2002","unstructured":"Yu, Y.H., Gao, L.: Nonmonotone line search algorithm for constrained minimax problems. J. Optim. Theory Appl. 115, 419\u2013446 (2002)","journal-title":"J. Optim. Theory Appl."},{"key":"503_CR4","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/j.cam.2006.05.034","volume":"205","author":"J.B. Jian","year":"2007","unstructured":"Jian, J.B., Quan, R., Zhang, X.L.: Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints. J. Comput. Appl. Math. 205, 406\u2013429 (2007)","journal-title":"J. Comput. Appl. Math."},{"key":"503_CR5","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/BF02139477","volume":"2","author":"R. Reemtsen","year":"1992","unstructured":"Reemtsen, R.: A cutting plane method for solving minimax problems in the complex plane. Numer. Algorithms 2, 409\u2013436 (1992)","journal-title":"Numer. Algorithms"},{"key":"503_CR6","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":"503_CR7","first-page":"311","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. Math. Anal. Appl. 138, 311\u2013328 (2008)","journal-title":"J. Math. Anal. Appl."},{"key":"503_CR8","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/j.aml.2008.06.017","volume":"22","author":"Z.B. Zhu","year":"2009","unstructured":"Zhu, Z.B., Cai, X., Jian, J.B.: An improved SQP algorithm for solving minimax problems. Appl. Math. Lett. 22, 464\u2013469 (2009)","journal-title":"Appl. Math. Lett."},{"key":"503_CR9","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1080\/02331930801951140","volume":"58","author":"J.B. Jian","year":"2009","unstructured":"Jian, J.B., Zhang, X.L., Quan, R., Ma, Q.: Generalized monotone line search SQP algorithm for constrained minimax problems. Optimization 58, 101\u2013131 (2009)","journal-title":"Optimization"},{"key":"503_CR10","doi-asserted-by":"crossref","first-page":"3022","DOI":"10.1016\/j.na.2011.01.024","volume":"74","author":"D.L. Han","year":"2011","unstructured":"Han, D.L., Jian, J.B., Li, J.: On the accurate identification of active set for constrained minimax problems. Nonlinear Anal., Real World Appl. 74, 3022\u20133032 (2011)","journal-title":"Nonlinear Anal., Real World Appl."},{"key":"503_CR11","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1007\/s10957-012-0109-3","volume":"155","author":"J.O. Royset","year":"2012","unstructured":"Royset, J.O., Pee, E.Y.: Rate of convergence analysis of discretization and smoothing algorithms for semi-infinite minimax problems. J. Optim. Theory Appl. 155, 855\u2013882 (2012)","journal-title":"J. Optim. Theory Appl."},{"key":"503_CR12","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1080\/02331934.2012.675335","volume":"62","author":"A.M. Bagirov","year":"2013","unstructured":"Bagirov, A.M., Al\u00a0Nuaimat, A., Sultanova, N.: Hyperbolic smoothing function method for minimax problems. Optimization 62, 759\u2013782 (2013)","journal-title":"Optimization"},{"key":"503_CR13","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1080\/10556788.2011.638923","volume":"28","author":"W. Hare","year":"2013","unstructured":"Hare, W., Macklem, M.: Derivative-free optimization methods for finite minimax problems. Optim. Methods Softw. 28, 300\u2013312 (2013)","journal-title":"Optim. Methods Softw."},{"key":"503_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10589-013-9547-6","volume":"56","author":"W. Hare","year":"2013","unstructured":"Hare, W., Nutini, J.: A derivative-free approximate gradient sampling algorithm for finite minimax problems. Comput. Optim. Appl. 56, 1\u201338 (2013)","journal-title":"Comput. Optim. Appl."},{"key":"503_CR15","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s10479-012-1274-3","volume":"206","author":"F.S. Wang","year":"2013","unstructured":"Wang, F.S.: A hybrid algorithm for linearly constrained minimax problems. Ann. Oper. Res. 206, 501\u2013525 (2013)","journal-title":"Ann. Oper. Res."},{"key":"503_CR16","doi-asserted-by":"crossref","unstructured":"Jian, J.B., Mo, X.D., Qiu, L.J., Yang, S.M., Wang, F.S.: Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems. J. Optim. Theory Appl. (2013, in press). doi: 10.1007\/s10957-013-0339-z","DOI":"10.1007\/s10957-013-0339-z"},{"key":"503_CR17","volume-title":"Methods of Feasible Directions","author":"G. Zoutendijk","year":"1960","unstructured":"Zoutendijk, G.: Methods of Feasible Directions. Elsevier, Amsterdam (1960)"},{"key":"503_CR18","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1137\/0305018","volume":"5","author":"D.M. Topkis","year":"1967","unstructured":"Topkis, D.M., Veinott, A.F.: On the convergence of some feasible direction algorithms for nonlinear programming. SIAM J. Control 5, 268\u2013279 (1967)","journal-title":"SIAM J. Control"},{"key":"503_CR19","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1137\/0710017","volume":"10","author":"O. Pironneau","year":"1973","unstructured":"Pironneau, O., Polak, E.: Rate of convergence of a class of methods of feasible directions. SIAM J. Numer. Anal. 10, 161\u2013173 (1973)","journal-title":"SIAM J. Numer. Anal."},{"key":"503_CR20","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF02190059","volume":"83","author":"M.E. Cawood","year":"1994","unstructured":"Cawood, M.E., Kostreva, M.M.: Norm-relaxed method of feasible direction for solving the nonlinear programming problems. J. Optim. Theory Appl. 83, 311\u2013320 (1994)","journal-title":"J. Optim. Theory Appl."},{"key":"503_CR21","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0096-3003(98)10025-5","volume":"102","author":"X. Chen","year":"1999","unstructured":"Chen, X., Kostreva, M.M.: A generalization of the norm-relaxed method of feasible directions. Appl. Math. Comput. 102, 257\u2013273 (1999)","journal-title":"Appl. Math. Comput."},{"key":"503_CR22","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0096-3003(99)00176-9","volume":"116","author":"M.M. Kostreva","year":"2000","unstructured":"Kostreva, M.M., Chen, X.: A superlinearly convergent method of feasible directions. Appl. Math. Comput. 116, 231\u2013244 (2000)","journal-title":"Appl. Math. Comput."},{"key":"503_CR23","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1137\/S1052623498344562","volume":"11","author":"C.T. Lawrence","year":"2001","unstructured":"Lawrence, C.T., Tits, A.L.: A computationally efficient feasible sequential quadratic programming algorithm. SIAM J. Optim. 11, 1092\u20131118 (2001)","journal-title":"SIAM J. Optim."},{"key":"503_CR24","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1023\/A:1021778002066","volume":"100","author":"X. Chen","year":"1999","unstructured":"Chen, X., Kostreva, M.M.: Global convergence analysis of algorithm for finding feasible points in norm-relaxed method of feasible directions. J. Optim. Theory Appl. 100, 287\u2013309 (1999)","journal-title":"J. Optim. Theory Appl."},{"key":"503_CR25","first-page":"64","volume":"12","author":"J.B. Jian","year":"1995","unstructured":"Jian, J.B.: Strong combined Phase I\u2013Phase II methods of sub-feasible directions. Math. Econ. 12, 64\u201370 (1995) (in Chinese)","journal-title":"Math. Econ."},{"key":"503_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.amc.2004.08.009","volume":"168","author":"J.B. Jian","year":"2005","unstructured":"Jian, J.B., Zheng, H.Y., Hu, Q.J., Tang, C.M.: A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization. Appl. Math. Comput. 168, 1\u201328 (2005)","journal-title":"Appl. Math. Comput."},{"key":"503_CR27","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1016\/j.amc.2006.04.050","volume":"182","author":"J.B. Jian","year":"2006","unstructured":"Jian, J.B., Zheng, H.Y., Hu, Q.J., Tang, C.M.: A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization. Appl. Math. Comput. 182, 955\u2013976 (2006)","journal-title":"Appl. Math. Comput."},{"key":"503_CR28","volume-title":"Fast Algorithms for Smooth Constrained Optimization-Theoretical Analysis and Numerical Experiments","author":"J.B. Jian","year":"2010","unstructured":"Jian, J.B.: Fast Algorithms for Smooth Constrained Optimization-Theoretical Analysis and Numerical Experiments. Science Press, Beijing (2010)"},{"key":"503_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-007-0180-y","volume":"118","author":"M.V. Solodov","year":"2009","unstructured":"Solodov, M.V.: Global convergence of an SQP method without boundedness assumptions on any of iterative sequences. Math. Program. 118, 1\u201312 (2009)","journal-title":"Math. Program."},{"key":"503_CR30","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1016\/j.aml.2010.02.005","volume":"23","author":"H.Y. Zheng","year":"2010","unstructured":"Zheng, H.Y., Jian, J.B., Tang, C.M., Quan, R.: A new norm-relaxed SQP algorithm with global convergence. Appl. Math. Lett. 23, 670\u2013675 (2010)","journal-title":"Appl. Math. Lett."},{"key":"503_CR31","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1137\/0725068","volume":"25","author":"J.V. Burke","year":"1998","unstructured":"Burke, J.V., More, J.J.: On the identification of active constraints. SIAM J. Numer. Anal. 25, 1197\u20131211 (1998)","journal-title":"SIAM J. Numer. Anal."},{"key":"503_CR32","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1137\/S1052623496305882","volume":"9","author":"F. Facchinei","year":"1998","unstructured":"Facchinei, F., Fischer, A., Kanzow, C.: On the accurate identification of active constraints. SIAM J. Optim. 9, 14\u201332 (1998)","journal-title":"SIAM J. Optim."},{"key":"503_CR33","first-page":"251","volume":"11","author":"W.L. Hare","year":"2004","unstructured":"Hare, W.L., Lewis, A.S.: Identifying active constraints via partial smoothness and prox-regularity. J.\u00a0Convex Anal. 11, 251\u2013266 (2004)","journal-title":"J.\u00a0Convex Anal."},{"key":"503_CR34","doi-asserted-by":"crossref","first-page":"2717","DOI":"10.1016\/j.nonrwa.2011.03.017","volume":"12","author":"J.B. Jian","year":"2011","unstructured":"Jian, J.B., Liu, Y.: A superlinearly convergent method of quasi-strongly sub-feasible direction with active set identifying for constrained optimization. Nonlinear Anal., Real World Appl. 12, 2717\u20132729 (2011)","journal-title":"Nonlinear Anal., Real World Appl."},{"key":"503_CR35","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.amc.2008.08.033","volume":"205","author":"M.T. Chao","year":"2008","unstructured":"Chao, M.T., Wang, Z.X., Liang, Y.M., Hu, Q.J.: Quadratically constraint quadratical algorithm model for nonlinear minimax problems. Appl. Math. Comput. 205, 247\u2013262 (2008)","journal-title":"Appl. Math. Comput."},{"key":"503_CR36","unstructured":"Karmitsa, N.: Test problems for large-scale nonsmooth minimization. Reports of the Department of Mathematical Information Technology, Series B. Scientific Computing, No.\u00a0B.4 (2007)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-013-0503-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-013-0503-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-013-0503-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:58:35Z","timestamp":1559455115000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-013-0503-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,13]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["503"],"URL":"https:\/\/doi.org\/10.1007\/s10957-013-0503-5","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,13]]}}}