{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T13:19:11Z","timestamp":1648819151396},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,11,12]],"date-time":"2010-11-12T00:00:00Z","timestamp":1289520000000},"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":[[2011,3]]},"DOI":"10.1007\/s10957-010-9766-2","type":"journal-article","created":{"date-parts":[[2010,11,11]],"date-time":"2010-11-11T20:04:40Z","timestamp":1289505880000},"page":"528-549","source":"Crossref","is-referenced-by-count":8,"title":["Globally Convergent Cutting Plane Method for\u00a0Nonconvex Nonsmooth Minimization"],"prefix":"10.1007","volume":"148","author":[{"given":"Napsu","family":"Karmitsa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Tanaka\u00a0Filho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Herskovits","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,11,12]]},"reference":[{"key":"9766_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.: Newton\u2019s method for convex programming and Tchebycheff approximation. Numer. Math. 1, 253\u2013268 (1959)","journal-title":"Numer. Math."},{"key":"9766_CR2","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0108053","volume":"8","author":"J.E. Kelley","year":"1960","unstructured":"Kelley, 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":"9766_CR3","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1023\/A:1021752227797","volume":"99","author":"J. Herskovits","year":"1998","unstructured":"Herskovits, J.: Feasible direction interior-point technique for nonlinear optimization. J. Optim. Theory Appl. 99(1), 121\u2013146 (1998)","journal-title":"J. Optim. Theory Appl."},{"key":"9766_CR4","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0074500","volume-title":"Methods of Descent for Nondifferentiable Optimization","author":"K.C. Kiwiel","year":"1985","unstructured":"Kiwiel, K.C.: Methods of Descent for Nondifferentiable Optimization. Lecture Notes in Mathematics, vol.\u00a01133. Springer, Berlin (1985)"},{"key":"9766_CR5","doi-asserted-by":"crossref","DOI":"10.1142\/1493","volume-title":"Nonsmooth Optimization: Analysis and Algorithms with Applications to Optimal Control","author":"M.M. M\u00e4kel\u00e4","year":"1992","unstructured":"M\u00e4kel\u00e4, M.M., Neittaanm\u00e4ki, P.: Nonsmooth Optimization: Analysis and Algorithms with Applications to Optimal Control. World Scientific, Singapore (1992)"},{"issue":"1","key":"9766_CR6","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(1), 121\u2013152 (1992)","journal-title":"SIAM J. Optim."},{"key":"9766_CR7","unstructured":"Herskovits, J., Freire, W., Tanaka\u00a0Filho, M.: A feasible directions method for nonsmooth convex optimization. Technical Report, Mechanical Engineering Program-COPPE\/UFRJ, Rio de Janeiro, julho (2009). Available in web page http:\/\/www.optimization-online.org\/DB_HTML\/2010\/01\/2517.html (January 11th, 2010)"},{"key":"9766_CR8","unstructured":"Passarela, W.: An algorithm of feasible directions to nonsmooth convex optimization (in Portuguese). PhD thesis, COPPE\u2014Federal University of Rio de Janeiro, Mechanical Engineering Program, Rio de Janeiro, Brazil (2005)"},{"key":"9766_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-06409-2","volume-title":"Convex Analysis and Minimization Algorithms II","author":"J.-B. Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms II. Springer, Berlin (1993)"},{"issue":"1","key":"9766_CR10","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1080\/10556780410001648112","volume":"19","author":"A. Fuduli","year":"2004","unstructured":"Fuduli, A., Gaudioso, M., Giallombardo, G.: A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization. Optim. Methods Softw. 19(1), 89\u2013102 (2004)","journal-title":"Optim. Methods Softw."},{"key":"9766_CR11","volume-title":"Optimization and Nonsmooth Analysis","author":"F.H. Clarke","year":"1983","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley, New York (1983)"},{"issue":"1","key":"9766_CR12","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1137\/S1052623401392123","volume":"14","author":"A.L. Tits","year":"2003","unstructured":"Tits, A.L., W\u00e4chter, A., Bakhtiari, S., Urban, T.J., Lawrence, C.T.: A primal-dual interior-point method for nonlinear programming with strong global and local convergence properties. SIAM J. Optim. 14(1), 173\u2013199 (2003)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"9766_CR13","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1137\/0326046","volume":"26","author":"E.R. Panier","year":"1988","unstructured":"Panier, E.R., Tits, A.L., Herskovits, J.N.: A QP-free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization. SIAM J. Control Optim. 26(4), 788\u2013811 (1988)","journal-title":"SIAM J. Control Optim."},{"key":"9766_CR14","unstructured":"Luk\u0161an, L., Vl\u010dek, J.: Test problems for nonsmooth unconstrained and linearly constrained optimization. Technical Report 798, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague (2000)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-010-9766-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-010-9766-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-010-9766-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:55:09Z","timestamp":1559469309000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-010-9766-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,12]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["9766"],"URL":"https:\/\/doi.org\/10.1007\/s10957-010-9766-2","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,12]]}}}