{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T10:52:41Z","timestamp":1656586361219},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,3,18]],"date-time":"2014-03-18T00:00:00Z","timestamp":1395100800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s10957-014-0534-6","type":"journal-article","created":{"date-parts":[[2014,3,18]],"date-time":"2014-03-18T04:30:58Z","timestamp":1395117058000},"page":"733-754","source":"Crossref","is-referenced-by-count":11,"title":["A New Nonsmooth Trust Region Algorithm for Locally Lipschitz Unconstrained Optimization Problems"],"prefix":"10.1007","volume":"164","author":[{"given":"Z.","family":"Akbari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Yousefpour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Reza Peyghami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,3,18]]},"reference":[{"key":"534_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-82118-9","volume-title":"Minimization Methods for Non-differentiable Functions","author":"NZ Shor","year":"1985","unstructured":"Shor, N.Z.: Minimization Methods for Non-differentiable Functions. Springer, Berlin (1985)"},{"key":"534_CR2","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1137\/S1052623498342186","volume":"13","author":"A Frangioni","year":"2003","unstructured":"Frangioni, A.: Generalized bundle methods. SIAM J. Optim. 13, 117\u2013156 (2003)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"534_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/10556780290027828","volume":"17","author":"M Makela","year":"2002","unstructured":"Makela, M.: Survey of bundle methods for nonsmooth optimization. Optim. Methods Softw. 17(1), 1\u201329 (2002)","journal-title":"Optim. Methods Softw."},{"key":"534_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-06409-2","volume-title":"Convex Analysis and Minimization Algorithms II: Advanced Theory and Bundle Methods","author":"JB Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J.B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms II: Advanced Theory and Bundle Methods. Springer, Berlin (1993)"},{"key":"534_CR5","doi-asserted-by":"crossref","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, 121\u2013152 (1992)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"534_CR6","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1023\/B:JOTA.0000006684.67437.c3","volume":"119","author":"E Polak","year":"2003","unstructured":"Polak, E., Royset, J.: Algorithms for finite and semi-infinite minmaxmin problems using adaptive smoothing techniques. J. Optim. Theory Appl. 119(3), 421\u2013457 (2003)","journal-title":"J. Optim. Theory Appl."},{"key":"534_CR7","doi-asserted-by":"crossref","first-page":"2567","DOI":"10.1023\/A:1023227716953","volume":"115","author":"AM Bagirov","year":"2003","unstructured":"Bagirov, A.M.: Continuous subdifferential approximations and their applications. J. Math. Sci. 115, 2567\u20132609 (2003)","journal-title":"J. Math. Sci."},{"issue":"1","key":"534_CR8","first-page":"373","volume":"83","author":"L Lukan","year":"1998","unstructured":"Lukan, L., Vlcek, J.: A bundle-newton method for nonsmooth unconstrained minimization. Math. Program. 83(1), 373\u2013391 (1998)","journal-title":"Math. Program."},{"key":"534_CR9","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1023\/A:1011990503369","volume":"111","author":"L Luksan","year":"2001","unstructured":"Luksan, L., Vlcek, J.: Globally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization. J. Optim. Theory Appl. 111, 407\u2013430 (2001)","journal-title":"J. Optim. Theory Appl."},{"key":"534_CR10","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s10107-012-0514-2","volume":"141","author":"AS Lewis","year":"2013","unstructured":"Lewis, A.S., Overton, M.L.: Nonsmooth optimization via quasi-Newton methods. Math. Program. Ser. A 141, 135\u2013163 (2013)","journal-title":"Math. Program. Ser. A"},{"key":"534_CR11","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1137\/030601296","volume":"15","author":"J Burke","year":"2005","unstructured":"Burke, J., Lewis, A., Overton, M.: A robust gradient sampling algorithm for nonsmooth, nonconvex optimization. SIAM J. Optim. 15, 571\u2013779 (2005)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"534_CR12","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1137\/050639673","volume":"18","author":"KC Kiwiel","year":"2007","unstructured":"Kiwiel, K.C.: Convergence of the gradient sampling algorithm for nonsmooth nonconvex optimization. SIAM J. Optim. 18(2), 379\u2013388 (2007)","journal-title":"SIAM J. Optim."},{"issue":"12","key":"534_CR13","doi-asserted-by":"crossref","first-page":"1491","DOI":"10.1080\/02331934.2012.687736","volume":"61","author":"N Karmitsa","year":"2012","unstructured":"Karmitsa, N., Bagirov, A.: Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization. Optimization 61(12), 1491\u20131509 (2012)","journal-title":"Optimization"},{"key":"534_CR14","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719857","volume-title":"Trust-Region Methods","author":"A Conn","year":"2000","unstructured":"Conn, A., Gould, N., Toint, PhL: Trust-Region Methods. Society for Industrial and Applied Mathematics, Philadelphia (2000)"},{"key":"534_CR15","doi-asserted-by":"crossref","unstructured":"Kiwiel, K.: Methods of Descent for Nondifferentiable Optimization. Lecture Notes in Mathematics, vol. 1133. Springer, Berlin (1985)","DOI":"10.1007\/BFb0074500"},{"key":"534_CR16","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BFb0120959","volume":"17","author":"R Fletcher","year":"1982","unstructured":"Fletcher, R.: A model algorithm for composite nondifferentiable optimization problem. Math. Program. Studies 17, 67\u201376 (1982)","journal-title":"Math. Program. Studies"},{"key":"534_CR17","unstructured":"Fletcher, R.: An $$\\ell _1$$ \u2113 1 -penalty method for nonlinear constraints. In: Boggs, P.T., Byrd, R.H., Schnabel, R.B. (eds.) Numerical Optimization, pp. 26\u201340. SIAM, Philadelphia (1984)"},{"key":"534_CR18","unstructured":"Powell, M.: General algorithms for discrete nonlinear approximation calculations. In: Chui, C.K., Schumaker, L.L., Wards, J.D. (eds.) Approximation Theory IV, pp. 187\u2013218. Academic Press, London (1983)"},{"key":"534_CR19","unstructured":"Yuan, Y.: Global convergence of trust region algorithms for nonsmooth optimization. Techical Report DAMTP1983\/NA13, Department of Applied Mathematics and Theoretical Physics, Cambridge University (1983)"},{"key":"534_CR20","doi-asserted-by":"crossref","first-page":"1312","DOI":"10.1287\/mnsc.31.10.1312","volume":"31","author":"J Zhang","year":"1985","unstructured":"Zhang, J., Kim, N., Lasdon, L.: An improved successive linear programming algorithm. Manag. Sci. 31, 1312\u20131331 (1985)","journal-title":"Manag. Sci."},{"key":"534_CR21","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1137\/0908024","volume":"8","author":"I Duff","year":"1987","unstructured":"Duff, I., Nocedal, J., Reid, J.: The use of linear programming for the solution of sparse sets of nonlinear equations. SIAM J. Sci. Stat. Comput. 8, 99\u2013108 (1987)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"534_CR22","unstructured":"Hallabi, M.E., Tapia, R.: A global convergence theory for arbitraty norm trust region methods for nonlinear equations. Mathematical Sciences Technical Report, TR 87\u201325, Rice University, Houston, TX (1987)"},{"key":"534_CR23","volume-title":"Optim. Nonsmooth Anal.","author":"F Clarke","year":"1987","unstructured":"Clarke, F.: Optim. Nonsmooth Anal. Society for Industrial and Applied Mathematics, Philadelphia (1987)"},{"key":"534_CR24","first-page":"319","volume":"68","author":"J Dennis","year":"1995","unstructured":"Dennis, J., Li, S., Tapia, R.: A unified approach to global convergence of trust region methods for nonsmooth optimization. Math. Program. 68, 319\u2013346 (1995)","journal-title":"Math. Program."},{"key":"534_CR25","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF01581136","volume":"66","author":"L Qi","year":"1994","unstructured":"Qi, L., Sun, J.: A trust region algorithm for minimization of locally Lipschitzian functions. Math. Program. 66, 25\u201343 (1994)","journal-title":"Math. Program."},{"key":"534_CR26","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF01584320","volume":"13","author":"A Goldstein","year":"1977","unstructured":"Goldstein, A.: Optimization of Lipschitz continuous functions. Math. Program. 13, 14\u201322 (1977)","journal-title":"Math. Program."},{"key":"534_CR27","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1137\/0311049","volume":"11","author":"D Bertsekas","year":"1973","unstructured":"Bertsekas, D., Mitter, S.: A descent numerical method for optimization problems with nondifferentiable cost functionals. SIAM J. Control Optim. 11, 637\u2013652 (1973)","journal-title":"SIAM J. Control Optim."},{"issue":"2","key":"534_CR28","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/BF01583790","volume":"23","author":"M Gaudioso","year":"1982","unstructured":"Gaudioso, M., Monaco, M.: A bundle type approach to the unconstrained minimization of convex nonsmooth functions. Math. Program. 23(2), 216\u2013226 (1982)","journal-title":"Math. Program."},{"key":"534_CR29","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/s10957-012-0024-7","volume":"155","author":"N Mahdavi-Amiri","year":"2012","unstructured":"Mahdavi-Amiri, N., Yousefpour, R.: An effective nonsmooth optimization algorithm for locally Lipschitz functions. J. Optim. Theory Appl. 155, 180\u2013195 (2012)","journal-title":"J. Optim. Theory Appl."},{"key":"534_CR30","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 non-differentiable functions. Math. Program. Studies 3, 145\u2013173 (1975)","journal-title":"Math. Program. Studies"},{"key":"534_CR31","doi-asserted-by":"crossref","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization, 2nd edn. Springer, Berlin (1999)","DOI":"10.1007\/b98874"},{"key":"534_CR32","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E Dolan","year":"2002","unstructured":"Dolan, E., More, J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"534_CR33","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10107-006-0728-2","volume":"109","author":"N Haarala","year":"2007","unstructured":"Haarala, N., Miettinen, K., M\u00e4kel\u00e4, M.: Globally convergent limited memory bundle method for large-scale nonsmooth optimization. Math. Program. 109, 181\u2013205 (2007)","journal-title":"Math. Program."},{"key":"534_CR34","unstructured":"Luksan, L., Tuma, M., Siska, M., Vlcek, J., Ramesova, N.: UFO 2002: interactive system for universal functional optimization. Technical Report, Academy of Sciences of the Czech Republic (2002). Available online at http:\/\/www.cs.cas.cz\/luksan\/ufo"},{"key":"534_CR35","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1023\/A:1022650107080","volume":"102","author":"L Luksan","year":"1999","unstructured":"Luksan, L., Vlcek, J.: Globally convergent variable metric method for convex nonsmooth unconstrained minimization. J. Optim. Theory Appl. 102, 593\u2013613 (1999)","journal-title":"J. Optim. Theory Appl."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-014-0534-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-014-0534-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-014-0534-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:58:37Z","timestamp":1559469517000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-014-0534-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,18]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["534"],"URL":"https:\/\/doi.org\/10.1007\/s10957-014-0534-6","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,18]]}}}