{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:44:51Z","timestamp":1740141891299,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T00:00:00Z","timestamp":1557100800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002398","name":"Sharif University of Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002398","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s10288-019-00404-2","type":"journal-article","created":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T16:26:49Z","timestamp":1557160009000},"page":"73-90","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A conjugate gradient sampling method for nonsmooth optimization"],"prefix":"10.1007","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2763-4279","authenticated-orcid":false,"given":"N.","family":"Mahdavi-Amiri","sequence":"first","affiliation":[]},{"given":"M.","family":"Shaeiri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,6]]},"reference":[{"key":"404_CR1","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1016\/j.ejor.2009.11.030","volume":"204","author":"N Andrei","year":"2010","unstructured":"Andrei N (2010) Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization. Eur. J. Oper. Res. 204:410\u2013420","journal-title":"Eur. J. Oper. Res."},{"key":"404_CR2","first-page":"39","volume-title":"Numerical Methods for Nonlinear Optimization","author":"EML Beale","year":"1972","unstructured":"Beale EML (1972) A derivation of conjugate gradients. In: Lootsma FA (ed) Numerical Methods for Nonlinear Optimization. Academic Press, London, pp 39\u201343"},{"key":"404_CR3","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1137\/030601296","volume":"15","author":"JV Burke","year":"2005","unstructured":"Burke JV, Lewis AS, Overton ML (2005) A robust gradient sampling algorithm for nonsmooth nonconvex optimization. SIAM J. Optim. 15:751\u2013779","journal-title":"SIAM J. Optim."},{"key":"404_CR4","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s101070050059","volume":"85","author":"X Chen","year":"1999","unstructured":"Chen X, Fukushima M (1999) Proximal quasi-Newton methods for nondifferentiable convex optimization. Math. Program. 85:313\u2013334","journal-title":"Math. Program."},{"key":"404_CR5","series-title":"Canadian Mathematical Society Series of Monographs and Advanced Texts","volume-title":"Optimization and Nonsmooth Analysis","author":"FH Clarke","year":"1983","unstructured":"Clarke FH (1983) Optimization and Nonsmooth Analysis. Canadian Mathematical Society Series of Monographs and Advanced Texts. Wiley, New York"},{"key":"404_CR6","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1137\/090780201","volume":"22","author":"FE Curtis","year":"2012","unstructured":"Curtis FE, Overton ML (2012) A sequential quadratic programming method for nonconvex nonsmooth constrained optimization. SIAM J. Optim. 22:474\u2013500","journal-title":"SIAM J. Optim."},{"key":"404_CR7","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1080\/10556788.2012.714781","volume":"28","author":"FE Curtis","year":"2013","unstructured":"Curtis FE, Que X (2013) An adaptive gradient sampling algorithm for nonsmooth optimization. Optim. Methods Softw. 28:1302\u20131324","journal-title":"Optim. Methods Softw."},{"key":"404_CR8","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1137\/080729864","volume":"20","author":"A Daniilidis","year":"2009","unstructured":"Daniilidis A, Sagastiz\u00e1bal C, Solodov M (2009) Identifying structure of nonsmooth convex functions by the bundle techniques. SIAM J. Optim. 20:820\u2013840","journal-title":"SIAM J. Optim."},{"key":"404_CR9","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E Dolan","year":"2002","unstructured":"Dolan E, Mor\u00e9 J (2002) Benchmarking optimization software with performance profiles. Math. Program. 91:201\u2013213","journal-title":"Math. Program."},{"key":"404_CR10","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF01584320","volume":"13","author":"AA Goldstein","year":"1977","unstructured":"Goldstein AA (1977) Optimization of Lipschitz continuous functions. Math. Program. 13:14\u201322","journal-title":"Math. Program."},{"key":"404_CR11","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1080\/10556780410001689225","volume":"19","author":"M Haarala","year":"2004","unstructured":"Haarala M, Miettinen K, M\u00e4kel\u00e4 MM (2004) New limited memory bundle method for large-scale nonsmooth optimization. Optim. Methods Softw. 19:673\u2013692","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"404_CR12","first-page":"382","volume":"198","author":"N Karmitsa","year":"2008","unstructured":"Karmitsa N, M\u00e4kel\u00e4 MM, Ali MM (2008) Limited memory interior point bundle method for large inequality constrained nonsmooth minimization. Appl. Math. Comput. 198(1):382\u2013400","journal-title":"Appl. Math. Comput."},{"key":"404_CR13","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1137\/050639673","volume":"18","author":"KC Kiwiel","year":"2007","unstructured":"Kiwiel KC (2007) Convergence of the gradient sampling algorithm for nonsmooth nonconvex optimization. SIAM J. Optim. 18:379\u2013388","journal-title":"SIAM J. Optim."},{"key":"404_CR14","doi-asserted-by":"publisher","first-page":"1983","DOI":"10.1137\/090748408","volume":"20","author":"KC Kiwiel","year":"2010","unstructured":"Kiwiel KC (2010) A nonderivative version of the gradient sampling algorithm for nonsmooth nonconvex optimization. SIAM J. Optim. 20:1983\u20131994","journal-title":"SIAM J. Optim."},{"key":"404_CR15","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10107-012-0514-2","volume":"141","author":"AS Lewis","year":"2013","unstructured":"Lewis AS, Overton ML (2013) Nonsmooth optimization via quasi-Newton methods. Math. Program. 141:135\u2013163","journal-title":"Math. Program."},{"key":"404_CR16","unstructured":"Luk\u0161an, L., Tuma, M., Siska, M., Vl\u010dek, J., Ramesova, N.: Interactive system for universal functional optimization. Technical Report UFO 2002\/No. 883, Academy of Science of the Czech Republic, Czech Republic (2002)"},{"key":"404_CR17","unstructured":"Luk\u0161an, L., Vl\u010dek, J.: Test problems for nonsmooth unconstrained and linearly constrained optimization. Technical Report No. 798, Academy of Science of the Czech Republic, Czech Republic (2000)"},{"key":"404_CR18","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/s10957-012-0024-7","volume":"155","author":"N Mahdavi-Amiri","year":"2012","unstructured":"Mahdavi-Amiri N, Yousefpour R (2012) An effective nonsmooth optimization algorithm for locally Lipschitz functions. J. Optim. Theory Appl. 155:180\u2013195","journal-title":"J. Optim. Theory Appl."},{"key":"404_CR19","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s10107-005-0630-3","volume":"104","author":"R Mifflin","year":"2005","unstructured":"Mifflin R, Sagastiz\u00e1bal C (2005) A VU-algorithm for convex minimization. Math. Program. 104:583\u2013608","journal-title":"Math. Program."},{"key":"404_CR20","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal J, Wright SJ (2006) Numerical Optimization, 2nd edn. Springer, New York","edition":"2"},{"key":"404_CR21","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1287\/moor.3.3.244","volume":"3","author":"DF Shanno","year":"1978","unstructured":"Shanno DF (1978) Conjugate gradient methods with inexact searches. Math. Oper. Res. 3:244\u2013256","journal-title":"Math. Oper. Res."},{"key":"404_CR22","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1137\/0715085","volume":"15","author":"DF Shanno","year":"1978","unstructured":"Shanno DF (1978) On the convergence of a new conjugate gradient algorithm. SIAM J. Numer. Anal. 15:1247\u20131257","journal-title":"SIAM J. Numer. Anal."},{"key":"404_CR23","volume-title":"Limited memory BFGS for Nonsmooth Optimization","author":"A Skajaa","year":"2010","unstructured":"Skajaa A (2010) Limited memory BFGS for Nonsmooth Optimization. New York University, New York"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-019-00404-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-019-00404-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-019-00404-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T23:22:52Z","timestamp":1588634572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-019-00404-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,6]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["404"],"URL":"https:\/\/doi.org\/10.1007\/s10288-019-00404-2","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"type":"print","value":"1619-4500"},{"type":"electronic","value":"1614-2411"}],"subject":[],"published":{"date-parts":[[2019,5,6]]},"assertion":[{"value":"27 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}