{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T20:17:24Z","timestamp":1772396244023,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,7,18]],"date-time":"2015-07-18T00:00:00Z","timestamp":1437177600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10107-015-0934-x","type":"journal-article","created":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T13:30:44Z","timestamp":1437139844000},"page":"383-415","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["On Lipschitz optimization based on gray-box piecewise linearization"],"prefix":"10.1007","volume":"158","author":[{"given":"Andreas","family":"Griewank","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Walther","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sabrina","family":"Fiege","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torsten","family":"Bosse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,18]]},"reference":[{"key":"934_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-80083-1","volume-title":"Numerische Verfahren der konvexen, nichtglatten Optimierung. Eine anwendungsorientierte Einf\u00fchrung","author":"W Alt","year":"2004","unstructured":"Alt, W.: Numerische Verfahren der konvexen, nichtglatten Optimierung. Eine anwendungsorientierte Einf\u00fchrung. Teubner, Leipzig (2004)"},{"key":"934_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69512-4","volume-title":"Differential Inclusions. Set-Valued Maps and Viability Theory","author":"J-P Aubin","year":"1984","unstructured":"Aubin, J.-P., Arriga, C.: Differential Inclusions. Set-Valued Maps and Viability Theory. Springer, Berlin (1984)"},{"key":"934_CR3","volume-title":"Numerical Optimization. Theoretical and Practical Aspects. Transl. from the French. 2nd revised edn.","author":"F Bonnans","year":"2006","unstructured":"Bonnans, F., Gilbert, J.C., Lemar\u00e9chal, C., Sagastiz\u00e1bal, C.: Numerical Optimization. Theoretical and Practical Aspects. Transl. from the French. 2nd revised edn. Springer, Berlin (2006)"},{"key":"934_CR4","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971309","volume-title":"Optimization and Nonsmooth Analysis","author":"F Clarke","year":"1990","unstructured":"Clarke, F.: Optimization and Nonsmooth Analysis. SIAM, Philadelphia (1990)"},{"issue":"3","key":"934_CR5","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1137\/S1052623401397242","volume":"13","author":"R Cominetti","year":"2002","unstructured":"Cominetti, R., Courdurier, M.: Coupling general penalty schemes for convex programming with the steepest descent and the proximal point algorithm. SIAM J. Optim. 13(3), 745\u2013765 (2002)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"934_CR6","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1590\/0101-7438.2014.034.03.0647","volume":"34","author":"W Oliveira de","year":"2014","unstructured":"de Oliveira, W., Sagastiz\u00e1bal, C.: Bundle methods in the XXIst century: a birds\u2019-eye view. Pesquisa Operacional 34(3), 647\u2013670 (2014)","journal-title":"Pesquisa Operacional"},{"key":"934_CR7","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1002\/pamm.201210304","volume":"12","author":"S Fiege","year":"2012","unstructured":"Fiege, S., Griewank, A., Walther, A.: An exploratory line search for piecewise differentiable objective functions based on algorithmic differentiation. PAMM 12, 631\u2013632 (2012)","journal-title":"PAMM"},{"key":"934_CR8","doi-asserted-by":"crossref","unstructured":"Fourer, R.: A simplex algorithm for piecewise-linear programming. I. Derivation and proof. Math. Program. 33, 204\u2013233 (1985)","DOI":"10.1007\/BF01582246"},{"key":"934_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco (1979)"},{"key":"934_CR10","doi-asserted-by":"crossref","unstructured":"Goffin, J.-L.: Subgradient optimization in nonsmooth optimization (including the soviet revolution). Doc. Math. Extra Vol., 277\u2013290 (2012)","DOI":"10.4171\/dms\/6\/30"},{"issue":"6","key":"934_CR11","doi-asserted-by":"crossref","first-page":"1139","DOI":"10.1080\/10556788.2013.796683","volume":"28","author":"A Griewank","year":"2013","unstructured":"Griewank, A.: On stable piecewise linearization and generalized algorithmic differentiation. Opt. Meth. Softw. 28(6), 1139\u20131178 (2013)","journal-title":"Opt. Meth. Softw."},{"key":"934_CR12","unstructured":"Griewank, A., Bernt, J.-U., Randons, M., Streubel, T.: Solving Piecewise Linear Equations in abs-normal Form. Technical report, Humboldt Universit\u00e4t zu Berlin (2013). To appear in Linear Algebra and its Applications"},{"key":"934_CR13","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717761","volume-title":"Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation","author":"A Griewank","year":"2008","unstructured":"Griewank, A., Walther, A.: Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation. SIAM, Philadelphia (2008)"},{"key":"934_CR14","unstructured":"Fiege, S., Griewank, A., Kulshreshta, K., Walther, A.: An algorithm for nonsmooth optimization by successive piecewise linearization. Technical report, HU Berlin (2015)"},{"issue":"3","key":"934_CR15","doi-asserted-by":"crossref","first-page":"1282","DOI":"10.1016\/j.na.2011.07.062","volume":"75","author":"M G\u00fcrb\u00fczbalaban","year":"2012","unstructured":"G\u00fcrb\u00fczbalaban, M., Overton, M.L.: On Nesterov\u2019s nonsmooth Chebyshev\u2013Rosenbrock functions. Nonlinear Anal.: Theory Methods Appl. 75(3), 1282\u20131289 (2012)","journal-title":"Nonlinear Anal.: Theory Methods Appl."},{"issue":"1","key":"934_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10589-013-9547-6","volume":"56","author":"W Hare","year":"2013","unstructured":"Hare, W., Nutini, J.: A derivative-free approximate gradient sampling algorithm for finite minimax problems. Comput. Optim. Appl. 56(1), 1\u201338 (2013)","journal-title":"Comput. Optim. Appl."},{"key":"934_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02796-7","volume-title":"Convex Analysis and Minimization Algorithms I","author":"J-B Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms I. Springer, Berlin (1993)"},{"issue":"6","key":"934_CR18","doi-asserted-by":"crossref","first-page":"895","DOI":"10.1080\/10556780902842495","volume":"25","author":"N Karmitsa","year":"2010","unstructured":"Karmitsa, N., M\u00e4kel\u00e4, M.: Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis. Optim. Methods Softw. 25(6), 895\u2013916 (2010)","journal-title":"Optim. Methods Softw."},{"key":"934_CR19","unstructured":"Lemar\u00e9chal, C.: Nonsmooth Optimization and Descent Methods. Technical Report 78,4, IIASA (1978)"},{"issue":"3","key":"934_CR20","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.: Variable metric bundle methods: from conceptual to implementable forms. Math. Program. 76(3), 393\u2013410 (1997)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"934_CR21","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s10107-012-0514-2","volume":"141","author":"A Lewis","year":"2013","unstructured":"Lewis, A., Overton, M.: Nonsmooth optimization via quasi-Newton methods. Math. Program. 141(1\u20132), 135\u2013163 (2013)","journal-title":"Math. Program."},{"key":"934_CR22","doi-asserted-by":"crossref","unstructured":"Mifflin, R., Sagastiz\u00e1bal, C.: A science fiction story in nonsmooth optimization originating at IIASA. Doc. Math. Extra Vol., 291\u2013300 (2012)","DOI":"10.4171\/dms\/6\/31"},{"issue":"2\u20133","key":"934_CR23","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1007\/s10107-005-0633-0","volume":"104","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Lexicographic differentiation of nonsmooth functions. Math. Program. 104(2\u20133), 669\u2013700 (2005)","journal-title":"Math. Program."},{"key":"934_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-4340-7","volume-title":"Introduction to Piecewise Differentiable Functions","author":"S Scholtes","year":"2012","unstructured":"Scholtes, S.: Introduction to Piecewise Differentiable Functions. Springer, Berlin (2012)"},{"issue":"3","key":"934_CR25","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1051\/cocv\/2009021","volume":"16","author":"J Shen","year":"2010","unstructured":"Shen, J., Han, L., Pang, J.S.: Switching and stability properties of conewise linear systems. ESAIM: Control Optim. Calc. Var. 16(3), 764\u2013793 (2010)","journal-title":"ESAIM: Control Optim. Calc. Var."},{"key":"934_CR26","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, N.Z.: Nondifferentiable Optimization and Polynomial Problems. Kluwer, Dordrecht (1998)"},{"key":"934_CR27","doi-asserted-by":"crossref","unstructured":"Walther, A., Griewank, A.: Combinatorial Scientific Computing. Chapter Getting Started with ADOL-C, pp. 181\u2013202. Chapman-Hall CRC Computational Science (2012)","DOI":"10.1201\/b11644-8"},{"key":"934_CR28","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BFb0120703","volume":"3","author":"P Wolfe","year":"1975","unstructured":"Wolfe, P.: A method of conjugate subgradients for minimizing nondifferentiable functions. Math. Program. Stud. 3, 145\u2013173 (1975)","journal-title":"Math. Program. Stud."},{"issue":"1","key":"934_CR29","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s10589-012-9485-8","volume":"54","author":"G Yuan","year":"2012","unstructured":"Yuan, G., Wei, Z., Wang, Z.: Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex optimization. Comp. Opt. Appl. 54(1), 45\u201364 (2012)","journal-title":"Comp. Opt. Appl."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0934-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-015-0934-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0934-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,12]],"date-time":"2023-08-12T08:35:23Z","timestamp":1691829323000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-015-0934-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,18]]},"references-count":29,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["934"],"URL":"https:\/\/doi.org\/10.1007\/s10107-015-0934-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,18]]}}}