{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,8]],"date-time":"2026-08-08T20:00:46Z","timestamp":1786219246780,"version":"3.56.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:00:00Z","timestamp":1605744000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:00:00Z","timestamp":1605744000000},"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":["Comput Optim Appl"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s10589-020-00241-8","type":"journal-article","created":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T22:22:09Z","timestamp":1605824529000},"page":"451-490","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["A bundle method for nonsmooth DC programming with application to chance-constrained problems"],"prefix":"10.1007","volume":"78","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9943-3572","authenticated-orcid":false,"given":"W.","family":"van Ackooij","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S.","family":"Demassey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1045-9646","authenticated-orcid":false,"given":"P.","family":"Javal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5906-4744","authenticated-orcid":false,"given":"H.","family":"Morais","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"W.","family":"de Oliveira","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5718-9615","authenticated-orcid":false,"given":"B.","family":"Swaminathan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,11,19]]},"reference":[{"issue":"1","key":"241_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1080\/02331934.2016.1253694","volume":"66","author":"NT An","year":"2017","unstructured":"An, N.T., Nam, N.M.: Convergence analysis of a proximal point algorithm for minimizing differences of functions. Optimization 66(1), 129\u2013147 (2017)","journal-title":"Optimization"},{"issue":"3","key":"241_CR2","doi-asserted-by":"publisher","first-page":"1516","DOI":"10.1137\/070685026","volume":"47","author":"P Apkarian","year":"2008","unstructured":"Apkarian, P., Noll, D., Rondepierre, A.: Mixed $$H_2\/H_{\\infty }$$ control via nonsmooth optimization. SIAM J. Control Optim. 47(3), 1516\u20131546 (2008)","journal-title":"SIAM J. Control Optim."},{"key":"241_CR3","doi-asserted-by":"crossref","unstructured":"Arag\u00f3n Artacho, F.J., Fleming, R.M.T., Vuong, P.T.: Accelerating the DC algorithm for smooth functions. Math. Program. 169(1), 95\u2013118 (2018)","DOI":"10.1007\/s10107-017-1180-1"},{"issue":"2","key":"241_CR4","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka-\u0141ojasiewicz inequality. Math. Oper. Res. 35(2), 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"241_CR5","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10107-018-1292-2","volume":"178","author":"S Banert","year":"2019","unstructured":"Banert, S., Bo\u0163, R.I.: A general double-proximal gradient algorithm for DC programming. Math. Program. 178(1), 301\u2013326 (2019)","journal-title":"Math. Program."},{"issue":"2","key":"241_CR6","first-page":"673","volume":"17","author":"IM Bomze","year":"2010","unstructured":"Bomze, I.M., Lemar\u00e9chal, C.: Necessary conditions for local optimality in difference-of-convex programming. J. Convex Anal. 17(2), 673\u2013680 (2010)","journal-title":"J. Convex Anal."},{"key":"241_CR7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971309","volume-title":"Optimisation and nonsmooth analysis","author":"FH Clarke","year":"1990","unstructured":"Clarke, F.H.: Optimisation and nonsmooth analysis. Class. Appl. Math. Soc. Ind. Appl, Math (1990)"},{"key":"241_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-019-00755-4","volume-title":"Proximal bundle methods for nonsmooth DC programming","author":"W de Oliveira","year":"2019","unstructured":"de Oliveira, W.: Proximal bundle methods for nonsmooth DC programming. J. Glob, Optim (2019)"},{"key":"241_CR9","volume-title":"An inertial algorithm for DC programming","author":"W de Oliveira","year":"2018","unstructured":"de Oliveira, W., Tcheou, M.P.: An inertial algorithm for DC programming. Set-Valued Var, Anal (2018)"},{"issue":"2","key":"241_CR10","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."},{"issue":"1","key":"241_CR11","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."},{"issue":"3","key":"241_CR12","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s10287-017-0284-7","volume":"14","author":"T Gonz\u00e1lez Grand\u00f3n","year":"2017","unstructured":"Gonz\u00e1lez Grand\u00f3n, T., Heitsch, H., Henrion, R.: A joint model of probabilistic\/robust constraints for gas transport management in stationary networks. Comput. Manag. Sci. 14(3), 443\u2013460 (2017)","journal-title":"Comput. Manag. Sci."},{"issue":"2","key":"241_CR13","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s00186-016-0564-y","volume":"84","author":"C Gotzes","year":"2016","unstructured":"Gotzes, C., Heitsch, H., Henrion, R., Schultz, R.: On the quantification of nomination feasibility in stationary gas networks with random load. Math. Methods Oper. Res. 84(2), 427\u2013457 (2016)","journal-title":"Math. Methods Oper. Res."},{"issue":"1","key":"241_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-015-9762-4","volume":"63","author":"W Hare","year":"2016","unstructured":"Hare, W., Sagastiz\u00e1bal, C., Solodov, M.: A proximal bundle method for nonsmooth nonconvex functions with inexact information. Comput. Optim. Appl. 63(1), 1\u201328 (2016)","journal-title":"Comput. Optim. Appl."},{"key":"241_CR15","unstructured":"Hiriart-Urruty, J.B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms I, No. 305 in Grundlehren der mathematischen Wissenschaften, 2nd edn. Springer, Berlin (1996)"},{"key":"241_CR16","unstructured":"Hiriart-Urruty, J.B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms II, No. 306 in Grundlehren der mathematischen Wissenschaften, 2nd edn. Springer, Berlin (1996)"},{"issue":"3","key":"241_CR17","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1287\/opre.1100.0910","volume":"59","author":"LJ Hong","year":"2011","unstructured":"Hong, L.J., Yang, Y., Zhang, L.: Sequential convex approximations to joint chance constrained programs: a Monte Carlo approach. Oper. Res. 59(3), 617\u2013630 (2011)","journal-title":"Oper. Res."},{"issue":"2","key":"241_CR18","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."},{"issue":"1","key":"241_CR19","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-018-1235-y","volume":"169","author":"H Le Thi","year":"2018","unstructured":"Le Thi, H., Pham Dinh, T.: DC programming and DCA: thirty years of developments. Math. Program. 169(1), 5\u201368 (2018)","journal-title":"Math. Program."},{"issue":"2","key":"241_CR20","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s11081-015-9294-x","volume":"17","author":"T Lipp","year":"2016","unstructured":"Lipp, T., Boyd, S.: Variations and extension of the convex-concave procedure. Optim. Eng. 17(2), 263\u2013287 (2016)","journal-title":"Optim. Eng."},{"key":"241_CR21","unstructured":"Luk\u00e1\u0161, A., Branda, M., Heitsch, H., Henrion, R.: Solving joint chance constrained problems using regularization and Benders\u2019 decomposition. Ann. Oper. Res. (2018)"},{"issue":"3","key":"241_CR22","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10898-018-0651-0","volume":"72","author":"O Montonen","year":"2018","unstructured":"Montonen, O., Joki, K.: Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints. J. Glob. Optim. 72(3), 403\u2013429 (2018)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"241_CR23","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/s10957-013-0391-8","volume":"160","author":"D Noll","year":"2014","unstructured":"Noll, D.: Convergence of Non-smooth Descent Methods Using the Kurdyka-\u0141ojasiewicz inequality. J. Optim. Theory Appl. 160(2), 553\u2013572 (2014)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"241_CR24","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."},{"key":"241_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-3087-7","volume-title":"Stochastic Programming","author":"A Pr\u00e9kopa","year":"1995","unstructured":"Pr\u00e9kopa, A.: Stochastic Programming. Kluwer, Dordrecht (1995)"},{"issue":"58","key":"241_CR26","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.apm.2017.07.031","volume":"1","author":"AS Strekalovsky","year":"2018","unstructured":"Strekalovsky, A.S., Minarchenko, I.M.: A local search method for optimisation problem with DC inequality constraints. Appl. Math. Modell. 1(58), 229\u2013244 (2018)","journal-title":"Appl. Math. Modell."},{"key":"241_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-31484-6","volume-title":"Convex Analysis and Global Optimization, Nonconvex Optimization and Its Applications","author":"H Tuy","year":"2016","unstructured":"Tuy, H.: Convex Analysis and Global Optimization, Nonconvex Optimization and Its Applications, vol. 22. Springer, Berlin (2016)"},{"issue":"3","key":"241_CR28","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/s10589-016-9851-z","volume":"65","author":"W van Ackooij","year":"2016","unstructured":"van Ackooij, W., Frangioni, A., de Oliveira, W.: Inexact stabilized Benders\u2019 decomposition approaches with application to chance-constrained problems with finite support. Comput. Optim. Appl. 65(3), 637\u2013669 (2016)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"241_CR29","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1137\/16M1061308","volume":"5","author":"W van Ackooij","year":"2017","unstructured":"van Ackooij, W., Henrion, R.: (Sub-)gradient formulae for probability functions of random inequality systems under gaussian distribution. SIAM\/ASA J. Uncertain. Quant. 5(1), 63\u201387 (2017)","journal-title":"SIAM\/ASA J. Uncertain. Quant."},{"issue":"3","key":"241_CR30","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s10589-013-9610-3","volume":"57","author":"W van Ackooij","year":"2014","unstructured":"van Ackooij, W., de Oliveira, W.: Level bundle methods for constrained convex optimization with various oracles. Comput. Optim. Appl. 57(3), 555\u2013597 (2014)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"241_CR31","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1080\/10556788.2019.1595619","volume":"34","author":"W van Ackooij","year":"2019","unstructured":"van Ackooij, W., de Oliveira, W.: Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies. Optim. Methods Softw. 34(4), 890\u2013920 (2019)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"241_CR32","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1137\/120903099","volume":"24","author":"W van Ackooij","year":"2014","unstructured":"van Ackooij, W., Sagastiz\u00e1bal, C.: Constrained bundle methods for upper inexact oracles with application to joint chance constrained energy problems. SIAM J. Optim. 24(2), 733\u2013765 (2014)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"241_CR33","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s10589-017-9954-1","volume":"69","author":"B Wen","year":"2018","unstructured":"Wen, B., Chen, X., Pong, T.K.: A proximal difference-of-convex algorithm with extrapolation. Comput. Optim. Appl. 69(2), 297\u2013324 (2018)","journal-title":"Comput. Optim. Appl."},{"key":"241_CR34","unstructured":"Yu, P., Pong, T.K., Lu, Z.: Convergence rate analysis of a sequential convex programming method with line search for a class of constrained difference-of-convex optimization problems, pp. 1\u201328 (2020). arXiv:2001.06998"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00241-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-020-00241-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00241-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,11]],"date-time":"2021-02-11T19:07:19Z","timestamp":1613070439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-020-00241-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,19]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["241"],"URL":"https:\/\/doi.org\/10.1007\/s10589-020-00241-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,19]]},"assertion":[{"value":"3 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}