{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T20:16:53Z","timestamp":1772396213818,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1007\/bf02680566","type":"journal-article","created":{"date-parts":[[2007,7,27]],"date-time":"2007-07-27T12:52:17Z","timestamp":1185540737000},"page":"373-391","source":"Crossref","is-referenced-by-count":56,"title":["A bundle-Newton method for nonsmooth unconstrained minimization"],"prefix":"10.1007","volume":"83","author":[{"given":"Ladislav","family":"Luk\u0161an","sequence":"first","affiliation":[]},{"given":"Jan","family":"Vl\u010dek","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02680566_CR1","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF01386389","volume":"1","author":"E.W. Cheney","year":"1959","unstructured":"Cheney, E.W., Goldstein, A.A., 1959. Newton's method for convex programming and Tchebycheff approximation. Numer. Math 1, 253\u2013268.","journal-title":"Numer. Math"},{"key":"BF02680566_CR2","volume-title":"Optimization and Nonsmooth Analysis","author":"F.H. Clarke","year":"1983","unstructured":"Clarke, F.H., 1983. Optimization and Nonsmooth Analysis. Wiley-Interscience, New York."},{"key":"BF02680566_CR3","volume-title":"Practical Methods of Optimization","author":"R. Fletcher","year":"1987","unstructured":"Fletcher, R., 1987. Practical Methods of Optimization. Wiley, Chichester."},{"key":"BF02680566_CR4","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF01585529","volume":"7","author":"P.E. Gill","year":"1974","unstructured":"Gill, P.E., Murray, W., 1974. Newton-type methods for unconstrained and linearly constrained optimization. Math. Programming 7, 311\u2013350.","journal-title":"Math. Programming"},{"key":"BF02680566_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-06409-2","volume-title":"Convex Analysis and Minimization Algorithms I, II","author":"J.B. Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J.B., Lemarechal, C., 1993. Convex Analysis and Minimization Algorithms I, II. Springer, Berlin."},{"key":"BF02680566_CR6","first-page":"703","volume":"8","author":"J.E. Kelley","year":"1960","unstructured":"Kelley, J.E., 1960. The cutting plane method for solving convex programs. SIAM J. 8, 703\u2013712.","journal-title":"SIAM J."},{"key":"BF02680566_CR7","volume-title":"Lecture Notes in Mathematics, vol. 1133","author":"K.C. Kiwiel","year":"1985","unstructured":"Kiwiel, K.C., 1985. Methods of descent for nondifferentiable optimization. In: Lecture Notes in Mathematics, vol. 1133, Springer, Berlin."},{"key":"BF02680566_CR8","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1137\/0327039","volume":"27","author":"K.C. Kiwiel","year":"1989","unstructured":"Kiwiel, K.C., 1989. An ellipsoid trust region bundle method for nonsmooth convex minimization. SIAM J. Control Optim. 27, 737\u2013757.","journal-title":"SIAM J. Control Optim."},{"key":"BF02680566_CR9","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1137\/0806013","volume":"6","author":"K.C. Kiwiel","year":"1996","unstructured":"Kiwiel, K.C., 1996. Restricted step and Levenberg-Marquardt techniques in proximal bundle methods for nonconvex nondifferentiable optimization. SIAM J. Optim. 6, 227\u2013249.","journal-title":"SIAM J. Optim."},{"key":"BF02680566_CR10","volume-title":"Nonsmooth optimization and descent methods, Report RR-78-4","author":"C. Lemarechal","year":"1978","unstructured":"Lemarechal, C., 1978. Nonsmooth optimization and descent methods, Report RR-78-4, International Institute for Applied System Analysis, Laxenburg, Austria."},{"key":"BF02680566_CR11","first-page":"445","volume":"20","author":"L. Luk\u0161an","year":"1984","unstructured":"Luk\u0161an, L., 1984. Dual method for solving a special problem of quadratic programming as a subproblem at lineary constrained nonlinear minimar approximation. Kybernetika 20, 445\u2013457.","journal-title":"Kybernetika"},{"key":"BF02680566_CR12","doi-asserted-by":"crossref","DOI":"10.1142\/1493","volume-title":"Nonsmooth Optimization","author":"M.M. M\u00e4kel\u00e4","year":"1992","unstructured":"M\u00e4kel\u00e4, M.M., Neittaanm\u00e4ki, P., 1992. Nonsmooth Optimization. World Scientific, London."},{"key":"BF02680566_CR13","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 Lemarechal's algorithm for nonsmooth minimization. Math. Programming Study 17, 77\u201390.","journal-title":"Math. Programming Study"},{"key":"BF02680566_CR14","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BFb0008905","volume-title":"System Modelling and Optimization","author":"R. Mifflin","year":"1984","unstructured":"Mifflin, R., 1984. Better than linear convergence and safeguarding in nonsmooth minimization. In: Thoft-Christensen, P. (Ed.), System Modelling and Optimization, Springer, New York, pp. 321\u2013330."},{"key":"BF02680566_CR15","first-page":"228","volume-title":"Nonsmooth Optimization Methods and Applications","author":"R. Mifflin","year":"1992","unstructured":"Mifflin, R., 1992. Ideas for developing a rapidly convergent algorithm for nonsmooth minimization. In: Gianessi, F. (Ed.), Nonsmooth Optimization Methods and Applications. Gordon and Breach, Amsterdam, pp. 228\u2013239."},{"key":"BF02680566_CR16","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."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02680566.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02680566\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02680566","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T11:52:31Z","timestamp":1558353151000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02680566"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["BF02680566"],"URL":"https:\/\/doi.org\/10.1007\/bf02680566","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}