{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:29:31Z","timestamp":1742390971030},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,3,23]],"date-time":"2006-03-23T00:00:00Z","timestamp":1143072000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[2006,7]]},"DOI":"10.1007\/s10589-005-3914-x","type":"journal-article","created":{"date-parts":[[2006,3,24]],"date-time":"2006-03-24T10:14:39Z","timestamp":1143195279000},"page":"409-428","source":"Crossref","is-referenced-by-count":16,"title":["Convergence and Computational Analyses for Some Variable Target Value and Subgradient Deflection Methods"],"prefix":"10.1007","volume":"34","author":[{"given":"Churlzu","family":"Lim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanif D.","family":"Sherali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,3,23]]},"reference":[{"issue":"3","key":"3914_CR1","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s101070050002","volume":"87","author":"F. Barahona","year":"2000","unstructured":"F. Barahona and R. Anbil, \u201cThe volume algorithm: Producing primal solutions with a subgradient method,\u201d Mathematical Programming, vol. 87, no. 3, pp. 385\u2013399, 2000.","journal-title":"Mathematical Programming"},{"issue":"4","key":"3914_CR2","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1016\/0377-2217(81)90096-5","volume":"7","author":"M.S. Bazaraa","year":"1981","unstructured":"M.S. Bazaraa and H.D. Sherali, \u201cOn the choice of step size in subgradient optimization,\u201d European Journal of Operational Research, vol. 7, no. 4, pp. 380\u2013388, 1981.","journal-title":"European Journal of Operational Research"},{"key":"3914_CR3","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 ed., John Wiley & Sons, New York, 1993.","edition":"2"},{"issue":"11","key":"3914_CR4","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J.E. Beasley","year":"1990","unstructured":"J.E. Beasley, \u201cOR-library: distributing test problems by electronic mail,\u201d Journal of the Operational Research Society, vol. 41, no. 11, pp. 1069\u20131072, 1990.","journal-title":"Journal of the Operational Research Society"},{"key":"3914_CR5","unstructured":"U. Br\u00e4nnlund, \u201cOn relaxation methods for nonsmooth convex optimization,\u201d Ph.D Dissertation, Department of Mathematics, Royal Institute of Technology, Stockholm, Sweden, 1993."},{"key":"3914_CR6","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"},{"issue":"1","key":"3914_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"M.L. Fisher","year":"1981","unstructured":"M.L. Fisher, \u201cThe Lagrangian relaxation method for solving integer programming problems,\u201d Management Science, vol. 27, no. 1, pp. 1\u201318, 1981.","journal-title":"Management Science"},{"issue":"1","key":"3914_CR8","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0305-0548(99)00085-4","volume":"28","author":"F. Fumero","year":"2001","unstructured":"F. Fumero, \u201cA modified subgradient algorithm for Lagrangean relaxation,\u201d Computers & Operations Research, vol. 28, no. 1, pp. 33\u201352, 2001.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"3914_CR9","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s101070050053","volume":"85","author":"J.L. Goffin","year":"1999","unstructured":"J.L. Goffin and K.C. Kiwiel, \u201cConvergence of a simple subgradient level method,\u201d Mathematical Programming, vol. 85, no. 1, pp. 207\u2013211, 1999.","journal-title":"Mathematical Programming"},{"issue":"1","key":"3914_CR10","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","volume":"6","author":"M. Held","year":"1974","unstructured":"M. Held, P. Wolfe, and H. Crowder, \u201cValidation of subgradient optimization,\u201d Mathematical Programming, vol. 6, no. 1, pp. 62\u201388, 1974.","journal-title":"Mathematical Programming"},{"issue":"3","key":"3914_CR11","first-page":"359","volume":"49","author":"S. Kim","year":"1991","unstructured":"S. Kim, H. Ahn, and S. Cho, \u201cVariable target value subgradient method,\u201d Mathematical Programming, vol. 49, no. 3, pp. 359\u2013369, 1991.","journal-title":"Mathematical Programming"},{"key":"3914_CR12","doi-asserted-by":"crossref","unstructured":"K.C. Kiwiel, Methods of Descent for Nondifferentiable Optimization, Lecture Notes in Mathematics 1133, Springer, Berlin, 1985.","DOI":"10.1007\/BFb0074500"},{"issue":"1","key":"3914_CR13","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01585731","volume":"46","author":"K.C. Kiwiel","year":"1990","unstructured":"K.C. Kiwiel, \u201cProximity control in bundle methods for convex nondifferentiable minimization\u201d Mathematical Programming, vol. 46, no. 1, pp. 105\u2013122, 1990.","journal-title":"Mathematical Programming"},{"key":"3914_CR14","unstructured":"C. Lemarechal, \u201cBundle method in nonsmooth optimization,\u201d in Nonsmooth Optimization: Proceedings of IIASA Workshop held at Laxenburg, Austria, C. Lemarechal and R. Mifflin (Eds.), vol. 3, pp. 79\u2013109, 1977."},{"key":"3914_CR15","unstructured":"C. Lim, \u201cNondifferentiable optimization of Lagrangian dual formulations for linear programs with recovery of primal solutions,\u201d Ph.D Dissertation, Grado Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, Virginia, 2004."},{"issue":"1","key":"3914_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/10556780290027828","volume":"17","author":"M.M. Makela","year":"2002","unstructured":"M.M. Makela, \u201cSurvey of bundle methods for nonsmooth optimization,\u201d Optimization Methods and Software, vol. 17, no. 1, pp. 1\u201329, 2002.","journal-title":"Optimization Methods and Software"},{"issue":"2","key":"3914_CR17","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, no. 2, pp. 191\u2013207, 1977.","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"3914_CR18","first-page":"593","volume":"8","author":"B.T. Polyak","year":"1967","unstructured":"B.T. Polyak, \u201cA general method of solving extremum problems,\u201d Soviet Mathematics, vol. 8, no. 3, pp. 593\u2013597, 1967.","journal-title":"Soviet Mathematics"},{"issue":"3","key":"3914_CR19","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0041-5553(69)90061-5","volume":"9","author":"B.T. Polyak","year":"1969","unstructured":"B.T. Polyak, \u201cMinimization of unsmooth functionals,\u201d U.S.S.R. Computational Mathematics and Mathematical Physics, vol. 9, no. 3, pp. 14\u201329, 1969.","journal-title":"U.S.S.R. Computational Mathematics and Mathematical Physics"},{"issue":"1","key":"3914_CR20","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1023\/A:1011272319638","volume":"19","author":"H.D. Sherali","year":"2001","unstructured":"H.D. Sherali, G. Choi, and Z. Ansari, \u201cLimited memory space dilation and reduction algorithms,\u201d Computational Optimization and Applications, vol. 19, no. 1, pp. 55\u201377, 2001.","journal-title":"Computational Optimization and Applications"},{"issue":"1","key":"3914_CR21","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 for nondifferentiable optimization,\u201d Operations Research Letters, vol. 26, no. 1, pp. 1\u20138, 2000.","journal-title":"Operations Research Letters"},{"issue":"5","key":"3914_CR22","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/j.orl.2003.12.006","volume":"32","author":"H.D. Sherali","year":"2004","unstructured":"H.D. Sherali, and C. Lim, \u201cOn embedding the volume algorithm in a variable target value method,\u201d Operations Research Letters, vol. 32, no. 5, pp. 455\u2013462, 2004.","journal-title":"Operations Research Letters"},{"issue":"1","key":"3914_CR23","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, no. 1, pp. 51\u201368, 1988.","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"3914_CR24","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, no. 2, pp. 193\u2013221, 1989.","journal-title":"Applied Mathematics and Optimization"},{"issue":"1","key":"3914_CR25","first-page":"6","volume":"6","author":"N.Z. Shor","year":"1970","unstructured":"N.Z. Shor, \u201cUtilization of the operation of space dilatation in the minimization of convex functions,\u201d Kibernetika, vol. 6, no. 1, pp. 6\u201312, 1970.","journal-title":"Kibernetika"},{"key":"3914_CR26","doi-asserted-by":"crossref","unstructured":"N.Z. Shor, Minimization Methods for Non-Differentiable Functions, Springer-Verlag, 1985.","DOI":"10.1007\/978-3-642-82118-9"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-3914-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-005-3914-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-3914-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:36:29Z","timestamp":1559288189000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-005-3914-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,3,23]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,7]]}},"alternative-id":["3914"],"URL":"https:\/\/doi.org\/10.1007\/s10589-005-3914-x","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,3,23]]}}}