{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T16:38:19Z","timestamp":1720197499230},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,7,24]],"date-time":"2021-07-24T00:00:00Z","timestamp":1627084800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,24]],"date-time":"2021-07-24T00:00:00Z","timestamp":1627084800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Australian Research Council's Discovery Project","award":["DP190100580"]},{"DOI":"10.13039\/501100003967","name":"Iran's National Elites Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003967","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s10589-021-00304-4","type":"journal-article","created":{"date-parts":[[2021,7,24]],"date-time":"2021-07-24T19:04:00Z","timestamp":1627153440000},"page":"411-438","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An augmented subgradient method for minimizing nonsmooth DC functions"],"prefix":"10.1007","volume":"80","author":[{"given":"A. M.","family":"Bagirov","sequence":"first","affiliation":[]},{"given":"N.","family":"Hoseini Monjezi","sequence":"additional","affiliation":[]},{"given":"S.","family":"Taheri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,24]]},"reference":[{"issue":"2","key":"304_CR1","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s10013-020-00400-8","volume":"48","author":"FJA Artacho","year":"2020","unstructured":"Artacho, F.J.A., Campoy, R., Vuong, P.T.: Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm. Vietnam J. Math. 48(2), 363\u2013376 (2020)","journal-title":"Vietnam J. Math."},{"key":"304_CR2","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10107-017-1180-1","volume":"169","author":"FJA Artacho","year":"2018","unstructured":"Artacho, F.J.A., Fleming, R.M.T., Vuong, P.T.: Accelerating the DC algorithm for smooth functions. Math. Program. 169, 95\u2013118 (2018)","journal-title":"Math. Program."},{"issue":"1","key":"304_CR3","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1137\/18M123339X","volume":"30","author":"FJA Artacho","year":"2020","unstructured":"Artacho, F.J.A., Vuong, P.T.: The boosted difference of convex functions algorithm for nonsmooth functions. SIAM J. Optim. 30(1), 980\u20131006 (2020)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"304_CR4","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s10898-011-9765-3","volume":"52","author":"LTH An","year":"2012","unstructured":"An, L.T.H., Tao, P.D., Ngai, H.V.: Exact penalty and error bounds in DC programming. J. Glob. Optim. 52(3), 509\u2013535 (2012)","journal-title":"J. Glob. Optim."},{"key":"304_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"LTH An","year":"2005","unstructured":"An, L.T.H., Tao, P.D.: The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann. Oper. Res. 133, 23\u201346 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"304_CR6","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/s10898-010-9558-0","volume":"48","author":"A Astorino","year":"2010","unstructured":"Astorino, A., Fuduli, A., Gaudioso, M.: DC models for spherical separation. J. Glob. Optim. 48(4), 657\u2013669 (2010)","journal-title":"J. Glob. Optim."},{"key":"304_CR7","volume-title":"Numerical Nonsmooth Optimization: State of the Art Algorithms","year":"2020","unstructured":"Bagirov, A.M., Gaudioso, M., Karmitsa, N., M\u00e4kel\u00e4, M.M., Taheri, S. (eds.): Numerical Nonsmooth Optimization: State of the Art Algorithms. Springer, Berlin (2020)"},{"key":"304_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08114-4","volume-title":"Introduction to Nonsmooth Optimization: Theory, Practice and Software","author":"AM Bagirov","year":"2014","unstructured":"Bagirov, A.M., Karmitsa, N., M\u00e4kel\u00e4, M.M.: Introduction to Nonsmooth Optimization: Theory, Practice and Software. Springer, New York (2014)"},{"issue":"1","key":"304_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s11590-020-01586-z","volume":"15","author":"AM Bagirov","year":"2020","unstructured":"Bagirov, A.M., Taheri, S., Joki, K., Karmitsa, N., M\u00e4kel\u00e4, M.M.: Aggregate subgradient method for nonsmooth DC optimization. Optim. Lett. 15(1), 83\u201396 (2020)","journal-title":"Optim. Lett."},{"key":"304_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2020.113323","volume":"389","author":"AM Bagirov","year":"2021","unstructured":"Bagirov, A.M., Taheri, S., Cimen, E.: Incremental DC optimization algorithm for large-scale clusterwise linear regression. J. Comput. Appl. Math. 389, 113323 (2021)","journal-title":"J. Comput. Appl. Math."},{"key":"304_CR11","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.patcog.2015.11.011","volume":"53","author":"AM Bagirov","year":"2016","unstructured":"Bagirov, A.M., Taheri, S., Ugon, J.: Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems. Pattern Recognit. 53, 12\u201324 (2016)","journal-title":"Pattern Recognit."},{"issue":"1","key":"304_CR12","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1080\/10556788.2017.1371717","volume":"33","author":"AM Bagirov","year":"2018","unstructured":"Bagirov, A.M., Ugon, J.: Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms. Optim. Methods Softw. 33(1), 194\u2013219 (2018)","journal-title":"Optim. Methods Softw."},{"key":"304_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10898-010-9569-x","volume":"50","author":"AM Bagirov","year":"2011","unstructured":"Bagirov, A.M., Ugon, J.: Codifferential method for minimizing nonsmooth DC functions. J. Glob. Optim. 50, 3\u201322 (2011)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"304_CR14","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(3), 751\u2013779 (2005)","journal-title":"SIAM J. Optim."},{"key":"304_CR15","volume-title":"Constructive Nonsmooth Analysis","author":"VF Demyanov","year":"1995","unstructured":"Demyanov, V.F., Rubinov, A.M.: Constructive Nonsmooth Analysis. Peter Lang, Frankfurt a. M. (1995)"},{"issue":"2","key":"304_CR16","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED 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."},{"key":"304_CR17","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s10898-019-00755-4","volume":"75","author":"W de Oliveira","year":"2019","unstructured":"de Oliveira, W.: Proximal bundle methods for nonsmooth DC programming. J. Glob. Optim. 75, 523\u2013563 (2019)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"304_CR18","doi-asserted-by":"publisher","first-page":"936","DOI":"10.1007\/s10957-020-01721-x","volume":"186","author":"W de Oliveira","year":"2020","unstructured":"de Oliveira, W.: Sequential difference-of-convex programming. J. Optim. Theory Appl. 186(3), 936\u2013959 (2020)","journal-title":"J. Optim. Theory Appl."},{"key":"304_CR19","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/s11228-020-00566-w","volume":"28","author":"W de Oliveira","year":"2020","unstructured":"de Oliveira, W.: The ABC of DC programming. Set-Valued Var. Anal. 28, 679\u2013706 (2020)","journal-title":"Set-Valued Var. Anal."},{"key":"304_CR20","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1007\/s11228-018-0497-0","volume":"27","author":"W de Oliveira","year":"2019","unstructured":"de Oliveira, W., Tcheou, M.P.: An inertial algorithm for DC programming. Set-Valued Var. Anal. 27, 895\u2013919 (2019)","journal-title":"Set-Valued Var. Anal."},{"key":"304_CR21","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1016\/0305-0548(96)00006-8","volume":"21","author":"A Frangioni","year":"1996","unstructured":"Frangioni, A.: Solving semidefinite quadratic problems within nonsmooth optimization algorithms. Comput. Oper. Res. 21, 1099\u20131118 (1996)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"304_CR22","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10898-017-0568-z","volume":"71","author":"M Gaudioso","year":"2018","unstructured":"Gaudioso, M., Giallombardo, G., Miglionico, G., Bagirov, A.M.: Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations. J. Glob. Optim. 71(1), 37\u201355 (2018)","journal-title":"J. Glob. Optim."},{"key":"304_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1021765131316","volume":"103","author":"R Horst","year":"1999","unstructured":"Horst, R., Thoai, N.V.: DC programming: overview. J. Optim. Theory Appl. 103, 1\u201343 (1999)","journal-title":"J. Optim. Theory Appl."},{"key":"304_CR24","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10898-016-0488-3","volume":"68","author":"K Joki","year":"2017","unstructured":"Joki, K., Bagirov, A.M., Karmitsa, N., M\u00e4kel\u00e4, M.M.: A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes. J. Glob. Optim. 68, 501\u2013535 (2017)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"304_CR25","doi-asserted-by":"publisher","first-page":"1892","DOI":"10.1137\/16M1115733","volume":"28","author":"K Joki","year":"2018","unstructured":"Joki, K., Bagirov, A.M., Karmitsa, N., M\u00e4kel\u00e4, M.M., Taheri, S.: Double bundle method for finding Clarke stationary points in nonsmooth DC programming. SIAM J. Optim. 28(2), 1892\u20131919 (2018)","journal-title":"SIAM J. Optim."},{"key":"304_CR26","doi-asserted-by":"crossref","unstructured":"Joki, K., Bagirov, A.M., Karmitsa, N., M\u00e4kel\u00e4, M.M., Taheri, S.: Double bundle method for finding Clarke stationary points in nonsmooth DC optimization. Technical reports 1173, Turku Center for Computer Science (TUCS), Turku (2017)","DOI":"10.1137\/16M1115733"},{"key":"304_CR27","doi-asserted-by":"crossref","unstructured":"Khalaf, W., Astorino, A., D\u2019Alessandro, P., Gaudioso, M.: A DC optimization-based clustering technique for edge detection. Optim. Lett. 11(3), 627\u2013640 (2017)","DOI":"10.1007\/s11590-016-1031-7"},{"issue":"1\u20132","key":"304_CR28","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10107-012-0514-2","volume":"141","author":"AS Lewis","year":"2013","unstructured":"Lewis, A.S., Overton, M.L.: Nonsmooth optimization via quasi-Newton methods. Math. Program. 141(1\u20132), 135\u2013163 (2013)","journal-title":"Math. Program."},{"issue":"6","key":"304_CR29","first-page":"445","volume":"20","author":"L Luksan","year":"1984","unstructured":"Luksan, L.: Dual method for solving a special problem of quadratic programming as a subproblem at linearly constrained nonlinear minimax approximation. Kybernetika 20(6), 445\u2013457 (1984)","journal-title":"Kybernetika"},{"key":"304_CR30","unstructured":"M\u00e4kel\u00e4, M.M.: Multiobjective proximal bundle method for nonconvex nonsmooth optimization: Fortran subroutine MPBNGC 2.0. Reports of the Department of Mathematical Information Technology, Series B. Scientific Computing B 13\/2003, University of Jyv\u00e4skyl\u00e4, Jyv\u00e4skyl\u00e4 (2003)"},{"key":"304_CR31","doi-asserted-by":"publisher","DOI":"10.1142\/1493","volume-title":"Nonsmooth Optimization: Analysis and Algorithms with Applications to Optimal Control","author":"MM 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 Publishing Co., Singapore (1992)"},{"key":"304_CR32","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10898-014-0171-5","volume":"61","author":"B Ordin","year":"2015","unstructured":"Ordin, B., Bagirov, A.M.: A heuristic algorithm for solving the minimum sum-of-squares clustering problems. J. Glob. Optim. 61, 341\u2013361 (2015)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"304_CR33","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1287\/moor.2016.0795","volume":"42","author":"JS Pang","year":"2017","unstructured":"Pang, J.S., Razaviyayn, M., Alvarado, A.: Computing B-stationary points of nonsmooth DC programs. Math. Oper. Res. 42(1), 95\u2013118 (2017)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"304_CR34","first-page":"451","volume":"21","author":"WY Sun","year":"2003","unstructured":"Sun, W.Y., Sampaio, R.J.B., Candido, M.A.B.: Proximal point algorithm for minimization of DC functions. J. Comput. Math. 21(4), 451\u2013462 (2003)","journal-title":"J. Comput. Math."},{"key":"304_CR35","doi-asserted-by":"crossref","unstructured":"Tao, P.D., Souad, E.B.: Algorithms for solving a class of nonconvex optimization problems: methods of subgradient. North-Holland Mathematics Studies. Fermat Days 85: Mathematics for Optimization. 129, 249\u2013271 (1986)","DOI":"10.1016\/S0304-0208(08)72402-2"},{"key":"304_CR36","doi-asserted-by":"publisher","first-page":"177","DOI":"10.24033\/msmf.269","volume":"60","author":"JF Toland","year":"1979","unstructured":"Toland, J.F.: On subdifferential calculus and duality in nonconvex optimization. Bull. Soc. Math. France M\u00e9moire. 60, 177\u2013183 (1979)","journal-title":"Bull. Soc. Math. France M\u00e9moire."},{"key":"304_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2809-5","volume-title":"Convex Analysis and Global Optimization","author":"H Tuy","year":"1998","unstructured":"Tuy, H.: Convex Analysis and Global Optimization. Kluwer, Dordrecht (1998)"},{"key":"304_CR38","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10957-019-01500-3","volume":"182","author":"W van Ackooij","year":"2019","unstructured":"van Ackooij, W., de Oliveira, W.: Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions. J. Optim. Theory Appl. 182, 49\u201380 (2019)","journal-title":"J. Optim. Theory Appl."},{"key":"304_CR39","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/BF01580381","volume":"11","author":"P Wolfe","year":"1976","unstructured":"Wolfe, P.: Finding the nearest point in a polytope. Math. Program. 11, 128\u2013149 (1976)","journal-title":"Math. Program."},{"key":"304_CR40","doi-asserted-by":"crossref","unstructured":"Zaffaroni, A.: Continuous approximations, codifferentiable functions and minimization methods. In: Demyanov, V.F., Rubinov, A.M. (eds.) Nonconvex Optimization and Its Applications, pp. 361\u2013391. Kluwer Academic Publishers, Dordrecht, Quasidifferentiability and Related Topics (2000)","DOI":"10.1007\/978-1-4757-3137-8_14"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00304-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-021-00304-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00304-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,5]],"date-time":"2023-01-05T11:50:55Z","timestamp":1672919455000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-021-00304-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,24]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["304"],"URL":"https:\/\/doi.org\/10.1007\/s10589-021-00304-4","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,24]]},"assertion":[{"value":"10 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 July 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 July 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}