{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T18:00:56Z","timestamp":1778608856331,"version":"3.51.4"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T00:00:00Z","timestamp":1346457600000},"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":[[2013,5]]},"DOI":"10.1007\/s10957-012-0167-6","type":"journal-article","created":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T18:37:01Z","timestamp":1346524621000},"page":"416-435","source":"Crossref","is-referenced-by-count":30,"title":["Subgradient Method for Nonconvex Nonsmooth Optimization"],"prefix":"10.1007","volume":"157","author":[{"given":"A. M.","family":"Bagirov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Karmitsa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Al\u00a0Nuaimat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Sultanova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,9,1]]},"reference":[{"key":"167_CR1","volume-title":"Nonlinear Programming","author":"D.P. Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, New York (1999)"},{"key":"167_CR2","volume-title":"Introduction to Optimization","author":"B.T. Polyak","year":"1987","unstructured":"Polyak, B.T.: Introduction to Optimization. Optimization Software, New York (1987)"},{"key":"167_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-82118-9","volume-title":"Minimization Methods for Non-differentiable Functions","author":"N.Z. Shor","year":"1985","unstructured":"Shor, N.Z.: Minimization Methods for Non-differentiable Functions. Springer, Berlin (1985)"},{"issue":"1","key":"167_CR4","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s10107-007-0148-y","volume":"120","author":"K.M. Anstreicher","year":"2009","unstructured":"Anstreicher, K.M., Wolsey, L.A.: Two \u201cwell-known\u201d properties of subgradient optimization. Math. Program. 120(1), 213\u2013220 (2009)","journal-title":"Math. Program."},{"issue":"1","key":"167_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10957-004-1708-4","volume":"125","author":"C. Beltran","year":"2005","unstructured":"Beltran, C., Heredia, F.J.: An effective line search for the subgradient method. J. Optim. Theory Appl. 125(1), 1\u201318 (2005)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"167_CR6","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s10957-009-9522-7","volume":"142","author":"A. Nedi\u0107","year":"2009","unstructured":"Nedi\u0107, A., Ozdaglar, A.: Subgradient methods for saddle-point problems. J. Optim. Theory Appl. 142(1), 205\u2013228 (2009)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"167_CR7","doi-asserted-by":"crossref","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A. Nemirovski","year":"2009","unstructured":"Nemirovski, A., Juditsky, A., Lan, G., Shapiro, A.: Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19(4), 1574\u20131609 (2009)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"167_CR8","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10107-007-0149-x","volume":"120","author":"Y. Nesterov","year":"2009","unstructured":"Nesterov, Y.: Primal-dual subgradient methods for convex problems. Math. Program. 120(1), 221\u2013259 (2009)","journal-title":"Math. Program."},{"issue":"1","key":"167_CR9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1080\/10556780903151565","volume":"25","author":"A.M. Bagirov","year":"2010","unstructured":"Bagirov, A.M., Ganjehlou, A.N.: A quasisecant method for minimizing nonsmooth functions. Optim. Methods Softw. 25(1), 3\u201318 (2010)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"167_CR10","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/s10957-007-9335-5","volume":"137","author":"A.M. Bagirov","year":"2008","unstructured":"Bagirov, A.M., Karas\u00f6zen, B., Sezer, M.: Discrete gradient method: Derivative-free method for nonsmooth optimization. J. Optim. Theory Appl. 137(2), 317\u2013334 (2008)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"167_CR11","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1080\/10556780410001648112","volume":"19","author":"A. Fuduli","year":"2004","unstructured":"Fuduli, A., Gaudioso, M., Giallombardo, G.: A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization. Optim. Methods Softw. 19(1), 89\u2013102 (2004)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"167_CR12","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1137\/S1052623402411459","volume":"14","author":"A. Fuduli","year":"2004","unstructured":"Fuduli, A., Gaudioso, M., Giallombardo, G.: Minimizing nonconvex nonsmooth functions via cutting planes and proximity control. SIAM J. Optim. 14(3), 743\u2013756 (2004)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"167_CR13","doi-asserted-by":"crossref","first-page":"2442","DOI":"10.1137\/090754595","volume":"20","author":"W. Hare","year":"2010","unstructured":"Hare, W., Sagastiz\u00e1bal, C.: A redistributed proximal bundle method for nonconvex optimization. SIAM J. Optim. 20(5), 2442\u20132473 (2010)","journal-title":"SIAM J. Optim."},{"key":"167_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0074500","volume-title":"Methods of Descent for Nondifferentiable Optimization","author":"K.C. Kiwiel","year":"1985","unstructured":"Kiwiel, K.C.: Methods of Descent for Nondifferentiable Optimization. Springer, Berlin (1985)"},{"key":"167_CR15","doi-asserted-by":"crossref","DOI":"10.1142\/1493","volume-title":"Nonsmooth Optimization: Analysis and Algorithms with Applications to Optimal Control","author":"M.M. M\u00e4kel\u00e4","year":"1992","unstructured":"M\u00e4kel\u00e4, M.M., Neittaanm\u00e4ki, P.: Nonsmooth Optimization: Analysis and Algorithms with Applications to Optimal Control. World Scientific, Singapore (1992)"},{"issue":"2","key":"167_CR16","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1137\/S1052623496303329","volume":"8","author":"R. Mifflin","year":"1998","unstructured":"Mifflin, R., Sun, D., Qi, L.: Quasi-Newton bundle-type methods for nondifferentiable convex optimization. SIAM J. Optim. 8(2), 583\u2013603 (1998)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"167_CR17","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1080\/10556780410001689225","volume":"19","author":"M. Haarala","year":"2004","unstructured":"Haarala, M., Miettinen, K., M\u00e4kel\u00e4, M.M.: New limited memory bundle method for large-scale nonsmooth optimization. Optim. Methods Softw. 19(6), 673\u2013692 (2004)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"167_CR18","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10107-006-0728-2","volume":"109","author":"N. Haarala","year":"2007","unstructured":"Haarala, N., Miettinen, K., M\u00e4kel\u00e4, M.M.: Globally convergent limited memory bundle method for large-scale nonsmooth optimization. Math. Program. 109(1), 181\u2013205 (2007)","journal-title":"Math. Program."},{"issue":"1","key":"167_CR19","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02680566","volume":"83","author":"L. Luk\u0161an","year":"1998","unstructured":"Luk\u0161an, L., Vl\u010dek, J.: A bundle-Newton method for nonsmooth unconstrained minimization. Math. Program. 83(1), 373\u2013391 (1998)","journal-title":"Math. Program."},{"issue":"2","key":"167_CR20","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s00186-007-0186-5","volume":"67","author":"A. Bagirov","year":"2008","unstructured":"Bagirov, A., Ganjehlou, A.N.: An approximate subgradient algorithm for unconstrained nonsmooth, onconvex optimization. Math. Methods Oper. Res. 67(2), 187\u2013206 (2008)","journal-title":"Math. Methods Oper. Res."},{"issue":"5","key":"167_CR21","first-page":"621","volume":"17","author":"A. Bagirov","year":"2010","unstructured":"Bagirov, A., Ganjehlou, A.N., Ugon, J., Tor, A.H.: A generalized subgradient method with piecewise linear subproblem. Dyn. Contin. Discrete Impuls. Syst. (B) 17(5), 621\u2013638 (2010)","journal-title":"Dyn. Contin. Discrete Impuls. Syst. (B)"},{"key":"167_CR22","volume-title":"Optimization and Nonsmooth Analysis","author":"F.H. Clarke","year":"1983","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley, New York (1983)"},{"key":"167_CR23","volume-title":"Constructive Nonsmooth Analysis","author":"V.F. Demyanov","year":"1995","unstructured":"Demyanov, V.F., Rubinov, A.M.: Constructive Nonsmooth Analysis. Peter Lang, Frankfurt am Main (1995)"},{"key":"167_CR24","unstructured":"Luk\u0161an, L., Vl\u010dek, J.: Test problems for nonsmooth unconstrained and linearly constrained optimization. Technical report no. 798, Institute of Computer Science, Academy of Sciences of the Czech Republic (2000)"},{"issue":"2","key":"167_CR25","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1145\/383738.383740","volume":"27","author":"L. Luk\u0161an","year":"2001","unstructured":"Luk\u0161an, L., Vl\u010dek, J.: Algorithm 811: NDA: algorithms for nondifferentiable optimization. ACM Trans. Math. Softw. 27(2), 193\u2013213 (2001)","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"167_CR26","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E.D. Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-012-0167-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-012-0167-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-012-0167-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:55:19Z","timestamp":1559469319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-012-0167-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,1]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["167"],"URL":"https:\/\/doi.org\/10.1007\/s10957-012-0167-6","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,1]]}}}