{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,24]],"date-time":"2023-09-24T18:20:21Z","timestamp":1695579621300},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,6,9]],"date-time":"2006-06-09T00:00:00Z","timestamp":1149811200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2006,8]]},"DOI":"10.1007\/s00186-006-0071-7","type":"journal-article","created":{"date-parts":[[2006,6,8]],"date-time":"2006-06-08T14:10:48Z","timestamp":1149775848000},"page":"33-53","source":"Crossref","is-referenced-by-count":6,"title":["A Trust Region Target Value Method for Optimizing Nondifferentiable Lagrangian Duals of Linear Programs"],"prefix":"10.1007","volume":"64","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,6,9]]},"reference":[{"issue":"3","key":"71_CR1","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01581249","volume":"59","author":"WP Adams","year":"1993","unstructured":"Adams WP, Sherali HD (1993) Mixed-integer bilinear-programming problems. Math Progr 59(3):279\u2013305","journal-title":"Math Progr"},{"issue":"3","key":"71_CR2","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s101070050002","volume":"87","author":"F Barahona","year":"2000","unstructured":"Barahona F, Anbil R (2000) The volume algorithm: producing primal solutions with a subgradient method. Math Progr 87(3):385\u2013399","journal-title":"Math Progr"},{"key":"71_CR3","volume-title":"Nonlinear programming: theory and algorithms","author":"MS Bazaraa","year":"1993","unstructured":"Bazaraa MS, Sherali HD, Shetty CM (1993) Nonlinear programming: theory and algorithms, 2nd edn. Wiley, New York","edition":"2"},{"key":"71_CR4","volume-title":"On relaxation methods for nonsmooth convex optimization","author":"U Br\u00e4nnlund","year":"1993","unstructured":"Br\u00e4nnlund U (1993) On relaxation methods for nonsmooth convex optimization. Ph.D Dissertation, Department of Mathematics, Royal Institute of Technology, Stockholm Sweden"},{"key":"71_CR5","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BFb0120697","volume":"3","author":"PM Camerini","year":"1975","unstructured":"Camerini PM, Fratta L, Maffioli F (1975) On improving relaxation methods by modified gradient techniques. Math Progr Study 3:26\u201334","journal-title":"Math Progr Study"},{"issue":"1","key":"71_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"ML Fisher","year":"1981","unstructured":"Fisher ML (1981) The Lagrangian relaxation method for solving integer programming problems. Manage Sci 27(1):1\u201318","journal-title":"Manage Sci"},{"issue":"1","key":"71_CR7","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s101070050053","volume":"85","author":"JL Goffin","year":"1999","unstructured":"Goffin JL, Kiwiel KC (1999) Convergence of a simple subgradient level method. Math Progr 85(1):207\u2013211","journal-title":"Math Progr"},{"issue":"1","key":"71_CR8","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","volume":"6","author":"M Held","year":"1974","unstructured":"Held M, Wolfe P, Crowder H (1974) Validation of subgradient optimization. Math Progr 6(1): 62\u201388","journal-title":"Math Progr"},{"issue":"2","key":"71_CR9","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s101070050090","volume":"86","author":"T Larsson","year":"1999","unstructured":"Larsson T, Patriksson M, Stromberg AB (1999) Ergodic, primal convergence in dual subgradient schemes for convex programming. Math Progr 86(2):283\u2013312","journal-title":"Math Progr"},{"key":"71_CR10","first-page":"79","volume-title":"Nonsmooth optimization: IIASA proceeding series","author":"C Lemarechal","year":"1977","unstructured":"Lemarechal C (1977). Bundle methods in nonsmooth optimization. In: Lemarechal C, Mifflin R (eds). Nonsmooth optimization: IIASA proceeding series, vol. 3, Pergamon, New York, pp 79\u2013109"},{"key":"71_CR11","volume-title":"Nondifferentiable optimization of lagrangian dual formulations for linear programs with recovery of primal solutions","author":"C Lim","year":"2004","unstructured":"Lim C (2004) Nondifferentiable optimization of lagrangian dual formulations for linear programs with recovery of primal solutions. Ph.D. Dissertation, Grado Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, Virginia"},{"key":"71_CR12","unstructured":"Lim C, Sherali HD (2004) Convergence and computational analyses for some variable target value and subgradient deflection methods. Comput Optim Appl (to appear)"},{"issue":"1","key":"71_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/10556780290027828","volume":"17","author":"MM Makela","year":"2002","unstructured":"Makela MM (2002) Survey of bundle methods for nonsmooth optimization. Optim Methods Softw 17(1):1\u201329","journal-title":"Optim Methods Softw"},{"issue":"3","key":"71_CR14","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1287\/opre.23.3.389","volume":"23","author":"RE Marsten","year":"1975","unstructured":"Marsten RE, Hogan WW, Blankenship JW (1975) The boxstep method for large-scale optimization. Oper Res 23(3):389\u2013405","journal-title":"Oper Res"},{"issue":"2","key":"71_CR15","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1287\/moor.2.2.191","volume":"2","author":"R Mifflin","year":"1977","unstructured":"Mifflin R (1977) An algorithm for constrained optimization with semismooth functions. Math Oper Res 2(2):191\u2013207","journal-title":"Math Oper Res"},{"issue":"3","key":"71_CR16","first-page":"593","volume":"8","author":"BT Polyak","year":"1967","unstructured":"Polyak BT (1967) A general method of solving extremum problems. Sov Math 8(3):593\u2013597","journal-title":"Sov Math"},{"issue":"3","key":"71_CR17","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0041-5553(69)90061-5","volume":"9","author":"BT Polyak","year":"1969","unstructured":"Polyak BT (1969) Minimization of unsmooth functionals. U.S.S.R. Comput Math Math Phys 9(3):14\u201329","journal-title":"U.S.S.R. Comput Math Math Phys"},{"key":"71_CR18","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar RT (1970) Convex analysis. Princeton University Press, Princeton"},{"issue":"3","key":"71_CR19","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0167-6377(96)00019-3","volume":"19","author":"HD Sherali","year":"1996","unstructured":"Sherali HD, Choi G (1996) Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs. Oper Res Lett 19(3):105\u2013113","journal-title":"Oper Res Lett"},{"issue":"1","key":"71_CR20","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1023\/A:1011272319638","volume":"19","author":"HD Sherali","year":"2001","unstructured":"Sherali HD, Choi G, Ansari Z (2001) Limited memory space dilation and reduction algorithms. Comput Optim Appl 19(1):55\u201377","journal-title":"Comput Optim Appl"},{"issue":"1","key":"71_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(99)00063-2","volume":"26","author":"HD Sherali","year":"2000","unstructured":"Sherali HD, Choi G, Tuncbilek CH (2000) A variable target value method for nondifferentiable optimization. Oper Res Lett 26(1):1\u20138","journal-title":"Oper Res Lett"},{"issue":"5","key":"71_CR22","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/j.orl.2003.12.006","volume":"32","author":"HD Sherali","year":"2004","unstructured":"Sherali HD, Lim C (2004) On embedding the volume algorithm in a variable target value method. Oper Res Lett 32(5):455\u2013462","journal-title":"Oper Res Lett"},{"issue":"1","key":"71_CR23","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0166-218X(88)90041-8","volume":"20","author":"HD Sherali","year":"1988","unstructured":"Sherali HD, Myers DC (1988) Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs. Discr Appl Math 20(1):51\u201368","journal-title":"Discr Appl Math"},{"issue":"2","key":"71_CR24","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01447654","volume":"20","author":"HD Sherali","year":"1989","unstructured":"Sherali HD, Ulular O (1989) A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems. Appl Math Optim 20(2):193\u2013221","journal-title":"Appl Math Optim"},{"key":"71_CR25","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 NZ (1985) Minimization methods for non-differentiable functions. Springer, Berlin Heidelberg New York"},{"issue":"1","key":"71_CR26","first-page":"82","volume":"8","author":"NZ Shor","year":"1972","unstructured":"Shor NZ, Shabashova LP (1972) Solution of minimax problems by the method of generalized gradient descent with dilatation of the space. Kibernetika 8(1):82\u201388","journal-title":"Kibernetika"},{"issue":"2","key":"71_CR27","first-page":"51","volume":"7","author":"NZ Shor","year":"1971","unstructured":"Shor NZ, Zhurbenko NG (1971) A minimization method using the operation of extension of the space in the direction of the difference of two successive gradients. Kibernetika 7(2):51\u201359","journal-title":"Kibernetika"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-006-0071-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-006-0071-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-006-0071-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T14:33:24Z","timestamp":1558622004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-006-0071-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,9]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,8]]}},"alternative-id":["71"],"URL":"https:\/\/doi.org\/10.1007\/s00186-006-0071-7","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6,9]]}}}