{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T12:47:52Z","timestamp":1769086072804,"version":"3.49.0"},"reference-count":146,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T00:00:00Z","timestamp":1575590400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T00:00:00Z","timestamp":1575590400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s10288-019-00425-x","type":"journal-article","created":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T12:08:57Z","timestamp":1575634137000},"page":"1-47","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Essentials of numerical nonsmooth optimization"],"prefix":"10.1007","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3022-7041","authenticated-orcid":false,"given":"Manlio","family":"Gaudioso","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3714-197X","authenticated-orcid":false,"given":"Giovanni","family":"Giallombardo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6304-5877","authenticated-orcid":false,"given":"Giovanna","family":"Miglionico","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,6]]},"reference":[{"key":"425_CR1","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1007\/s10957-014-0534-6","volume":"164","author":"Z Akbari","year":"2014","unstructured":"Akbari Z, Yousefpour R, Peyghami MR (2014) A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems. J Optim Theory Appl 164:733\u2013754","journal-title":"J Optim Theory Appl"},{"key":"425_CR2","first-page":"23","volume":"133","author":"LTH An","year":"2005","unstructured":"An LTH, Tao PD (2005) The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. J Global Optim 133:23\u201346","journal-title":"J Global Optim"},{"key":"425_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2140\/pjm.1966.16.1","volume":"16","author":"L Armijo","year":"1966","unstructured":"Armijo L (1966) Minimization of functions having Lipschitz continuous first partial derivatives. Pac J Math 16:1\u20133","journal-title":"Pac J Math"},{"key":"425_CR4","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s11590-014-0778-y","volume":"10","author":"A Astorino","year":"2016","unstructured":"Astorino A, Miglionico G (2016) Optimizing sensor cover energy via DC programming. Optim Lett 10:355\u2013368","journal-title":"Optim Lett"},{"key":"425_CR5","doi-asserted-by":"crossref","first-page":"1418","DOI":"10.1137\/100817930","volume":"21","author":"A Astorino","year":"2011","unstructured":"Astorino A, Frangioni A, Gaudioso M, Gorgone E (2011) Piecewise quadratic approximations in convex numerical optimization. SIAM J Optim 21:1418\u20131438","journal-title":"SIAM J Optim"},{"key":"425_CR6","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1007\/s11075-017-0280-6","volume":"76","author":"A Astorino","year":"2017","unstructured":"Astorino A, Gaudioso M, Gorgone E (2017) A method for convex minimization based on translated first-order approximations. Numer Algorithms 76:745\u2013760","journal-title":"Numer Algorithms"},{"key":"425_CR7","doi-asserted-by":"crossref","first-page":"2662","DOI":"10.1109\/TNNLS.2018.2885852","volume":"30","author":"A Astorino","year":"2019","unstructured":"Astorino A, Fuduli A, Gaudioso M (2019) A Lagrangian relaxation approach for binary multiple instance classification. IEEE Trans Neural Netw Learn Syst 30:2662\u20132671","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"425_CR8","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/s10957-007-9335-5","volume":"137","author":"AM Bagirov","year":"2008","unstructured":"Bagirov AM, Karas\u00f6zen B, Sezer M (2008) Discrete gradient method: derivative-free method for nonsmooth optimization. J Optim Theory Appl 137:317\u2013334","journal-title":"J Optim Theory Appl"},{"key":"425_CR9","doi-asserted-by":"crossref","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 AM, Karmitsa N, M\u00e4kel\u00e4 MM (2014) Introduction to nonsmooth optimization: theory, practice and software. Springer, Berlin"},{"key":"425_CR10","volume-title":"Numerical nonsmooth optimization\u2014state of the art algorithms","year":"2019","unstructured":"Bagirov AM, Gaudioso M, Karmitsa N, M\u00e4kel\u00e4 MM, Taheri S (eds) (2019) Numerical nonsmooth optimization\u2014state of the art algorithms. Springer, Berlin (to appear)"},{"key":"425_CR11","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s10107-002-0357-3","volume":"94","author":"L Bahiense","year":"2002","unstructured":"Bahiense L, Maculan N, Sagastiz\u00e1bal C (2002) The volume algorithm revisited: relation with bundle methods. Math Program 94:41\u201369","journal-title":"Math Program"},{"key":"425_CR12","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s101070050002","volume":"87","author":"F Barahona","year":"2000","unstructured":"Barahona F, Anbil R (2000) The volume algorithm: producing primal solutions with a subgradient method. Math Program 87:385\u2013399","journal-title":"Math Program"},{"key":"425_CR13","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai J, Borwein JM (1988) Two-point step size gradient methods. IMA J Numer Anal 8:141\u2013148","journal-title":"IMA J Numer Anal"},{"key":"425_CR14","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0167-6377(02)00231-6","volume":"31","author":"A Beck","year":"2003","unstructured":"Beck A, Teboulle M (2003) Mirror descent and nonlinear projected subgradient methods for convex optimization. Oper Res Lett 31:167\u2013175","journal-title":"Oper Res Lett"},{"key":"425_CR15","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on modern optimization, MPS\/SIAM series on optimization","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal A, Nemirovski A (2001) Lectures on modern optimization, MPS\/SIAM series on optimization. SIAM, Philadelphia"},{"key":"425_CR16","volume-title":"Nonlinear programming","author":"DP Bertsekas","year":"1995","unstructured":"Bertsekas DP (1995) Nonlinear programming. Athena Scientific, Belmont"},{"key":"425_CR17","volume-title":"Convex optimization theory","author":"DP Bertsekas","year":"2009","unstructured":"Bertsekas DP (2009) Convex optimization theory. Athena Scientific, Belmont"},{"key":"425_CR18","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1137\/0311049","volume":"11","author":"DP Bertsekas","year":"1973","unstructured":"Bertsekas DP, Mitter SK (1973) A descent numerical method for optimization problems with nondifferentiable cost functionals. SIAM J Control 11:637\u2013652","journal-title":"SIAM J Control"},{"key":"425_CR19","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1145\/1008731.1008733","volume":"51","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas D, Vempala S (2004) Solving convex programs by random walks. J ACM 51:540\u2013556","journal-title":"J ACM"},{"key":"425_CR20","first-page":"15","volume":"68","author":"J Bonnans","year":"1995","unstructured":"Bonnans J, Gilbert J, Lemar\u00e9chal C, Sagastiz\u00e1bal C (1995) A family of variable metric proximal methods. Math Program 68:15\u201347","journal-title":"Math Program"},{"key":"425_CR21","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0167-6377(94)00056-C","volume":"17","author":"U Br\u00e4nnlund","year":"1995","unstructured":"Br\u00e4nnlund U, Kiwiel KC, Lindberg PO (1995) A descent proximal level bundle method for convex nondifferentiable optimization. Oper Res Lett 17:121\u2013126","journal-title":"Oper Res Lett"},{"key":"425_CR22","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1137\/030601296","volume":"15","author":"JV Burke","year":"2005","unstructured":"Burke JV, Lewis AS, Overton ML (2005) A robust gradient sampling algorithm for nonsmooth, nonconvex optimization. SIAM J Optim 15:751\u2013779","journal-title":"SIAM J Optim"},{"key":"425_CR23","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1093\/imanum\/drn008","volume":"28","author":"JV Burke","year":"2008","unstructured":"Burke JV, Lewis AS, Overton ML (2008) The speed of Shor\u2019s R-algorithm. IMA J Numer Anal 28:711\u2013720","journal-title":"IMA J Numer Anal"},{"key":"425_CR24","volume-title":"Numerical nonsmooth optimization\u2014state of the art algorithms","author":"JV Burke","year":"2019","unstructured":"Burke JV, Curtis FE, Lewis AS, Overton ML, Sim\u00f5es LEA (2019) Gradient sampling methods for nonsmooth optimization. In: Bagirov AM, Gaudioso M, Karmitsa N, M\u00e4kel\u00e4 M, Taheri S (eds) Numerical nonsmooth optimization\u2014state of the art algorithms. Springer, Berlin (to appear)"},{"key":"425_CR25","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01582063","volume":"63","author":"RH Byrd","year":"1994","unstructured":"Byrd RH, Nocedal J, Schnabel RB (1994) Representations of quasi-Newton matrices and their use in limited memory methods. Math Program 63:129\u2013156","journal-title":"Math Program"},{"key":"425_CR26","first-page":"273","volume-title":"Sur les questions de minima qui se rattachent a la repr\u00e9sentation approximative des fonctions, 1859, in Oeuvres de P. L. Tchebychef","author":"PL Chebysh\u00ebv","year":"1961","unstructured":"Chebysh\u00ebv PL (1961) Sur les questions de minima qui se rattachent a la repr\u00e9sentation approximative des fonctions, 1859, in Oeuvres de P. L. Tchebychef, vol 1. Chelsea, New York, pp 273\u2013378"},{"key":"425_CR27","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/s101070050059","volume":"85","author":"X Chen","year":"1999","unstructured":"Chen X, Fukushima M (1999) Proximal quasi-Newton methods for nondifferentiable convex optimization. Math Program 85:313\u2013334","journal-title":"Math Program"},{"key":"425_CR28","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF01386389","volume":"1","author":"EW Cheney","year":"1959","unstructured":"Cheney EW, Goldstein AA (1959) Newton\u2019s method for convex programming and Tchebycheff approximation. Numer Math 1:253\u2013268","journal-title":"Numer Math"},{"key":"425_CR29","first-page":"357","volume-title":"Optimization and nonsmooth analysis","author":"FH Clarke","year":"1983","unstructured":"Clarke FH (1983) Optimization and nonsmooth analysis. Wiley, Hoboken, pp 357\u2013386"},{"key":"425_CR30","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1137\/080718814","volume":"20","author":"G D\u2019Antonio","year":"2009","unstructured":"D\u2019Antonio G, Frangioni A (2009) Convergence analysis of deflected conditional approximate subgradient methods. SIAM J Optim 20:357\u2013386","journal-title":"SIAM J Optim"},{"key":"425_CR31","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/BF01840456","volume":"1","author":"G de Ghellinck","year":"1986","unstructured":"de Ghellinck G, Vial J-P (1986) A polynomial Newton method for linear programming. Algorithmica 1:425\u2013453","journal-title":"Algorithmica"},{"key":"425_CR32","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s10898-019-00755-4","volume":"75","author":"W de Oliveira","year":"2019","unstructured":"de Oliveira W (2019) Proximal bundle methods for nonsmooth DC programming. J Global Optim 75:523\u2013563","journal-title":"J Global Optim"},{"key":"425_CR33","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-015-0873-6","volume":"156","author":"W de Oliveira","year":"2016","unstructured":"de Oliveira W, Solodov M (2016) A doubly stabilized bundle method for nonsmooth convex optimization. Math Program 156:125\u2013159","journal-title":"Math Program"},{"key":"425_CR34","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s10107-014-0809-6","volume":"148","author":"W de Oliveira","year":"2014","unstructured":"de Oliveira W, Sagastiz\u00e1bal C, Lemar\u00e9chal C (2014) Convex proximal bundle methods in depth: a unified analysis for inexact oracles. Math Program 148:241\u2013277","journal-title":"Math Program"},{"key":"425_CR35","volume-title":"Introduction to minimax","author":"VF Demyanov","year":"1974","unstructured":"Demyanov VF, Malozemov VN (1974) Introduction to minimax. Wiley, New York"},{"key":"425_CR36","volume-title":"Constructive nonsmooth analysis","author":"VF Demyanov","year":"1995","unstructured":"Demyanov VF, Rubinov AM (1995) Constructive nonsmooth analysis. Verlag Peter Lang, Berlin"},{"key":"425_CR37","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1080\/1055678021000060810","volume":"17","author":"AV Demyanov","year":"2002","unstructured":"Demyanov AV, Demyanov VF, Malozemov VN (2002) Minmaxmin problems revisited. Optim Methods Softw 17:783\u2013804","journal-title":"Optim Methods Softw"},{"key":"425_CR38","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.ejor.2006.04.005","volume":"180","author":"AV Demyanov","year":"2007","unstructured":"Demyanov AV, Fuduli A, Miglionico G (2007) A bundle modification strategy for convex minimization. Eur J Oper Res 180:38\u201347","journal-title":"Eur J Oper Res"},{"key":"425_CR39","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF01580609","volume":"60","author":"G Di Pillo","year":"1993","unstructured":"Di Pillo G, Grippo L, Lucidi S (1993) A smooth method for the finite minimax problem. Math Program 60:187\u2013214","journal-title":"Math Program"},{"key":"425_CR40","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1022627226891","volume":"95","author":"G Di Pillo","year":"1997","unstructured":"Di Pillo G, Grippo L, Lucidi S (1997) Smooth transformation of the generalized minimax problem. J Optim Theory Appl 95:1\u201324","journal-title":"J Optim Theory Appl"},{"key":"425_CR41","volume-title":"Numerical nonsmooth optimization\u2014state of the art algorithms","author":"PE Dvurechensky","year":"2019","unstructured":"Dvurechensky PE, Gasnikov AV, Nurminski EA, Stonyakin FS (2019) Advances in low-memory subgradient optimization. In: Bagirov A, Gaudioso M, Karmitsa N, M\u00e4kel\u00e4 M, Taheri S (eds) Numerical nonsmooth optimization\u2014state of the art algorithms. Springer, Berlin (to appear)"},{"key":"425_CR42","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/BF01580439","volume":"8","author":"J Elzinga","year":"1975","unstructured":"Elzinga J, Moore TG (1975) A central cutting plane algorithm for the convex programming problem. Math Program 8:134\u2013145","journal-title":"Math Program"},{"key":"425_CR43","first-page":"748","volume":"173","author":"II Eremin","year":"1967","unstructured":"Eremin II (1967) The method of penalties in convex programming. Dokl Acad Nauk USSR 173:748\u2013751","journal-title":"Dokl Acad Nauk USSR"},{"key":"425_CR44","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01071403","volume":"2","author":"YuM Ermoliev","year":"1966","unstructured":"Ermoliev YuM (1966) Methods of solution of nonlinear extremal problems. Cybernetics 2:1\u201316","journal-title":"Cybernetics"},{"key":"425_CR45","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1137\/130940037","volume":"24","author":"G Fasano","year":"2014","unstructured":"Fasano G, Liuzzi G, Lucidi S, Rinaldi F (2014) A linesearch-based derivative-free approach for nonsmooth constrained optimization. SIAM J Optim 24:959\u2013992","journal-title":"SIAM J Optim"},{"key":"425_CR46","volume-title":"Convex cones, sets and functions. Lectures at Princeton University","author":"W Fenchel","year":"1951","unstructured":"Fenchel W (1951) Convex cones, sets and functions. Lectures at Princeton University. Princeton University, Princeton"},{"key":"425_CR47","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1016\/0305-0548(96)00006-8","volume":"23","author":"A Frangioni","year":"1996","unstructured":"Frangioni A (1996) Solving semidefinite quadratic problems within nonsmooth optimization algorithms. Comput Oper Res 23:1099\u20131118","journal-title":"Comput Oper Res"},{"key":"425_CR48","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1137\/S1052623498342186","volume":"13","author":"A Frangioni","year":"2002","unstructured":"Frangioni A (2002) Generalized bundle methods. SIAM J Optim 13:117\u2013156","journal-title":"SIAM J Optim"},{"key":"425_CR49","volume-title":"Numerical nonsmooth optimization\u2014state of the art algorithms","author":"A Frangioni","year":"2019","unstructured":"Frangioni A (2019) Standard bundle methods: untrusted models and duality. In: Bagirov AM, Gaudioso M, Karmitsa N, M\u00e4kel\u00e4 M, Taheri S (eds) Numerical nonsmooth optimization\u2014state of the art algorithms. Springer, Berlin (to appear)"},{"key":"425_CR50","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s11590-017-1168-z","volume":"12","author":"A Frangioni","year":"2018","unstructured":"Frangioni A, Gendron B, Gorgone E (2018) Dynamic smoothness parameter for fast gradient methods. Optim Lett 12:43\u201353","journal-title":"Optim Lett"},{"key":"425_CR51","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 (2004) Minimizing nonconvex nonsmooth functions via cutting planes and proximity control. SIAM J Optim 14:743\u2013756","journal-title":"SIAM J Optim"},{"key":"425_CR52","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/j.cnsns.2014.07.033","volume":"21","author":"A Fuduli","year":"2015","unstructured":"Fuduli A, Gaudioso M, Giallombardo G, Miglionico G (2015) A partially inexact bundle method for convex semi-infinite minmax problems. Commun Nonlinear Sci Numer Simul 21:172\u2013180","journal-title":"Commun Nonlinear Sci Numer Simul"},{"key":"425_CR53","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF02591883","volume":"30","author":"M Fukushima","year":"1984","unstructured":"Fukushima M (1984) A descent algorithm for nonsmooth convex optimization. Math Program 30:163\u2013175","journal-title":"Math Program"},{"key":"425_CR54","doi-asserted-by":"crossref","first-page":"1106","DOI":"10.1137\/S1052623494278839","volume":"6","author":"M Fukushima","year":"1996","unstructured":"Fukushima M, Qi L (1996) A globally and superlinearly convergent algorithm for nonsmooth convex minimization. SIAM J Optim 6:1106\u20131120","journal-title":"SIAM J Optim"},{"key":"425_CR55","volume-title":"Numerical nonsmooth optimization\u2014state of the art algorithms","author":"M Gaudioso","year":"2019","unstructured":"Gaudioso M (2019) A view of Lagrangian relaxation and its applications. In: Bagirov AM, Gaudioso M, Karmitsa N, M\u00e4kel\u00e4 M, Taheri S (eds) Numerical nonsmooth optimization\u2014state of the art algorithms. Springer, Berlin (to appear)"},{"key":"425_CR56","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1080\/10556780903236911","volume":"25","author":"M Gaudioso","year":"2010","unstructured":"Gaudioso M, Gorgone E (2010) Gradient set splitting in nonconvex nonsmooth numerical optimization. Optim Methods Softw 25:59\u201374","journal-title":"Optim Methods Softw"},{"key":"425_CR57","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/BF01583790","volume":"23","author":"M Gaudioso","year":"1982","unstructured":"Gaudioso M, Monaco MF (1982) A bundle type approach to the unconstrained minimization of convex nonsmooth functions. Math Program 23:216\u2013223","journal-title":"Math Program"},{"key":"425_CR58","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0329003","volume":"29","author":"M Gaudioso","year":"1991","unstructured":"Gaudioso M, Monaco MF (1991) Quadratic approximations in convex nondifferentiable optimization. SIAM J Control Optim 29:1\u201310","journal-title":"SIAM J Control Optim"},{"key":"425_CR59","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1080\/02331939208843808","volume":"25","author":"M Gaudioso","year":"1992","unstructured":"Gaudioso M, Monaco MF (1992) Variants to the cutting plane approach for convex nondifferentiable optimization. Optimization 25:65\u201375","journal-title":"Optimization"},{"key":"425_CR60","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1287\/moor.1050.0175","volume":"31","author":"M Gaudioso","year":"2006","unstructured":"Gaudioso M, Giallombardo G, Miglionico G (2006) An incremental method for solving convex finite min\u2013max problems. Math Oper Res 31:173\u2013187","journal-title":"Math Oper Res"},{"key":"425_CR61","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s10589-007-9149-2","volume":"44","author":"M Gaudioso","year":"2009","unstructured":"Gaudioso M, Giallombardo G, Miglionico G (2009) On solving the Lagrangian dual of integer programs via an incremental approach. Comput Optim Appl 44:117\u2013138","journal-title":"Comput Optim Appl"},{"key":"425_CR62","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1287\/moor.2017.0873","volume":"43","author":"M Gaudioso","year":"2018","unstructured":"Gaudioso M, Giallombardo G, Miglionico G (2018) Minimizing piecewise concave functions over polyhedra. Math Oper Res 43:580\u2013597","journal-title":"Math Oper Res"},{"key":"425_CR63","doi-asserted-by":"crossref","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 AM (2018) Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations. J Global Optim 71:37\u201355","journal-title":"J Global Optim"},{"key":"425_CR64","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/j.amc.2017.07.057","volume":"318","author":"M Gaudioso","year":"2018","unstructured":"Gaudioso M, Giallombardo G, Mukhametzhanov M (2018) Numerical infinitesimals in a variable metric method for convex nonsmooth optimization. Appl Math Comput 318:312\u2013320","journal-title":"Appl Math Comput"},{"key":"425_CR65","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-019-04255-1","author":"M Gaudioso","year":"2019","unstructured":"Gaudioso M, Giallombardo G, Miglionico G, Vocaturo E (2019) Classification in the multiple instance learning framework via spherical separation. Soft Comput. https:\/\/doi.org\/10.1007\/s00500-019-04255-1","journal-title":"Soft Comput"},{"key":"425_CR66","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF01584346","volume":"13","author":"J-L Goffin","year":"1977","unstructured":"Goffin J-L (1977) On convergence rates of subgradients optimization methods. Math Program 13:329\u2013347","journal-title":"Math Program"},{"key":"425_CR67","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1287\/mnsc.38.2.284","volume":"38","author":"J-L Goffin","year":"1992","unstructured":"Goffin J-L, Haurie A, Vial J-P (1992) Decomposition and nondifferentiable optimization with the projective algorithm. Manag Sci 38:284\u2013302","journal-title":"Manag Sci"},{"key":"425_CR68","first-page":"131","volume":"76B","author":"J-L Goffin","year":"1997","unstructured":"Goffin J-L, Gondzio J, Sarkissian R, Vial J-P (1997) Solving nonlinear multicommodity flow problems by the analytic center cutting plane method. Math Program 76B:131\u2013154","journal-title":"Math Program"},{"key":"425_CR69","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1007\/BF01385810","volume":"59","author":"L Grippo","year":"1991","unstructured":"Grippo L, Lampariello F, Lucidi S (1991) A class of nonmonotone stabilization methods in unconstrained optimization. Numer Math 59:779\u2013805","journal-title":"Numer Math"},{"key":"425_CR70","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 MM (2007) Globally convergent limited memory bundle method for large-scale nonsmooth optimization. Math Program 109:181\u2013205","journal-title":"Math Program"},{"key":"425_CR71","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01589332","volume":"20","author":"J Hald","year":"1981","unstructured":"Hald J, Madsen K (1981) Combined LP and quasi-Newton methods for minimax optimization. Math Program 20:49\u201362","journal-title":"Math Program"},{"key":"425_CR72","doi-asserted-by":"crossref","first-page":"2242","DOI":"10.1137\/090754595","volume":"20","author":"W Hare","year":"2010","unstructured":"Hare W, Sagastiz\u00e1bal C (2010) A redistributed proximal bundle method for nonconvex optimization. SIAM J Optim 20:2242\u20132473","journal-title":"SIAM J Optim"},{"key":"425_CR73","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/S1052623497328987","volume":"10","author":"C Helmberg","year":"2000","unstructured":"Helmberg C, Rendl F (2000) A spectral bundle method for semidefinite programming. SIAM J Optim 10:673\u2013696","journal-title":"SIAM J Optim"},{"key":"425_CR74","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1023\/A:1011259017643","volume":"20","author":"M Hinterm\u00fcller","year":"2001","unstructured":"Hinterm\u00fcller M (2001) A proximal bundle method based on approximate subgradients. Comput Optim Appl 20:245\u2013266","journal-title":"Comput Optim Appl"},{"key":"425_CR75","first-page":"37","volume-title":"Generalized differentiability\/duality and optimization for problems dealing with differences of convex functions. Lecture notes in economic and mathematical systems","author":"J-B Hiriart-Urruty","year":"1986","unstructured":"Hiriart-Urruty J-B (1986) Generalized differentiability\/duality and optimization for problems dealing with differences of convex functions. Lecture notes in economic and mathematical systems, vol 256. Springer, Berlin, pp 37\u201370"},{"key":"425_CR76","volume-title":"Convex analysis and minimization algorithms","author":"JB Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty JB, Lemar\u00e9chal C (1993) Convex analysis and minimization algorithms, vol I and II. Springer, Berlin"},{"key":"425_CR77","doi-asserted-by":"crossref","first-page":"1892","DOI":"10.1137\/16M1115733","volume":"28","author":"K Joki","year":"2018","unstructured":"Joki K, Bagirov AM, Karmitsa N, M\u00e4kel\u00e4 MM, Taheri S (2018) Double bundle method for finding clarke stationary points in nonsmooth DC programming. SIAM J Optim 28:1892\u20131919","journal-title":"SIAM J Optim"},{"key":"425_CR78","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1007\/s10957-014-0666-8","volume":"166","author":"N Karmitsa","year":"2015","unstructured":"Karmitsa N (2015) Diagonal bundle method for nonsmooth sparse optimization. J Optim Theory Appl 166:889\u2013905","journal-title":"J Optim Theory Appl"},{"key":"425_CR79","first-page":"703","volume":"8","author":"JE Kelley","year":"1960","unstructured":"Kelley JE (1960) The cutting plane method for solving convex programs. J SIAM 8:703\u2013712","journal-title":"J SIAM"},{"key":"425_CR80","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/BF02591907","volume":"27","author":"KC Kiwiel","year":"1983","unstructured":"Kiwiel KC (1983) An aggregate subgradient method for nonsmooth convex minimization. Math Program 27:320\u2013341","journal-title":"Math Program"},{"key":"425_CR81","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0074500","volume-title":"Methods of descent for nondifferentiable optimization. Lecture notes in mathematics","author":"KC Kiwiel","year":"1985","unstructured":"Kiwiel KC (1985) Methods of descent for nondifferentiable optimization. Lecture notes in mathematics, vol 1133. Springer, Berlin"},{"key":"425_CR82","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1093\/imanum\/6.2.137","volume":"6","author":"KC Kiwiel","year":"1986","unstructured":"Kiwiel KC (1986) A method for solving certain quadratic programming problems arising in nonsmooth optimization. IMA J Numer Anal 6:137\u2013152","journal-title":"IMA J Numer Anal"},{"key":"425_CR83","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01585731","volume":"46","author":"KC Kiwiel","year":"1990","unstructured":"Kiwiel KC (1990) Proximity control in bundle methods for convex nondifferentiable minimization. Math Program 46:105\u2013122","journal-title":"Math Program"},{"key":"425_CR84","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s002110050065","volume":"68","author":"KC Kiwiel","year":"1994","unstructured":"Kiwiel KC (1994) A Cholesky dual method for proximal piecewise linear programming. Numer Math 68:325\u2013340","journal-title":"Numer Math"},{"key":"425_CR85","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1137\/0806013","volume":"6","author":"KC Kiwiel","year":"1996","unstructured":"Kiwiel KC (1996) Restricted step and Levenberg\u2013Marquardt techniques in proximal bundle methods for nonconvex nondifferentiable optimization. SIAM J Optim 6:227\u2013249","journal-title":"SIAM J Optim"},{"key":"425_CR86","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s101070050056","volume":"85","author":"KC Kiwiel","year":"1999","unstructured":"Kiwiel KC (1999) A bundle Bregman proximal method for convex nondifferentiable minimization. Math Program 85:241\u2013258","journal-title":"Math Program"},{"key":"425_CR87","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1137\/S1052623400376366","volume":"14","author":"KC Kiwiel","year":"2004","unstructured":"Kiwiel KC (2004) Convergence of approximate and incremental subgradient methods for convex optimization. SIAM J Optim 14:807\u2013840","journal-title":"SIAM J Optim"},{"key":"425_CR88","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1137\/040603929","volume":"16","author":"KC Kiwiel","year":"2006","unstructured":"Kiwiel KC (2006) A proximal bundle method with approximate subgradient linearizations. SIAM J Optim 16:1007\u20131023","journal-title":"SIAM J Optim"},{"key":"425_CR89","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1137\/050639673","volume":"18","author":"KC Kiwiel","year":"2007","unstructured":"Kiwiel KC (2007) Convergence of the gradient sampling algorithm for nonsmooth nonconvex optimization. SIAM J Optim 18:379\u2013388","journal-title":"SIAM J Optim"},{"key":"425_CR90","doi-asserted-by":"crossref","first-page":"1983","DOI":"10.1137\/090748408","volume":"20","author":"KC Kiwiel","year":"2010","unstructured":"Kiwiel KC (2010) A nonderivative version of the gradient sampling algorithm for nonsmooth nonconvex optimization. SIAM J Optim 20:1983\u20131994","journal-title":"SIAM J Optim"},{"key":"425_CR91","unstructured":"Lemar\u00e9chal C (1974) An algorithm for minimizing convex functions. In: Rosenfeld JL (ed) Proceedings IFIP \u201974 congress, pp 20\u201325, North-Holland, Amsterdam"},{"key":"425_CR92","unstructured":"Lemar\u00e9chal C (1978) Nonsmooth optimization and descent methods. Report RR-78-4, IIASA, Laxenburg, Austria"},{"key":"425_CR93","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BFb0120700","volume":"3","author":"C Lemar\u00e9chal","year":"1975","unstructured":"Lemar\u00e9chal C (1975) An extension of Davidon methods to nondifferentiable problems. Math Program Study 3:95\u2013109","journal-title":"Math Program Study"},{"key":"425_CR94","volume-title":"Optimization and optimal control. Lecture notes in control and information sciences","author":"C Lemar\u00e9chal","year":"1981","unstructured":"Lemar\u00e9chal C (1981) A view of line-searches. In: Auslender A, Oettli W, Stoer J (eds) Optimization and optimal control. Lecture notes in control and information sciences, vol 30. Springer, Berlin"},{"key":"425_CR95","first-page":"61","volume-title":"Progress in nondifferentiable optimization CP-82-S8","author":"C Lemar\u00e9chal","year":"1982","unstructured":"Lemar\u00e9chal C (1982) Numerical experiments in nonsmooth optimization. In: Nurminski EA (ed) Progress in nondifferentiable optimization CP-82-S8. IIASA, Laxenburg, pp 61\u201384"},{"key":"425_CR96","volume-title":"Handbooks in OR & MS","author":"C Lemar\u00e9chal","year":"1989","unstructured":"Lemar\u00e9chal C (1989) Nondifferentiable optimization. In: Nemhauser GL et al (eds) Handbooks in OR & MS, vol 1. North-Holland, Amsterdam"},{"key":"425_CR97","volume-title":"Nonsmooth optimization","year":"1978","unstructured":"Lemar\u00e9chal C, Mifflin R (eds) (1978) Nonsmooth optimization. Pergamon Press, Oxford"},{"key":"425_CR98","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/BF02614390","volume":"76","author":"C Lemar\u00e9chal","year":"1997","unstructured":"Lemar\u00e9chal C, Sagastiz\u00e1bal C (1997) Variable metrics bundle methods: from conceptual to implementable forms. Math Program 76:393\u2013410","journal-title":"Math Program"},{"key":"425_CR99","first-page":"245","volume-title":"Nonlinear programming","author":"C Lemar\u00e9chal","year":"1981","unstructured":"Lemar\u00e9chal C, Strodiot J-J, Bihain A (1981) On a bundle algorithm for nonsmooth optimization. In: Mangasarian OL, Meyer RR, Robinson SM (eds) Nonlinear programming, vol 4. Academic Press, New York, pp 245\u2013282"},{"key":"425_CR100","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01585555","volume":"69","author":"C Lemar\u00e9chal","year":"1995","unstructured":"Lemar\u00e9chal C, Nemirovskii A, Nesterov Y (1995) New variants of bundle methods. Math Program 69:111\u2013147","journal-title":"Math Program"},{"key":"425_CR101","first-page":"286","volume":"6","author":"AYu Levin","year":"1965","unstructured":"Levin AYu (1965) On an algorithm for minimization of convex functions. Sov Math Dokl 6:286\u2013290","journal-title":"Sov Math Dokl"},{"key":"425_CR102","first-page":"787","volume":"6","author":"EC Levitin","year":"1966","unstructured":"Levitin EC, Polyak BT (1966) Constrained minimization methods. J Comput Math Math Phys 6:787\u2013823 (in Russian)","journal-title":"J Comput Math Math Phys"},{"key":"425_CR103","first-page":"373","volume":"83","author":"L Luks\u01cen","year":"1998","unstructured":"Luks\u01cen L, Vl\u010dek J (1998) A bundle-Newton method for nonsmooth unconstrained minimization. Math Program 83:373\u2013391","journal-title":"Math Program"},{"key":"425_CR104","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/10556780290027828","volume":"17","author":"MM M\u00e4kel\u00e4","year":"2002","unstructured":"M\u00e4kel\u00e4 MM (2002) Survey of bundle methods for nonsmooth optimization. Optim Methods Softw 17:1\u201329","journal-title":"Optim Methods Softw"},{"key":"425_CR105","doi-asserted-by":"crossref","DOI":"10.1142\/1493","volume-title":"Nonsmooth optimization","author":"MM M\u00e4kel\u00e4","year":"1992","unstructured":"M\u00e4kel\u00e4 MM, Neittaanm\u00e4ki P (1992) Nonsmooth optimization. World Scientific, Singapore"},{"key":"425_CR106","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BFb0120960","volume":"17","author":"R Mifflin","year":"1982","unstructured":"Mifflin R (1982) A modification and an extension of Lemar\u00e9chal\u2019s algorithm for nonsmooth minimization. Math Program Study 17:77\u201390","journal-title":"Math Program Study"},{"key":"425_CR107","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BF02612712","volume":"28","author":"R Mifflin","year":"1984","unstructured":"Mifflin R (1984) Stationarity and superlinear convergence of an algorithm for univariate locally Lipschitz constrained minimization. Math Program 28:50\u201371","journal-title":"Math Program"},{"key":"425_CR108","first-page":"51","volume":"73","author":"R Mifflin","year":"1996","unstructured":"Mifflin R (1996) A quasi-second order proximal bundle algorithm. Math Program 73:51\u201372","journal-title":"Math Program"},{"key":"425_CR109","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/s10107-005-0630-3","volume":"104","author":"R Mifflin","year":"2005","unstructured":"Mifflin R, Sagastiz\u00e1bal C (2005) A VU-algorithm for convex minimization. Math Program 104:583\u2013608","journal-title":"Math Program"},{"key":"425_CR110","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 (1998) Quasi-Newton bundle-type methods for nondifferentiable convex optimizations. SIAM J Optim 8:583\u2013603","journal-title":"SIAM J Optim"},{"key":"425_CR111","doi-asserted-by":"crossref","unstructured":"Mifflin R, Sagastiz\u00e1bal C (2012) A science fiction story in nonsmooth optimization originating at IIASA. Documenta mathematica extra volume: optimization stories, pp 291\u2013300","DOI":"10.4171\/dms\/6\/31"},{"key":"425_CR112","unstructured":"Monaco MF (1987) An algorithm for the minimization of a convex quadratic function over a simplex. Technical report, Dipartimento di Sistemi, Universit\u00e1 della Calabria, vol 56"},{"key":"425_CR113","volume-title":"Variational analysis and generalized differentiation","author":"BS Mordukhovich","year":"2006","unstructured":"Mordukhovich BS (2006) Variational analysis and generalized differentiation. Springer, Berlin"},{"key":"425_CR114","first-page":"272","volume":"93","author":"J-J Moreau","year":"1965","unstructured":"Moreau J-J (1965) Proximit\u00e9 et dualit\u00e9 dans un espace hilbertien. Bull Soc Math Fr 93:272\u2013299","journal-title":"Bull Soc Math Fr"},{"key":"425_CR115","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1137\/S1052623499362111","volume":"12","author":"A Nedi\u0107","year":"2001","unstructured":"Nedi\u0107 A, Bertsekas DP (2001) Incremental subgradient methods for nondifferentiable optimization. SIAM J Optim 12:109\u2013138","journal-title":"SIAM J Optim"},{"key":"425_CR116","volume-title":"Problem complexity and method efficiency in optimization","author":"A Nemirovski","year":"1983","unstructured":"Nemirovski A, Yudin D (1983) Problem complexity and method efficiency in optimization. Wiley, New York"},{"key":"425_CR117","first-page":"149","volume":"69","author":"Yu Nesterov","year":"1995","unstructured":"Nesterov Yu (1995) Complexity estimates of some cutting plane methods based on the analytic barrier. Math Program 69:149\u2013176","journal-title":"Math Program"},{"key":"425_CR118","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Yu Nesterov","year":"2005","unstructured":"Nesterov Yu (2005) Smooth minimization of non-smooth functions. Math Program 103:127\u2013152","journal-title":"Math Program"},{"key":"425_CR119","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10107-007-0149-x","volume":"120","author":"Yu Nesterov","year":"2009","unstructured":"Nesterov Yu (2009) Primal-dual subgradient methods for convex problems. Math Program 120:221\u2013259","journal-title":"Math Program"},{"key":"425_CR120","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s10107-014-0790-0","volume":"152","author":"Yu Nesterov","year":"2009","unstructured":"Nesterov Yu (2009) Universal gradient methods for convex optimization problems. Math Program 152:381\u2013404","journal-title":"Math Program"},{"key":"425_CR121","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1007\/s10107-005-0634-z","volume":"104","author":"D Noll","year":"2005","unstructured":"Noll D, Apkarian P (2005) Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods. Math Program 104:701\u2013727","journal-title":"Math Program"},{"key":"425_CR122","first-page":"97","volume-title":"Progress in nondifferentiable optimization CP-82-S8","author":"EA Nurminski","year":"1982","unstructured":"Nurminski EA (1982) Subgradient method for minimizing weakly convex functions and $$\\epsilon $$-subgradient methods of convex optimization. In: Nurminski EA (ed) Progress in nondifferentiable optimization CP-82-S8. IIASA, Laxenburg, pp 97\u2013123"},{"key":"425_CR123","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s10107-008-0209-x","volume":"119","author":"A Ouorou","year":"2009","unstructured":"Ouorou A (2009) A proximal cutting plane method using Chebychev center for nonsmooth convex optimization. Math Program 119:239\u2013271","journal-title":"Math Program"},{"key":"425_CR124","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/BF00940683","volume":"69","author":"E Polak","year":"1991","unstructured":"Polak E, Mayne DQ, Higgins JE (1991) Superlinearly convergent algorithm for min\u2013max problems. J Optim Theory Appl 69:407\u2013439","journal-title":"J Optim Theory Appl"},{"key":"425_CR125","first-page":"5","volume-title":"Nonsmooth optimization","author":"BT Polyak","year":"1978","unstructured":"Polyak BT (1978) Subgradient methods: a survey of Soviet research. In: Lemar\u00e9chal C, Mifflin R (eds) Nonsmooth optimization. Pergamon Press, Oxford, pp 5\u201329"},{"key":"425_CR126","volume-title":"Introduction to optimization","author":"BT Polyak","year":"1987","unstructured":"Polyak BT (1987) Introduction to optimization. Optimization Software Inc., New York"},{"key":"425_CR127","first-page":"120","volume":"5","author":"BN Pshenichnyi","year":"1970","unstructured":"Pshenichnyi BN (1970) An algorithm for general problems of mathematical programming. Kybernetika 5:120\u2013125 (in Russian)","journal-title":"Kybernetika"},{"key":"425_CR128","first-page":"71","volume-title":"Nonsmooth optimization","author":"BN Pshenichnyi","year":"1978","unstructured":"Pshenichnyi BN (1978) Nonsmooth optimization and nonlinear programming. In: Lemar\u00e9chal C, Mifflin R (eds) Nonsmooth optimization. Pergamon Press, Oxford, pp 71\u201378"},{"key":"425_CR129","volume-title":"Numerical methods for extremum problems","author":"BN Pshenichnyi","year":"1975","unstructured":"Pshenichnyi BN, Danilin YuM (1975) Numerical methods for extremum problems. Nauka, Moscow"},{"key":"425_CR130","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01581275","volume":"58","author":"L Qi","year":"1993","unstructured":"Qi L, Sun J (1993) A nonsmooth version of Newton\u2019s method. Math Program 58:353\u2013368","journal-title":"Math Program"},{"key":"425_CR131","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF01581136","volume":"66","author":"L Qi","year":"1994","unstructured":"Qi L, Sun J (1994) A trust region algorithm for minimization of locally Lipschitzian functions. Math Program 66:25\u201343","journal-title":"Math Program"},{"key":"425_CR132","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1023\/A:1004633524446","volume":"104","author":"AI Rauf","year":"1998","unstructured":"Rauf AI, Fukushima M (1998) Globally convergent BFGS method for nonsmooth convex optimization. J Optim Theory Appl 104:539\u2013558","journal-title":"J Optim Theory Appl"},{"key":"425_CR133","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar RT (1970) Convex analysis. Princeton University Press, Princeton"},{"key":"425_CR134","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar RT (1976) Monotone operators and the proximal point algorithm. SIAM J Control Optim 14:877\u2013898","journal-title":"SIAM J Control Optim"},{"key":"425_CR135","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1137\/0802008","volume":"2","author":"H Schramm","year":"1992","unstructured":"Schramm H, Zowe J (1992) A version of the bundle idea for minimizing a nonsmooth function: conceptual idea, convergence analysis, numerical results. SIAM J Optim 2:121\u2013152","journal-title":"SIAM J Optim"},{"key":"425_CR136","unstructured":"Shor NZ (1962) Application of the gradient method for the solution of network transportation problems. In: Notes, Scientific seminar on theory and application of cybernetics and operations research, academy of science, Kiev (in Russian)"},{"key":"425_CR137","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-82118-9","volume-title":"Minimization methods for nondifferentiable functions","author":"NZ Shor","year":"1985","unstructured":"Shor NZ (1985) Minimization methods for nondifferentiable functions. Springer, Berlin"},{"key":"425_CR138","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-6015-6","volume-title":"Nondifferentiable optimization and polynomial problems","author":"NZ Shor","year":"1998","unstructured":"Shor NZ (1998) Nondifferentiable optimization and polynomial problems. Kluwer Academic Publishers, Boston"},{"key":"425_CR139","first-page":"866","volume-title":"Lecture notes in control and information sciences","author":"G Sonnevend","year":"1985","unstructured":"Sonnevend G (1985) An analytic center for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming. In: Prekopa A (ed) Lecture notes in control and information sciences, vol 84. Springer, New York, pp 866\u2013876"},{"key":"425_CR140","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1023\/A:1008277314050","volume":"12","author":"AS Strekalovsky","year":"1998","unstructured":"Strekalovsky AS (1998) Global optimality conditions for nonconvex optimization. J Global Optim 12:415\u2013434","journal-title":"J Global Optim"},{"key":"425_CR141","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0167-6377(86)90010-6","volume":"5","author":"MJ Todd","year":"1986","unstructured":"Todd MJ (1986) The symmetric rank-one quasi-Newton algorithm is a space-dilation subgradient algorithm. Oper Res Lett 5:217\u2013219","journal-title":"Oper Res Lett"},{"key":"425_CR142","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-31484-6","volume-title":"Convex analysis and global optimization","author":"H Tuy","year":"2016","unstructured":"Tuy H (2016) Convex analysis and global optimization. Springer, Berlin"},{"key":"425_CR143","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1137\/120903099","volume":"24","author":"W van Ackooij","year":"2014","unstructured":"van Ackooij W, Sagastiz\u00e1bal C (2014) Constrained bundle methods for upper inexact oracles with application to joint chance constrained energy problems. SIAM J Optim 24:733\u2013765","journal-title":"SIAM J Optim"},{"key":"425_CR144","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1023\/A:1011990503369","volume":"111","author":"J Vl\u010dek","year":"2001","unstructured":"Vl\u010dek J, Luks\u01cen L (2001) Globally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization. J Optim Theory Appl 111:407\u2013430","journal-title":"J Optim Theory Appl"},{"key":"425_CR145","first-page":"143","volume":"3","author":"P Wolfe","year":"1975","unstructured":"Wolfe P (1975) A method of conjugate subgradients for minimizing nondifferentiable functions. Math Program Study 3:143\u2013173","journal-title":"Math Program Study"},{"key":"425_CR146","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/BF01580381","volume":"11","author":"P Wolfe","year":"1976","unstructured":"Wolfe P (1976) Finding the nearest point in a polytope. Math Program 11:128\u2013149","journal-title":"Math Program"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-019-00425-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-019-00425-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-019-00425-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T18:33:25Z","timestamp":1695494005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-019-00425-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,6]]},"references-count":146,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["425"],"URL":"https:\/\/doi.org\/10.1007\/s10288-019-00425-x","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,6]]},"assertion":[{"value":"21 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 December 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}