{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T10:28:33Z","timestamp":1725877713380},"publisher-location":"Singapore","reference-count":10,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811036132"},{"type":"electronic","value":"9789811036149"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-981-10-3614-9_17","type":"book-chapter","created":{"date-parts":[[2017,1,7]],"date-time":"2017-01-07T00:02:41Z","timestamp":1483747361000},"page":"127-134","source":"Crossref","is-referenced-by-count":0,"title":["Generalized Project Gradient Algorithm for Solving Constrained Minimax Problems"],"prefix":"10.1007","author":[{"given":"Cong","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Limin","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Zhibin","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,8]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01589328","volume":"20","author":"SP Han","year":"1981","unstructured":"Han, S.P.: Variable matric methods for minimizing a class of nondifferentiable functions. Math. Program. 20, 1\u201313 (1981)","journal-title":"Math. Program."},{"key":"17_CR2","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1007\/BF00940496","volume":"75","author":"A Vardi","year":"1992","unstructured":"Vardi, A.: A new minimax algorithm. J. Optim. Theory Appl. 75, 613\u2013634 (1992)","journal-title":"J. Optim. Theory Appl."},{"key":"17_CR3","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1016\/j.mcm.2003.10.055","volume":"42","author":"I Husain","year":"2005","unstructured":"Husain, I., Jabeen, Z.: Continuous-time fractional minimax programming. Math. Comput. Model. 42, 701\u2013710 (2005)","journal-title":"Math. Comput. Model."},{"key":"17_CR4","first-page":"107","volume":"28","author":"JB Jian","year":"2013","unstructured":"Jian, J.B., Shi, L., Tang, C.M.: Perturbed SQP method with active set technology for unconstrained minimax problems. Appl. Math. J. Chin. Univ. 28, 107\u2013114 (2013)","journal-title":"Appl. Math. J. Chin. Univ."},{"key":"17_CR5","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/BF00939377","volume":"76","author":"JL Zhou","year":"1996","unstructured":"Zhou, J.L., Tits, A.L.: Nonmonotone line search for minimax problems. J. Optim. Theory Appl. 76, 455\u2013476 (1996)","journal-title":"J. Optim. Theory Appl."},{"key":"17_CR6","first-page":"227","volume-title":"Fast Algorithms for Smooth Constrained Optimization - Theoretical Analysis and Numerical Experiments","author":"JB Jian","year":"2010","unstructured":"Jian, J.B.: Fast Algorithms for Smooth Constrained Optimization - Theoretical Analysis and Numerical Experiments, pp. 227\u2013228. Science Press, Beijing (2010)"},{"key":"17_CR7","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1137\/0108011","volume":"8","author":"JB Rosen","year":"1960","unstructured":"Rosen, J.B.: The gradient projection method for nonliear programming. Part 1. Linear constraints. SIAM J. Appl. Math. 8, 181\u2013217 (1960)","journal-title":"SIAM J. Appl. Math."},{"key":"17_CR8","first-page":"1443","volume":"36","author":"ZY Gao","year":"1991","unstructured":"Gao, Z.Y., He, G.P.: A Generalized gradient project method for constrained optimization. Bull. Sci. Technol. 36, 1443\u20131447 (1991)","journal-title":"Bull. Sci. Technol."},{"key":"17_CR9","first-page":"916","volume":"9","author":"YL Lai","year":"1992","unstructured":"Lai, Y.L., He, G.P., Gao, Z.Y.: Generalized gradient project method for nonlinear optimization. Sci. China 9, 916\u2013924 (1992)","journal-title":"Sci. China"},{"key":"17_CR10","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1023\/A:1020896407415","volume":"115","author":"YH 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."}],"container-title":["Communications in Computer and Information Science","Bio-inspired Computing \u2013 Theories and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-3614-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T03:31:59Z","timestamp":1498361519000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-3614-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9789811036132","9789811036149"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-3614-9_17","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2016]]}}}