{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:40:02Z","timestamp":1752378002176,"version":"3.41.2"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2001,4,1]],"date-time":"2001-04-01T00:00:00Z","timestamp":986083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,4,1]],"date-time":"2001-04-01T00:00:00Z","timestamp":986083200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[2001,4]]},"DOI":"10.1023\/a:1011272319638","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T04:18:21Z","timestamp":1040617101000},"page":"55-77","source":"Crossref","is-referenced-by-count":8,"title":["Limited Memory Space Dilation and Reduction Algorithms"],"prefix":"10.1007","volume":"19","author":[{"given":"Hanif D.","family":"Sherali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gyunghyun","family":"Choi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zafar","family":"Ansari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"332443_CR1","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF02591740","volume":"37","author":"E. Allen","year":"1987","unstructured":"E. Allen, R. Helgason, J. Kennington, and B. Shetty, \u201cA generalization of Polyak's convergence result for subgradient optimization, \u201d Mathematical Programming, vol. 37, pp. 309\u2013317, 1987.","journal-title":"Mathematical Programming"},{"key":"332443_CR2","volume-title":"Nonlinear Programming: Theory and Algorithms","author":"M.S. Bazaraa","year":"1993","unstructured":"M.S. Bazaraa, H.D. Sherali, and C.M. Shetty, Nonlinear Programming: Theory and Algorithms, 2nd edn., John Wiley & Sons: New York, 1993.","edition":"2nd edn."},{"key":"332443_CR3","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BFb0120697","volume":"3","author":"P.M. Camerini","year":"1975","unstructured":"P.M. Camerini, L. Fratta, and F. Maffioli, \u201cOn improving relaxation methods by modified gradient techniques, \u201d Mathematical Programming Study, vol. 3, pp. 26\u201334, 1975.","journal-title":"Mathematical Programming Study"},{"key":"332443_CR4","unstructured":"V.F. Demyanov and L.V. Vasilev, Nondifferentiable Optimization, Spring-Verlag, 1985."},{"key":"332443_CR5","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","volume":"7","author":"R. Fletcher","year":"1959","unstructured":"R. Fletcher and C.M. Reeves, \u201cFunction minimization by conjugate gradients, \u201d Computer Journal, vol. 7, pp. 149\u2013154, 1959.","journal-title":"Computer Journal"},{"key":"332443_CR6","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF01584346","volume":"13","author":"J.L. Goffin","year":"1977","unstructured":"J.L. Goffin, \u201cOn the convergence rate of the subgradient methods, \u201d Mathematical Programming, vol. 13, pp. 329\u2013347, 1977.","journal-title":"Mathematical Programming"},{"key":"332443_CR7","doi-asserted-by":"crossref","unstructured":"J.L. Goffin, \u201cConvergence Results in a Class of Variable Metric Subgradient Methods, \u201d in Nonlinear Programming, vol. 4, O.L. Mangasarian, R.R. Meyer, and S.M. Robinson (Eds.), 1980, pp. 283\u2013326.","DOI":"10.1016\/B978-0-12-468662-5.50016-1"},{"key":"332443_CR8","first-page":"403","volume":"29","author":"M.R. Hestenes","year":"1952","unstructured":"M.R. Hestenes and E. Stiefel, \u201cMethods of conjugate gradients for solving linear systems, \u201d Journal of Research, National Bureau of Standards, vol. 29, pp. 403\u2013439, 1952.","journal-title":"Journal of Research, National Bureau of Standards"},{"key":"332443_CR9","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF01594925","volume":"50","author":"S. Kim","year":"1991","unstructured":"S. Kim and H. Ahn, \u201cConvergence of a generalized subgradient method for nondifferentiable convex optimization, \u201d Mathematical Programming, vol. 50, pp. 75\u201380, 1991.","journal-title":"Mathematical Programming"},{"key":"332443_CR10","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0167-6377(87)90008-3","volume":"6","author":"S. Kim","year":"1987","unstructured":"S. Kim, S. Koh, and H. Ahn, \u201cTwo-direction subgradient method for nondifferentiable optimization problems, \u201d Operation Research Letters, vol. 6, pp. 43\u201346, 1987.","journal-title":"Operation Research Letters"},{"key":"332443_CR11","doi-asserted-by":"crossref","unstructured":"K.C. Kiwiel, Methods of Descent of Nondifferentiable Optimization, Springer-Verlag, 1985. Lecture Notes in Mathematics, No. 1133.","DOI":"10.1007\/BFb0074500"},{"key":"332443_CR12","first-page":"263","volume-title":"Mathematical Programming","author":"K.C. Kiwiel","year":"1989","unstructured":"K.C. Kiwiel, \u201cAsurvey of bundle methods for nondifferentiable optimization, \u201d in Mathematical Programming, M. Iri and K. Tanabe (Eds.), KTK Scientific Publishers: Tokyo, Japan, 1989, pp. 263\u2013282."},{"key":"332443_CR13","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01585731","volume":"46","author":"K.C. Kiwiel","year":"1990","unstructured":"K.C. Kiwiel, \u201cProximality control in bundle methods for convex nondifferentiable minimization, \u201d Mathematical Programming, vol. 46, pp. 105\u2013122, 1990.","journal-title":"Mathematical Programming"},{"key":"332443_CR14","first-page":"75","volume":"10","author":"K.C. Kiwiel","year":"1991","unstructured":"K.C. Kiwiel, \u201cA tilted cutting plane proximal bundle method for convex nondifferentiable optimization, \u201d OR Letters, vol. 10, pp. 75\u201381, 1991.","journal-title":"A tilted cutting plane proximal bundle method for convex nondifferentiable optimization"},{"key":"332443_CR15","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BFb0120700","volume":"3","author":"C. Lemarechal","year":"1975","unstructured":"C. Lemarechal, \u201cAn extension of Davidon methods to nondifferentiable problems, \u201d Mathematical Programming Study, vol. 3, pp. 95\u2013109, 1975.","journal-title":"Mathematical Programming Study"},{"key":"332443_CR16","unstructured":"C. Lemarechal, \u201cBundle method in nonsmooth optimization, \u201d in Nonsmooth Optimization: Proceedings of IIASA Workshop, C. Lemarechal and R. Mifflin (Eds.), 1978, pp. 79\u2013109."},{"key":"332443_CR17","unstructured":"C. Lemarechal, \u201cA view of line-search, \u201d in Lecture Notes in Control and Information Science, A. Auslender, W. Oettli, and J. Stoer (Eds.), Optimization and Optimal Control; Proceedings of a Conference Held at Oberwolfach, March 16\u201322, 1980, pp. 59\u201378."},{"key":"332443_CR18","unstructured":"C. Lemarechal, \u201cNumerical Experiments in Nonsmooth Optimization, \u201d in Progress in Nondifferentiable Optimization, E.A. Nurminski (Ed.), IIASA, 1982, pp. 61\u201384."},{"key":"332443_CR19","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0304-0208(08)72400-9","volume-title":"Fermat Days 85: Mathematics for Optimization, Hiriart-Urrurty (Ed.)","author":"C. Lemarechal","year":"1986","unstructured":"C. Lemarechal, \u201cConstructing bundle methods for convex optimization, \u201d in Fermat Days 85: Mathematics for Optimization, Hiriart-Urrurty (Ed.), Elsevier Science Publisher B.V.: North-Holland, 1986, pp. 201\u2013241."},{"key":"332443_CR20","volume-title":"Introduction to Linear and Nonlinear Programming","author":"D.G. Luenberger","year":"1984","unstructured":"D.G. Luenberger, Introduction to Linear and Nonlinear Programming, 2nd edn., Addison-Wesley: Reading, Mass, 1984.","edition":"2nd edn."},{"key":"332443_CR21","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1287\/moor.2.2.191","volume":"2","author":"R. Mifflin","year":"1977","unstructured":"R. Mifflin, \u201cAn algorithm for constrained optimization with semismooth functions, \u201d Mathematics of Operations Research, vol. 2, pp. 191\u2013207, 1977.","journal-title":"Mathematics of Operations Research"},{"key":"332443_CR22","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1137\/0716059","volume":"26","author":"J.L. Nazareth","year":"1979","unstructured":"J.L. Nazareth, \u201cA relationship between the BFGS and conjugate-gradient algorithms and its implications for new algorithms, \u201d SIAM Journal on Numerical Analysis, vol. 26, pp. 794\u2013800, 1979.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"332443_CR23","first-page":"109","volume":"1","author":"E.A. Nurminski","year":"1977","unstructured":"E.A. Nurminski and A.A. Zhelikhovskii, \u201c\"-Quasigradient method for solving nonsmooth extremal problems, \u201d Kibernetika, no. 1, pp. 109\u2013113, 1977.","journal-title":"Kibernetika"},{"key":"332443_CR24","first-page":"509","volume":"9","author":"B.T. Polyak","year":"1969","unstructured":"B.T. Polyak, \u201cMinimization of unsmooth functionals, \u201d Zh. Vychisl. Mat. I Mat. Fiz., vol. 9, pp. 509\u2013521, 1969 (Russian). English transl. in U.S.S.R. Comput. Math. and Math. Phys., vol. 9, pp. 14\u201329, 1969.","journal-title":"Zh. Vychisl. Mat. I Mat. Fiz."},{"key":"332443_CR25","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/363744.363779","volume":"8","author":"J. Rosen","year":"1965","unstructured":"J. Rosen and S. Suzuki, \u201cConstruction of nonlinear programming test problems, \u201d Communications of the ACM, vol. 8, p. 113, 1965.","journal-title":"Communications of the ACM"},{"issue":"1","key":"332443_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(99)00063-2","volume":"26","author":"H.D. Sherali","year":"2000","unstructured":"H.D. Sherali, G. Choi, and C.H. Tuncbilek, \u201cA variable target value method, \u201d Operations Research Letters, vol. 26, no. 1, pp. 1\u20138, 2000.","journal-title":"Operations Research Letters"},{"key":"332443_CR27","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0166-218X(88)90041-8","volume":"20","author":"H.D. Sherali","year":"1988","unstructured":"H.D. Sherali and D.C. Myers, \u201cDual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs, \u201d Discrete Applied Mathematics, vol. 20, pp. 51\u201368, 1988.","journal-title":"Discrete Applied Mathematics"},{"key":"332443_CR28","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01447654","volume":"20","author":"H.D. Sherali","year":"1989","unstructured":"H.D. Sherali and O. Ulular, \u201cA primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems, \u201d Applied Mathematics and Optimization, vol. 20, pp. 193\u2013221, 1989.","journal-title":"Applied Mathematics and Optimization"},{"issue":"2","key":"332443_CR29","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0022-247X(90)90109-S","volume":"150","author":"H.D. Sherali","year":"1990","unstructured":"H.D. Sherali and O. Ulular, \u201cConjugate gradient methods using quasi-Newton updates with inexact line searches, \u201d Journal of Mathematical Analysis and Applications, vol. 150, no. 2, pp. 359\u2013377, 1990.","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"332443_CR30","doi-asserted-by":"crossref","unstructured":"N.Z. Shor, \u201cUtilization of the operation of space dilatation in the minimization of convex functions, \u201d Kibernetika, No. 1, pp. 6\u201312, 1970.","DOI":"10.1007\/BF02341816"},{"key":"332443_CR31","first-page":"80","volume":"2","author":"N.Z. Shor","year":"1970","unstructured":"N.Z. Shor, \u201cConvergence rate of the gradient descent method with dilatation of the space, \u201d Kibernetika, vol. 2, pp. 80\u201385, 1970.","journal-title":"Kibernetika"},{"key":"332443_CR32","unstructured":"N.Z. Shor, Minimization Methods for Nondifferentiable Functions, Springer-Verlag, 1985. Translated from the Russian by K.C. Kiwiel and A. Ruszczynski."},{"key":"332443_CR33","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-6015-6","volume-title":"Nondifferentiable Optimization and Polynomial Problems","author":"N.Z. Shor","year":"1998","unstructured":"N.Z. Shor, Nondifferentiable Optimization and Polynomial Problems, Kluwer Academic Publishers: Dordrecht\/Boston, London, 1998."},{"key":"332443_CR34","doi-asserted-by":"crossref","unstructured":"N.Z. Shor and L.P. Shabashova, \u201cSolution of minimax problems by the method of generalized gradient descent with dilatation of the space, \u201d Kibernetika, no. 1, pp. 82\u201388, 1972.","DOI":"10.1007\/BF01069138"},{"key":"332443_CR35","unstructured":"N.Z. Shor and N.G. Zhurbenko, \u201cAminimization method using the operation of space dilatation in the direction of the difference of two successive gradients, \u201d Kibernetika, no. 3, pp. 51\u201359, 1971."},{"key":"332443_CR36","unstructured":"V.A. Skokov, \u201cNote on minimization methods employing space stretching, \u201d Kibernetika, no. 4, pp. 115\u2013117, 1974."},{"key":"332443_CR37","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BFb0120703","volume":"3","author":"P. Wolfe","year":"1975","unstructured":"P. Wolfe, \u201cA method of conjugate subgradients for minimizing nondifferentiable functions, \u201d Mathematical Programming Study, vol. 3, pp. 145\u2013173, 1975.","journal-title":"Mathematical Programming Study"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011272319638.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1011272319638\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011272319638.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:23:21Z","timestamp":1752377001000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1011272319638"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,4]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,4]]}},"alternative-id":["332443"],"URL":"https:\/\/doi.org\/10.1023\/a:1011272319638","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2001,4]]}}}