{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T04:10:04Z","timestamp":1752379804624,"version":"3.41.2"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1999,4,1]],"date-time":"1999-04-01T00:00:00Z","timestamp":922924800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,4,1]],"date-time":"1999-04-01T00:00:00Z","timestamp":922924800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[1999,4]]},"DOI":"10.1023\/a:1008660924636","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T10:12:40Z","timestamp":1040551960000},"page":"137-161","source":"Crossref","is-referenced-by-count":5,"title":["First-Order Algorithms for Generalized Semi-Infinite Min-Max Problems"],"prefix":"10.1007","volume":"13","author":[{"given":"Elijah","family":"Polak","sequence":"first","affiliation":[]},{"given":"Liqun","family":"Qi","sequence":"additional","affiliation":[]},{"given":"Defeng","family":"Sun","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"190507_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BFb0120696","volume":"3","author":"D. P. Bertsekas","year":"1975","unstructured":"D. P. Bertsekas, \u201cNondifferentiable optimization via approximation,\u201d Mathematical Programming Study, vol. 3, pp. 1-25, 1975.","journal-title":"Mathematical Programming Study"},{"key":"190507_CR2","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/BFb0121134","volume":"29","author":"V. F. Dem'yanov","year":"1986","unstructured":"V. F. Dem'yanov, \u201cQuasidifferentiable functions: necessary conditions and descent directions\u201d, Mathematical Programming Study, vol. 29, pp. 20-43, 1986.","journal-title":"Mathematical Programming Study"},{"key":"190507_CR3","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/BFb0121138","volume":"29","author":"V. F. Dem'yanov","year":"1986","unstructured":"V. F. Dem'yanov, S. Gamidov, and I. T. Sivelina, \u201cAn algorithm for minimizing a certain class of quasidifferentiable functions\u201d, Mathematical Programming Study, vol. 29, pp. 74-84, 1986.","journal-title":"Mathematical Programming Study"},{"key":"190507_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0121132","volume-title":"Quasidifferential Calculus","author":"V. F. Dem'yanov","year":"1986","unstructured":"V. F. Dem'yanov and A. M. Rubinov, Quasidifferential Calculus, Optimization Software Inc.: New York, 1986."},{"key":"190507_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1022627226891","volume":"95","author":"G. Di Pillo","year":"1997","unstructured":"G. Di Pillo, L. Grippo, and S. Lucidi, \u201cA smooth transformation of the generalized minimax problem\u201d, Journal of Optimization Theory and Applications vol. 95, pp. 1-24, 1997.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"190507_CR6","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF02591883","volume":"30","author":"M. Fukushima","year":"1984","unstructured":"M. Fukushima, \u201cA descent algorithm for nonsmooth convex optimization,\u201d Mathematical Programming, vol. 30, pp. 163-175, 1984.","journal-title":"Mathematical Programming"},{"key":"190507_CR7","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/BF01391417","volume":"45","author":"K. C. Kiwiel","year":"1984","unstructured":"K. C. Kiwiel, \u201cA quadratic approximation method for minimizing a class of quasidifferentiable functions,\u201d Numerische Mathematik, vol. 45, 411-430, 1984.","journal-title":"Numerische Mathematik"},{"key":"190507_CR8","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/BFb0121139","volume":"29","author":"K.C. Kiwiel","year":"1986","unstructured":"K.C. Kiwiel, \u201cA linearization method for minimizing certain quasidifferentiable functions,\u201d Mathematical Programming Study, vol. 29, pp. 85-94, 1986.","journal-title":"Mathematical Programming Study"},{"key":"190507_CR9","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1080\/02331938608843159","volume":"17","author":"K. C. Kiwiel","year":"1986","unstructured":"K. C. Kiwiel, \u201cRandomized search directions in descent methods for minimizing certain quasidifferentiable functions,\u201d Optimization, vol. 17, pp. 475-485, 1986.","journal-title":"Optimization"},{"key":"190507_CR10","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF01443620","volume":"18","author":"K. C. Kiwiel","year":"1988","unstructured":"K. C. Kiwiel, \u201cDescent methods for quasidifferentiable minimization,\u201d Applied Mathematics and Optimization, vol. 18, pp. 163-180, 1988.","journal-title":"Applied Mathematics and Optimization"},{"key":"190507_CR11","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1080\/02331939108843710","volume":"22","author":"L. Kuntz","year":"1991","unstructured":"L. Kuntz and A. Pielczyk, \u201cThe method of common descent for a certain class of quasidifferentiable functions,\u201d Optimization, vol. 22, pp. 669-679, 1991.","journal-title":"Optimization"},{"key":"190507_CR12","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00933357","volume":"34","author":"G. Papavassilopoulos","year":"1981","unstructured":"G. Papavassilopoulos, \u201cAlgorithms for a class of nondifferentiable problems,\u201d Journal of Optimization Theory and Applications, vol. 34 pp. 41-82, 1981.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"190507_CR13","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1007\/BF01584544","volume":"2","author":"O. Pironneau","year":"1972","unstructured":"O. Pironneau and E. Polak, \u201cOn the rate of convergence of certain methods of centers,\u201d Mathematical Programming, vol. 2, pp. 230-258, 1972.","journal-title":"Mathematical Programming"},{"key":"190507_CR14","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/978-1-4757-6019-4_20","volume-title":"Nonsmooth Optimization and Related Topics","author":"E. Polak","year":"1989","unstructured":"E. Polak, \u201cBasics of minimax algorithms,\u201d in Nonsmooth Optimization and Related Topics, Plenum Press: New York, pp. 343-367, 1989."},{"key":"190507_CR15","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1137\/0330032","volume":"30","author":"E. Polak","year":"1992","unstructured":"E. Polak and L. He, \u201cRate-preserving discretization strategies for semi-infinite programming and optimal control,\u201d SIAM Journal on Control and Optimization, vol. 30, pp. 548-572, 1992.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"190507_CR16","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF01585175","volume":"62","author":"E. Polak","year":"1993","unstructured":"E. Polak, \u201cOn the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems,\u201d Mathematical Programming, vol. 62, pp. 385-414, 1993.","journal-title":"Mathematical Programming"},{"key":"190507_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0663-7","volume-title":"Optimization: Algorithms and Consistent Approximations","author":"E. Polak","year":"1997","unstructured":"E. Polak, Optimization: Algorithms and Consistent Approximations, Springer: New York, 1997."},{"key":"190507_CR18","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1007\/BFb0121135","volume":"29","author":"L.N. Polyakova","year":"1986","unstructured":"L.N. Polyakova, \u201cOn the minimization of a quasidifferentiable function subject to equality-type quasidifferentiable constraints,\u201d Mathematical Programming Study, vol. 29, pp. 44-55, 1986.","journal-title":"Mathematical Programming Study"},{"key":"190507_CR19","volume-title":"Numerical Methods in Extremal Problems","author":"B. N. Pshenichnyi","year":"1975","unstructured":"B. N. Pshenichnyi and Yu. M. Danilin, Numerical Methods in Extremal Problems, Chislennye Metody v Ekstremal'nykh Zadachakh, Nauka, Moscow, 1975."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008660924636.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008660924636\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008660924636.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:34:04Z","timestamp":1752377644000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008660924636"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,4]]},"references-count":19,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,4]]}},"alternative-id":["190507"],"URL":"https:\/\/doi.org\/10.1023\/a:1008660924636","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[1999,4]]}}}