{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:39:55Z","timestamp":1740148795680,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T00:00:00Z","timestamp":1700611200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T00:00:00Z","timestamp":1700611200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003787","name":"Natural Science Foundation of Hebei Province","doi-asserted-by":"publisher","award":["A2022201002"],"award-info":[{"award-number":["A2022201002"]}],"id":[{"id":"10.13039\/501100003787","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100017696","name":"Hebei Province Graduate Innovation Funding Project","doi-asserted-by":"publisher","award":["CXZZSS2023008"],"award-info":[{"award-number":["CXZZSS2023008"]}],"id":[{"id":"10.13039\/501100017696","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s12190-023-01928-x","type":"journal-article","created":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T18:01:38Z","timestamp":1700676098000},"page":"4425-4450","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Modified gradient sampling algorithm for nonsmooth semi-infinite programming"],"prefix":"10.1007","volume":"69","author":[{"given":"Tianyou","family":"Shang","sequence":"first","affiliation":[]},{"given":"Ke","family":"Su","sequence":"additional","affiliation":[]},{"given":"Bing","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Yanshu","family":"Wei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,22]]},"reference":[{"key":"1928_CR1","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1287\/mnsc.9.2.209","volume":"9","author":"A Charnes","year":"1963","unstructured":"Charnes, A., Cooper, W.W., Kortanek, K.: Duality in semi-infinite programs and some works of Haar and Carath\u00e9odory. Manag. Sci. 9, 209\u2013228 (1963)","journal-title":"Manag. Sci."},{"key":"1928_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1002\/nav.3800160104","volume":"16","author":"A Charnes","year":"1969","unstructured":"Charnes, A., Cooper, W.W., Kortanek, K.O.: On the theory of semi-infinite programming and a generalization of the Kuhn\u2013Tucker saddle point theorem for arbitrary convex functions. Nav. Res. Log. 16, 41\u201352 (1969)","journal-title":"Nav. Res. Log."},{"key":"1928_CR3","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1073\/pnas.48.5.783","volume":"48","author":"A Charnes","year":"1962","unstructured":"Charnes, A., Cooper, W.W., Kortanek, K.: Duality, Haar programs, and finite sequence spaces. Proc. Natl. Acad. Sci. USA 48, 783\u2013786 (1962)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"1928_CR4","doi-asserted-by":"publisher","first-page":"2314","DOI":"10.1109\/78.852012","volume":"48","author":"HH Dam","year":"2000","unstructured":"Dam, H.H., Teo, K.L., Nordebo, S.: The dual parameterization approach to optimal least square FIR filter design subject to maximum error constraints. IEEE Trans. Signal Process. 48, 2314\u20132320 (2000)","journal-title":"IEEE Trans. Signal Process."},{"key":"1928_CR5","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1049\/ip-f-2.1990.0026","volume":"137","author":"Z Liu","year":"1990","unstructured":"Liu, Z., Gong, Y.H.: Semi-infinite quadratic optimisation method for the design of robust adaptive array processors. IEE Proc. F Radar Signal Process. IET Digit. Library 137, 177\u2013182 (1990)","journal-title":"IEE Proc. F Radar Signal Process. IET Digit. Library"},{"key":"1928_CR6","doi-asserted-by":"publisher","first-page":"1670","DOI":"10.1137\/130925013","volume":"24","author":"S Mehrotra","year":"2014","unstructured":"Mehrotra, S., Papp, D.: A cutting surface algorithm for semi-infinite convex programming with an application to moment robust optimization. Siam J. Optim. 24, 1670\u20131697 (2014)","journal-title":"Siam J. Optim."},{"key":"1928_CR7","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0165-1684(95)00077-Q","volume":"46","author":"A Potchinkov","year":"1995","unstructured":"Potchinkov, A., Reemtsen, R.: The design of FIR filters in the complex plane by convex optimization. Signal Process. 46, 127\u2013146 (1995)","journal-title":"Signal Process."},{"key":"1928_CR8","first-page":"1012","volume":"42","author":"M Zarepisheh","year":"2015","unstructured":"Zarepisheh, M., Li, R., Ye, Y.: Simultaneous beam sampling and aperture shape optimization for SPORT. Ann. Oper. Res. 42, 1012\u20131022 (2015)","journal-title":"Ann. Oper. Res."},{"key":"1928_CR9","volume-title":"Finite Element Approximation for Optimal Shape, Material, and Topology Design","author":"J Haslinger","year":"1996","unstructured":"Haslinger, J., Neittaanm\u00e4ki, P.: Finite Element Approximation for Optimal Shape, Material, and Topology Design. Wiley, Hoboken (1996)"},{"key":"1928_CR10","volume-title":"Nonsmooth Approach to Optimization Problems with Equilibrium Constraints: Theory, Applications and Numerical Results","author":"J Outrata","year":"2013","unstructured":"Outrata, J., Kocvara, M., Zowe, J.: Nonsmooth Approach to Optimization Problems with Equilibrium Constraints: Theory, Applications and Numerical Results. Springer, Berlin (2013)"},{"key":"1928_CR11","volume-title":"Nonsmooth Analysis and Control Theory","author":"FH Clarke","year":"2008","unstructured":"Clarke, F.H., Ledyaev, Y.S., Stern, R.J.: Nonsmooth Analysis and Control Theory. Springer, New York (2008)"},{"key":"1928_CR12","volume-title":"Nonconvex Optimization in Mechanics: Algorithms, Heuristics and Engineering Applications by the FEM","author":"ES Mistakidis","year":"2013","unstructured":"Mistakidis, E.S., Stavroulakis, G.E.: Nonconvex Optimization in Mechanics: Algorithms, Heuristics and Engineering Applications by the FEM. Springer, Berlin (2013)"},{"key":"1928_CR13","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1137\/090780201","volume":"22","author":"FE Curtis","year":"2012","unstructured":"Curtis, F.E., Overton, M.L.: A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization. Siam J. Optim. 22, 474\u2013500 (2012)","journal-title":"Siam J. Optim."},{"key":"1928_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11075-012-9692-5","volume":"65","author":"CM Tang","year":"2014","unstructured":"Tang, C.M., Liu, S., Jian, J.B.: A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization. Numer. Algorithms 65, 1\u201322 (2014)","journal-title":"Numer. Algorithms"},{"key":"1928_CR15","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10957-020-01740-8","volume":"187","author":"M Maleknia","year":"2020","unstructured":"Maleknia, M., Shamsi, M.: A gradient sampling method based on ideal direction for solving nonsmooth optimization problems. J. Optim. Theory Appl. 187, 181\u2013204 (2020)","journal-title":"J. Optim. Theory Appl."},{"key":"1928_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10898-020-00939-3","volume":"79","author":"MN Hoseini","year":"2021","unstructured":"Hoseini, M.N., Nobakhtian, S.: A filter proximal bundle method for nonsmooth nonconvex constrained optimization. J. Glob. Optim. 79, 1\u201337 (2021)","journal-title":"J. Glob. Optim."},{"key":"1928_CR17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971309","volume-title":"Optimization and Nonsmooth Analysis","author":"FH Clarke","year":"1990","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley, Hoboken (1990)"},{"key":"1928_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08114-4","volume-title":"Introduction to Nonsmooth Optimization","author":"A Bagirov","year":"2014","unstructured":"Bagirov, A., Karmitsa, N., Makela, M.M.: Introduction to Nonsmooth Optimization. Springer, Cham (2014)"},{"key":"1928_CR19","volume-title":"Variational Analysis","author":"TR Rockafellar","year":"2004","unstructured":"Rockafellar, T.R., Wets, R.: Variational Analysis. Springer, Berlin (2004)"},{"key":"1928_CR20","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10589-020-00170-6","volume":"76","author":"LP Pang","year":"2020","unstructured":"Pang, L.P., Wu, Q., Wang, J.H.: A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods. Comput. Optim. Appl. 76, 125\u2013153 (2020)","journal-title":"Comput. Optim. Appl."},{"key":"1928_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34910-3","volume-title":"Numerical Nonsmooth Optimization","author":"AM Bagirov","year":"2020","unstructured":"Bagirov, A.M., Gaudioso, M., Karmitsa, N.: Numerical Nonsmooth Optimization. Springer, Cham (2020)"},{"key":"1928_CR22","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1137\/030601296","volume":"15","author":"JV Burke","year":"2005","unstructured":"Burke, J.V., Lewis, A.S., Overton, M.L.: A robust gradient sampling algorithm for nonsmooth, nonconvex optimization. Siam J. Optim. 15, 751\u2013779 (2005)","journal-title":"Siam J. Optim."},{"key":"1928_CR23","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1137\/050639673","volume":"18","author":"KC Kiwiel","year":"2007","unstructured":"Kiwiel, K.C.: Convergence of the gradient sampling algorithm for nonsmooth nonconvex optimization. Siam J. Optim. 18, 379\u2013388 (2007)","journal-title":"Siam J. Optim."},{"key":"1928_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0074500","volume-title":"Methods of Descent for Nondifferentiable Optimization","author":"KC Kiwiel","year":"1985","unstructured":"Kiwiel, K.C.: Methods of Descent for Nondifferentiable Optimization. Springer, Berlin (1985)"},{"key":"1928_CR25","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1137\/0803047","volume":"3","author":"KO Kortanek","year":"1993","unstructured":"Kortanek, K.O., No, H.: A central cutting plane algorithm for convex semi-infinite programming problems. Siam J. Optim. 3, 901\u2013918 (1993)","journal-title":"Siam J. Optim."},{"key":"1928_CR26","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s10589-015-9810-0","volume":"64","author":"LP Pang","year":"2016","unstructured":"Pang, L.P., Lv, J., Wang, J.H.: Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems. Comput. Optim. Appl. 64, 433\u2013465 (2016)","journal-title":"Comput. Optim. Appl."},{"key":"1928_CR27","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1023\/B:ANOR.0000004764.76984.30","volume":"124","author":"S \u017dakovi\u0107","year":"2003","unstructured":"\u017dakovi\u0107, S., Rustem, B.: Semi-infinite programming and applications to minimax problems. Ann. Oper. Res. 124, 81\u2013110 (2003)","journal-title":"Ann. Oper. Res."},{"key":"1928_CR28","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF01204183","volume":"29","author":"ND Botkin","year":"1994","unstructured":"Botkin, N.D., Turova-Botkina, V.L.: An algorithm for finding the Chebyshev center of a convex polyhedron. Appl. Math. Optim. 29, 211\u2013222 (1994)","journal-title":"Appl. Math. Optim."},{"key":"1928_CR29","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/040603875","volume":"16","author":"C Sagastiz\u00e1bal","year":"2005","unstructured":"Sagastiz\u00e1bal, C., Solodov, M.: An infeasible bundle method for nonsmooth convex constrained optimization without a penalty function or a filter. Siam J. Optim. 16, 146\u2013169 (2005)","journal-title":"Siam J. Optim."},{"key":"1928_CR30","unstructured":"Djelassi, H., Stein, O., Mitsos, A.: Discretization-based algorithms for the global solution of hierarchical programs. Lehrstuhl f\u00fcr Systemverfahrenstechnik (2020)"}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01928-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-023-01928-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01928-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T13:25:04Z","timestamp":1703165104000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-023-01928-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,22]]},"references-count":30,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["1928"],"URL":"https:\/\/doi.org\/10.1007\/s12190-023-01928-x","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"type":"print","value":"1598-5865"},{"type":"electronic","value":"1865-2085"}],"subject":[],"published":{"date-parts":[[2023,11,22]]},"assertion":[{"value":"13 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 November 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}