{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T04:09:47Z","timestamp":1769573387375,"version":"3.49.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2007,4,28]],"date-time":"2007-04-28T00:00:00Z","timestamp":1177718400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2009,1]]},"DOI":"10.1007\/s10107-007-0123-7","type":"journal-article","created":{"date-parts":[[2007,4,27]],"date-time":"2007-04-27T13:52:09Z","timestamp":1177681929000},"page":"297-320","source":"Crossref","is-referenced-by-count":55,"title":["A bundle-filter method for nonsmooth convex constrained optimization"],"prefix":"10.1007","volume":"116","author":[{"given":"Elizabeth","family":"Karas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ademir","family":"Ribeiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudia","family":"Sagastiz\u00e1bal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikhail","family":"Solodov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,4,28]]},"reference":[{"key":"123_CR1","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1007\/BFb0121157","volume":"30","author":"A. Auslender","year":"1987","unstructured":"Auslender A. (1987). Numerical methods for nondifferentiable convex optimization. Math. Program. Study 30: 102\u2013126","journal-title":"Math. Program. Study"},{"key":"123_CR2","first-page":"3","volume":"79","author":"A. Auslender","year":"1997","unstructured":"Auslender A. (1997). How to deal with the unbounded in optimization: theory and algorithms. Math. Program. 79: 3\u201318","journal-title":"Math. Program."},{"key":"123_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-05078-1","volume-title":"Numerical Optimization. Theoretical and Practical Aspects. Universitext","author":"J.F. Bonnans","year":"2003","unstructured":"Bonnans J.F., Gilbert J.-Ch., Lemar\u00e9chal C. and Sagastiz\u00e1bal C. (2003). Numerical Optimization. Theoretical and Practical Aspects. Universitext. Springer, Berlin"},{"key":"123_CR4","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1137\/S1052623499357258","volume":"13","author":"R. Fletcher","year":"2002","unstructured":"Fletcher R., Gould N., Leyffer S., Toint P. and W\u00e4chter A. (2002). Global convergence of trust-region and SQP-filter algorithms for general nonlinear programming. SIAM J. Optim. 13: 635\u2013659","journal-title":"SIAM J. Optim."},{"key":"123_CR5","unstructured":"Fletcher, R., Leyffer, S.: A bundle filter method for nonsmooth nonlinear optimization. Numerical Analysis Report NA\/195. Department of Mathematics, The University of Dundee, Scotland (1999)"},{"key":"123_CR6","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s101070100244","volume":"91","author":"R. Fletcher","year":"2002","unstructured":"Fletcher R. and Leyffer S. (2002). Nonlinear programming without a penalty function. Math. Program 91: 239\u2013269","journal-title":"Math. Program"},{"key":"123_CR7","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1137\/S105262340038081X","volume":"13","author":"R. Fletcher","year":"2002","unstructured":"Fletcher R., Leyffer S. and Toint P.L. (2002). On the global convergence of a filter-SQP algorithm. SIAM J. Optim. 13: 44\u201359","journal-title":"SIAM J. Optim."},{"key":"123_CR8","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":"123_CR9","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":"123_CR10","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1137\/S1052623401399320","volume":"14","author":"C.C. Gonzaga","year":"2003","unstructured":"Gonzaga C.C., Karas E.W. and Vanti M. (2003). A globally convergent filter method for nonlinear programming. SIAM J. Optim. 14: 646\u2013669","journal-title":"SIAM J. Optim."},{"key":"123_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02796-7","volume-title":"Convex Analysis and Minimization Algorithms. Number 305\u2013306 in Grund. der Math. Wiss","author":"J.-B. Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty J.-B. and Lemar\u00e9chal C. (1993). Convex Analysis and Minimization Algorithms. Number 305\u2013306 in Grund. der Math. Wiss. Springer, Heidelberg"},{"key":"123_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-48320-2","volume-title":"Test Examples for Nonlinear Programming Codes. Lecture Notes in Economics and Mathematical Systems, vol. 187","author":"W. Hock","year":"1981","unstructured":"Hock W. and Schittkowski K. (1981). Test Examples for Nonlinear Programming Codes. Lecture Notes in Economics and Mathematical Systems, vol. 187. Springer, Berlin"},{"key":"123_CR13","volume-title":"Methods of Descent for Nondifferentiable Optimization. Lecture Notes in Mathematics, vol. 1133","author":"K.C. Kiwiel","year":"1985","unstructured":"Kiwiel K.C. (1985). Methods of Descent for Nondifferentiable Optimization. Lecture Notes in Mathematics, vol. 1133. Springer, Berlin"},{"key":"123_CR14","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1093\/imanum\/5.1.111","volume":"5","author":"K.C. Kiwiel","year":"1985","unstructured":"Kiwiel K.C. (1985). An exact penalty function algorithm for nonsmooth convex constrained minimization problems. IMA J. Numer. Anal. 5: 111\u2013119","journal-title":"IMA J. Numer. Anal."},{"key":"123_CR15","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1093\/imanum\/6.2.137","volume":"6","author":"K.C. Kiwiel","year":"1986","unstructured":"Kiwiel K.C. (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":"123_CR16","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF01397543","volume":"51","author":"K.C. Kiwiel","year":"1987","unstructured":"Kiwiel K.C. (1987). A constraint linearization method for nondifferentiable convex minimization. Numer. Math. 51: 395\u2013414","journal-title":"Numer. Math."},{"key":"123_CR17","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF01582892","volume":"52","author":"K.C. Kiwiel","year":"1991","unstructured":"Kiwiel K.C. (1991). Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization. Math. Program. 52: 285\u2013302","journal-title":"Math. Program."},{"key":"123_CR18","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. and Nesterov Yu. (1995). New variants of bundle methods. Math. Program. 69: 111\u2013148","journal-title":"Math. Program."},{"key":"123_CR19","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/BF02614390","volume":"76","author":"C. Lemar\u00e9chal","year":"1997","unstructured":"Lemar\u00e9chal C. and Sagastiz\u00e1bal C. (1997). Variable metric bundle methods: from conceptual to implementable forms. Math Program 76: 393\u2013410","journal-title":"Math Program"},{"key":"123_CR20","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 linearly constrained nonlinear minimax approximation. Kybernetika 20: 445\u2013457","journal-title":"Kybernetika"},{"key":"123_CR21","doi-asserted-by":"crossref","unstructured":"Luk\u0161an, L., Vl\u010dek, J.: A bundle-Newton method for nonsmooth unconstrained minimization. Math. Program. 83(3, Ser. A):373\u2013391 (1998)","DOI":"10.1007\/BF02680566"},{"issue":"3","key":"123_CR22","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1023\/A:1022650107080","volume":"102","author":"L. Luk\u0161an","year":"1999","unstructured":"Luk\u0161an L. and Vl\u010dek J. (1999). Globally convergent variable metric method for convex nonsmooth unconstrained minimization. J. Optim. Theory Appl. 102(3): 593\u2013613","journal-title":"J. Optim. Theory Appl."},{"key":"123_CR23","unstructured":"Luk\u0161an, L., Vl\u010dek, J.: NDA: Algorithms for nondifferentiable optimization. Research Report V-797. Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague (2000)"},{"issue":"2","key":"123_CR24","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1145\/383738.383740","volume":"27","author":"L. Luk\u0161an","year":"2001","unstructured":"Luk\u0161an L. and Vl\u010dek J. (2001). Algorithm 811, NDA, http:\/\/www.netlib.org\/toms\/811. ACM Trans. Math. Softw. 27(2): 193\u2013213","journal-title":"ACM Trans. Math. Softw."},{"key":"123_CR25","volume-title":"Nonlinear Programming","author":"O.L. Mangasarian","year":"1969","unstructured":"Mangasarian O.L. (1969). Nonlinear Programming. McGraw-Hill, New York"},{"key":"123_CR26","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1287\/moor.2.2.191","volume":"2","author":"R. Mifflin","year":"1977","unstructured":"Mifflin R. (1977). An algorithm for constrained optimization with semismooth functions. Math. Oper. Res. 2: 191\u2013207","journal-title":"Math. Oper. Res."},{"key":"123_CR27","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 extension of Lemarechal\u2019s algorithm for nonsmooth minimization. Math. Program. Study 17: 77\u201390","journal-title":"Math. Program. Study"},{"key":"123_CR28","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1007\/BFb0121074","volume":"25","author":"M.J.D. Powell","year":"1985","unstructured":"Powell M.J.D. (1985). On the quadratic programming algorithm of Goldfarb and Idnani. Math. Program. Study 25: 46\u201361","journal-title":"Math. Program. Study"},{"key":"123_CR29","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1080\/02331930290019495","volume":"51","author":"P.A. Rey","year":"2002","unstructured":"Rey P.A. and Sagastiz\u00e1bal C. (2002). Dynamical adjustment of the prox-parameter in variable metric bundle methods. Optimization 51: 423\u2013447","journal-title":"Optimization"},{"key":"123_CR30","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/040603875","volume":"16","author":"C. Sagastiz\u00e1bal","year":"2005","unstructured":"Sagastiz\u00e1bal C. and Solodov M. (2005). An infeasible bundle method for nonsmooth convex constrained optimization without a penalty function or a filter. SIAM J. Optim. 16: 146\u2013169","journal-title":"SIAM J. Optim."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-007-0123-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-007-0123-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-007-0123-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T15:30:23Z","timestamp":1587483023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-007-0123-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,4,28]]},"references-count":30,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["123"],"URL":"https:\/\/doi.org\/10.1007\/s10107-007-0123-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,4,28]]}}}