{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:04:59Z","timestamp":1758823499445,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,11,27]],"date-time":"2018-11-27T00:00:00Z","timestamp":1543276800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,11,27]],"date-time":"2018-11-27T00:00:00Z","timestamp":1543276800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP12100567"],"award-info":[{"award-number":["DP12100567"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"FAPESP","doi-asserted-by":"crossref","award":["2017 \/ 15936-2"],"award-info":[{"award-number":["2017 \/ 15936-2"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s10589-018-0048-5","type":"journal-article","created":{"date-parts":[[2018,11,27]],"date-time":"2018-11-27T12:22:31Z","timestamp":1543321351000},"page":"391-412","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A simple version of bundle method with linear programming"],"prefix":"10.1007","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0357-9121","authenticated-orcid":false,"given":"Shuai","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,27]]},"reference":[{"issue":"2","key":"48_CR1","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s10957-004-1861-9","volume":"125","author":"R Andreani","year":"2005","unstructured":"Andreani, R., Martinez, J.M., Schuverdt, M.L.: On the relation between constant positive linear dependence condition and quasinormality constraint qualification. J. Optim. Theory Appl. 125(2), 473\u2013483 (2005)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"48_CR2","doi-asserted-by":"publisher","first-page":"1418","DOI":"10.1137\/100817930","volume":"21","author":"A Astorino","year":"2011","unstructured":"Astorino, A., Frangioni, A., Gaudioso, M., Gorgone, E.: Piecewise-quadratic approximations in convex numerical optimization. SIAM J. Optim. 21(4), 1418\u20131438 (2011)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"48_CR3","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10957-007-9335-5","volume":"137","author":"AM 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."},{"key":"48_CR4","volume-title":"Numerical Optimization: Theoretical and Practical Aspects. Universitext","author":"JF Bonnans","year":"2006","unstructured":"Bonnans, J.F., Gilbert, J.C., Lemarechal, C., Sagastiz\u00e1bal, C.A.: Numerical Optimization: Theoretical and Practical Aspects. Universitext. Springer, Berlin (2006)"},{"issue":"1","key":"48_CR5","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BF01386389","volume":"1","author":"EW Cheney","year":"1959","unstructured":"Cheney, E.W., Goldstein, A.A.: Newton\u2019s method for convex programming and tchebycheff approximation. Numer. Math. 1(1), 253\u2013268 (1959)","journal-title":"Numer. Math."},{"issue":"1\u20133","key":"48_CR6","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF01585170","volume":"62","author":"R Correa","year":"1993","unstructured":"Correa, R., Lemar\u00e9chal, C.: Convergence of some algorithms for convex minimization. Math. Program. 62(1\u20133), 261\u2013275 (1993)","journal-title":"Math. Program."},{"issue":"3","key":"48_CR7","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/s11750-016-0413-4","volume":"24","author":"W de Oliveira","year":"2016","unstructured":"de Oliveira, W.: Regularized optimization methods for convex minlp problems. TOP 24(3), 665\u2013692 (2016)","journal-title":"TOP"},{"issue":"1","key":"48_CR8","doi-asserted-by":"publisher","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.: Convex proximal bundle methods in depth: a unified analysis for inexact oracles. Math. Program. 148(1), 241\u2013277 (2014)","journal-title":"Math. Program."},{"issue":"1","key":"48_CR9","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1137\/S1052623498342186","volume":"13","author":"A Frangioni","year":"2002","unstructured":"Frangioni, A.: Generalized bundle methods. SIAM J. Optim. 13(1), 117\u2013156 (2002)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"48_CR10","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1080\/02331934.2013.840625","volume":"64","author":"A Fuduli","year":"2015","unstructured":"Fuduli, A., Gaudioso, M., Nurminski, E.A.: A splitting bundle approach for non-smooth non-convex minimization. Optimization 64(5), 1131\u20131151 (2015)","journal-title":"Optimization"},{"issue":"6","key":"48_CR11","doi-asserted-by":"publisher","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":"5","key":"48_CR12","doi-asserted-by":"publisher","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."},{"issue":"1","key":"48_CR13","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":"48_CR14","volume-title":"Convex Analysis and Minimization Algorithms II, Grundlehren Der Mathematischen Wissenschaften","author":"JB Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J.B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms II, Grundlehren Der Mathematischen Wissenschaften, vol. 306. Springer, Berlin (1993)"},{"key":"48_CR15","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1137\/0108053","volume":"8","author":"JE Kelley Jr","year":"1960","unstructured":"Kelley Jr., J.E.: The cutting-plane method for solving convex programs. J. Soc. Ind. Appl. Math. 8, 703\u2013712 (1960)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"1","key":"48_CR16","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF01592242","volume":"71","author":"S Kim","year":"1995","unstructured":"Kim, S., Chang, K.N., Lee, J.Y.: A descent method with linear programming subproblems for nondifferentiable convex optimization. Math. Program. 71(1), 17\u201328 (1995)","journal-title":"Math. Program."},{"key":"48_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0074500","volume-title":"Methods of Descent for Nondifferentiable Optimization","author":"KC Kiwiel","year":"1985","unstructured":"Kiwiel, K.C.: Methods of Descent for Nondifferentiable Optimization. Springer, Berlin (1985)"},{"key":"48_CR18","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BFb0120700","volume-title":"Nondifferentiable Optimization, Mathematical Programming Studies","author":"C Lemar\u00e9chal","year":"1975","unstructured":"Lemar\u00e9chal, C.: An extension of davidon methods to non differentiable problems. In: Balinski, M.L., Wolfe, P. (eds.) Nondifferentiable Optimization, Mathematical Programming Studies, vol. 3, pp. 95\u2013109. Springer, Berlin (1975)"},{"key":"48_CR19","unstructured":"Lemar\u00e9chal, C.: Bundle methods in nonsmooth optimization. In: Lemar\u00e9chal, C., Mifflin, R. (eds.) Nonsmooth Optimization: Proceedings of a IIASA Workshop, March 28-April 8, 1977, Iiasa Proceedings Series, vol.\u00a03, pp. 79\u2013102. International Institute for Applied Systems Analysis, Pergamon Press (1978)"},{"issue":"1","key":"48_CR20","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01585555","volume":"69","author":"C Lemar\u00e9chal","year":"1995","unstructured":"Lemar\u00e9chal, C., Nemirovskii, A., Nesterov, Y.: New variants of bundle methods. Math. Program. 69(1), 111\u2013147 (1995)","journal-title":"Math. Program."},{"issue":"2\u20133","key":"48_CR21","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1023\/A:1021858008222","volume":"24","author":"J Linderoth","year":"2003","unstructured":"Linderoth, J., Wright, S.: Decomposition algorithms for stochastic programming on a computational grid. Comput. Optim. Appl. 24(2\u20133), 207\u2013250 (2003)","journal-title":"Comput. Optim. Appl."},{"issue":"3, Ser.A","key":"48_CR22","first-page":"373","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(3, Ser.A), 373\u2013391 (1998)","journal-title":"Math. Program."},{"key":"48_CR23","unstructured":"Luk\u0161an, L., Vl\u010dek, J.: Test problems for nonsmooth unconstrained and linearly constrained optimization. Tech. Rep. 798, Institute of Computer Science of Academy of Sciences of the Czech Republic (2000)"},{"key":"48_CR24","doi-asserted-by":"publisher","DOI":"10.1142\/1493","volume-title":"Nonsmooth Optimization: Analysis and Algorithms with Applications to Optimal Control","author":"MM Makela","year":"1992","unstructured":"Makela, M.M., Neittaanmaki, P.: Nonsmooth Optimization: Analysis and Algorithms with Applications to Optimal Control. World Scientific, Singapore (1992)"},{"key":"48_CR25","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BFb0120960","volume-title":"Nondifferential and Variational Techniques in Optimization, Mathematical Programming Studies","author":"R Mifflin","year":"1982","unstructured":"Mifflin, R.: A modification and an extension of lemarechal\u2019s algorithm for nonsmooth minimization. In: Sorensen, D.C., Wets, RJb (eds.) Nondifferential and Variational Techniques in Optimization, Mathematical Programming Studies, vol. 17, pp. 77\u201390. Springer, Berlin (1982)"},{"key":"48_CR26","doi-asserted-by":"crossref","unstructured":"Mifflin, R., Sagastiz\u00e1bal, C.: A science fiction story in nonsmooth optimization originating at iiasa. this volume (2012)","DOI":"10.4171\/dms\/6\/31"},{"issue":"3","key":"48_CR27","first-page":"569","volume":"4","author":"D Noll","year":"2008","unstructured":"Noll, D., Prot, O., Rondepierre, A.: A proximity control algorithm to minimize nonsmooth and nonconvex functions. Pacific J. Optim. 4(3), 569\u2013602 (2008)","journal-title":"Pacific J. Optim."},{"key":"48_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis: Grundlehren Der Mathematischen Wissenschaften","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis: Grundlehren Der Mathematischen Wissenschaften, vol. 317. Springer, Berlin (1998)"},{"key":"48_CR29","volume-title":"Nonlinear Optimization. No. v. 13 in Nonlinear Optimization","author":"AP Ruszczy\u0144ski","year":"2006","unstructured":"Ruszczy\u0144ski, A.P.: Nonlinear Optimization. No. v. 13 in Nonlinear Optimization. Princeton University Press, Princeton (2006)"},{"issue":"1","key":"48_CR30","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/040603875","volume":"16","author":"C Sagastiz\u00e1bal","year":"2005","unstructured":"Sagastiz\u00e1bal, C., Solodov, M.: An infeasible bundle method for nonsmooth convex constrained optimization without a penalty function or a filter. SIAM J. Optim. 16(1), 146\u2013169 (2005)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"48_CR31","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1137\/0802008","volume":"2","author":"H Schramm","year":"1992","unstructured":"Schramm, H., Zowe, J.: A version of the bundle idea for minimizing a nonsmooth function: conceptual idea, convergence analysis, numerical results. SIAM J. Optim. 2(1), 121\u2013152 (1992)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"48_CR32","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1023\/B:JOTA.0000005046.70410.02","volume":"119","author":"MV Solodov","year":"2003","unstructured":"Solodov, M.V.: On approximations with finite precision in bundle methods for nonsmooth optimization. J. Optim. Theory Appl. 119(1), 151\u2013165 (2003)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"48_CR33","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1137\/050647566","volume":"18","author":"MV Solodov","year":"2007","unstructured":"Solodov, M.V.: A bundle method for a class of bilevel nonsmooth convex minimization problems. SIAM J. Optim. 18(1), 242\u2013259 (2007)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"48_CR34","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."},{"key":"48_CR35","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BFb0120703","volume-title":"Nondifferentiable Optimization, Mathematical Programming Studies","author":"P Wolfe","year":"1975","unstructured":"Wolfe, P.: A method of conjugate subgradients for minimizing nondifferentiable functions. In: Balinski, M.L., Wolfe, P. (eds.) Nondifferentiable Optimization, Mathematical Programming Studies, vol. 3, pp. 145\u2013173. Springer, Berlin (1975)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-018-0048-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0048-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0048-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T15:39:43Z","timestamp":1694101183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-018-0048-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,27]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["48"],"URL":"https:\/\/doi.org\/10.1007\/s10589-018-0048-5","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2018,11,27]]},"assertion":[{"value":"20 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}