{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T08:28:07Z","timestamp":1748420887721},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1986,7,1]],"date-time":"1986-07-01T00:00:00Z","timestamp":520560000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1986,7]]},"DOI":"10.1007\/bf01580881","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:56:59Z","timestamp":1114678619000},"page":"279-297","source":"Crossref","is-referenced-by-count":23,"title":["A class of convergent primal-dual subgradient algorithms for decomposable convex programs"],"prefix":"10.1007","volume":"35","author":[{"given":"S.","family":"Sen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanif D.","family":"Sherali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"382","DOI":"10.4153\/CJM-1954-037-2","volume":"6","author":"S. Agmon","year":"1954","unstructured":"S. Agmon, \u201cThe relaxation method for linear inequalities\u201c,Canadian Journal of Mathematics 6 (1954) 382\u2013392.","journal-title":"Canadian Journal of Mathematics"},{"key":"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\u201c,European Journal of Operational Research 7 (1981) 380\u2013388.","journal-title":"European Journal of Operational Research"},{"key":"CR3","volume-title":"Nonlinear Programming: Theory and Applications","author":"M.S. Bazaraa","year":"1979","unstructured":"M.S. Bazaraa and C.M. Shetty,Nonlinear Programming: Theory and Applications (John Wiley and Sons, New York, New York, 1979)."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1137\/0313030","volume":"13","author":"D.P. Bertsekas","year":"1975","unstructured":"D.P. Bertsekas, \u201cCombined primal-dual and penalty methods for constrained minimization\u201c,SIAM Journal of Control 13 (1975) 521\u2013544.","journal-title":"SIAM Journal of Control"},{"key":"CR5","unstructured":"G. Bitran and A. Hax, \u201cOn the solution of convex knapsack problems with bounded variables\u201d,Proceedings of the IX International Symposium on Mathematical Programiming, Budapest (1976) 357\u2013367."},{"key":"CR6","volume-title":"Dual algorithms for constrained optimization problems","author":"J.D. Buys","year":"1972","unstructured":"J.D. Buys, \u201cDual algorithms for constrained optimization problems\u201d, Unpublished Ph.D. Thesis, University of Leiden (The Netherlands, 1972)."},{"key":"CR7","unstructured":"G. Cohen and D.L. Zhu, \u201cDecomposition coordination methods in large scale optimization problems: The nondifferentiable case and the use of augmented lagrangians\u201c, in: J.B. Cruz, ed.,Advances in Large Scale Systems 1 (JAI Press Inc., 1984) pp. 203\u2013266."},{"key":"CR8","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, \u201cLagrangian relaxation methods for combinatorial optimization\u201c,Management Science 27 (1981) 1\u201318.","journal-title":"Management Science"},{"issue":"2","key":"CR9","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF02591883","volume":"30","author":"M. Fukushima","year":"1984","unstructured":"M. Fukushima, \u201cA descent algorithm for nonsmooth convex optimization\u201c,Mathematical Programming 30 (2) (1984) 163\u2013175.","journal-title":"Mathematical Programming"},{"issue":"4","key":"CR10","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"A.M. Geoffrion","year":"1972","unstructured":"A.M. Geoffrion, \u201cGeneralized Benders' decomposition\u201c,Journal of Optimization Theory and Applications 10 (4) (1972) 237\u2013260.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"CR11","volume-title":"Practical optimization","author":"P.E. Gill","year":"1981","unstructured":"P.E. Gill, W. Murray and M.H. Wright,Practical optimization (Academic Press, New York, New York, 1981)."},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"J.L. Goffin, \u201cConvergence results on a class of variable metric subgradient methods, in: O. Mangasarian, R. Meyer and S. Robinson, eds.,Nonlinear Programming 4 (1981) pp. 283\u2013325.","DOI":"10.1016\/B978-0-12-468662-5.50016-1"},{"issue":"3","key":"CR13","first-page":"36","volume":"10","author":"E.G. Gol'shtein","year":"1974","unstructured":"E.G. Gol'shtein, \u201cA generalized gradient method for finding saddlepoints,\u201dMatekon 10 (3) (1974) 36\u201352.","journal-title":"Matekon"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"M. Held","year":"1971","unstructured":"M. Held and R.M. Karp, \u201cThe traveling-salesman problem and minimum spanning trees: Part II\u201c,Mathematical Programming 1 (1971) 6\u201326.","journal-title":"Mathematical Programming"},{"key":"CR15","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.P. Crowder, \u201cValidation of subgradient optimization\u201c,Mathematical Programming 6 (1974) 62\u201388.","journal-title":"Mathematical Programming"},{"key":"CR16","first-page":"1093","volume":"224","author":"L.G. Khacijan","year":"1979","unstructured":"L.G. Khacijan, \u201cA polynomial algorithm in linear programming\u201c,Doklady Akademiia Nauk SSSR, 224 (1979) 1093\u20131096, Translated inSoviet Mathematics Doklady 20 191\u2013194.","journal-title":"Doklady Akademiia Nauk SSSR"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/BF02591907","volume":"27","author":"K. Kiwiel","year":"1983","unstructured":"K. Kiwiel, \u201cAn aggregate subgradient method for nonsmooth convex minimization\u201c,Mathematical Programming 27 (1983) 320\u2013341.","journal-title":"Mathematical Programming"},{"issue":"4","key":"CR18","first-page":"35","volume":"13","author":"G.M. Korpelevich","year":"1977","unstructured":"G.M. Korpelevich, \u201cThe extragradient method for finding saddle points and other problems\u201c,Makedon 13 (4) (1977) 35\u201349.","journal-title":"Makedon"},{"key":"CR19","first-page":"245","volume-title":"Nonlinear Programming Study No. 4","author":"C. Lemarechal","year":"1981","unstructured":"C. Lemarechal, J. Strodiot and A. Bihain, \u201cOn a bundle algorithm for nonsmooth optimization\u201d,Nonlinear Programming Study No. 4 (Academic Press, New York, 1981) pp. 245\u2013282."},{"key":"CR20","first-page":"3","volume":"13","author":"D. Maistroskii","year":"1977","unstructured":"D. Maistroskii, \u201cGradient methods for finding saddlepoints\u201c,Matekon 13 (1977) 3\u201322.","journal-title":"Matekon"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"393","DOI":"10.4153\/CJM-1954-038-x","volume":"6","author":"T. Motzkin","year":"1954","unstructured":"T. Motzkin and I.J. Schoenberg, \u201cThe relaxation method for linear inequalities\u201c,Canadian Journal of Mathematics 6 (1954) 393\u2013404.","journal-title":"Canadian Journal of Mathematics"},{"issue":"3","key":"CR22","first-page":"593","volume":"8","author":"B.T. Poljak","year":"1967","unstructured":"B.T. Poljak, \u201cA general method of solving extremum problems\u201c,Soviet Mathematics Doklady 8(3) (1967) 593\u2013597.","journal-title":"Soviet Mathematics Doklady"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0041-5553(69)90061-5","volume":"9","author":"B.T. Poljak","year":"1969","unstructured":"B.T. Poljak, \u201cMinimization of unsmooth functionals\u201c,USSR Computational Mathematics and Mathematical Physics 9 (1969) 14\u201329.","journal-title":"USSR Computational Mathematics and Mathematical Physics"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF01580138","volume":"5","author":"R.T. Rockafellar","year":"1973","unstructured":"R.T. Rockafellar, \u201cA dual approach to solving nonlinear programming problems by unconstrained optimization\u201c,Mathematical Programming 5 (1973a) 354\u2013373.","journal-title":"Mathematical Programming"},{"key":"CR25","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/BF00934777","volume":"12","author":"R.T. Rockafellar","year":"1973","unstructured":"R.T. Rockafellar, \u201cThe multiplier method of Hestenes and Powell applied to convex programming\u201c,Journal of Optimization Theory and Applications 12 (1973b) 555\u2013562.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"CR26","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1137\/0312021","volume":"12","author":"R.T. Rockafellar","year":"1974","unstructured":"R.T. Rockafellar, \u201cAugmented Lagrange multiplier functions and duality in nonconvex programming\u201c,SIAM Journal on Control and Optimization 12 (1974) 268\u2013285.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"CR27","series-title":"SIE Working Paper Series","volume-title":"A primal-dual subgradient algorithm for time staged capacity expansion planning","author":"S. Sen","year":"1984","unstructured":"S. Sen and D.S. Yakowitz, \u201cA primal-dual subgradient algorithm for time staged capacity expansion planning\u201d, SIE Working Paper Series, 84-002, Department of Systems and Industrial Engineering, The University of Arizona (Tucson, Arizona, 1984)."},{"key":"CR28","series-title":"Working Paper","volume-title":"Algorithmic strategies for using subgradient optimization with Lagrangian relaxation in solving mixed-integer programming problems","author":"H.D. Sherali","year":"1984","unstructured":"H.D. Sherali and D.C. Myers, \u201cAlgorithmic strategies for using subgradient optimization with Lagrangian relaxation in solving mixed-integer programming problems\u201d, Working Paper, Department of Industrial Engineering and Operations Research, Virginia Polytechnic Institute and State University (Blacksburg, Virginia, 1984)."},{"key":"CR29","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/978-3-642-68874-4_19","volume-title":"Mathematical Programming: The State of the Art","author":"N.Z. Shor","year":"1983","unstructured":"N.Z. Shor, \u201cGeneralized gradient methods of non-differentiable optimization employing space dilatation operators\u201c, in: A. Bachem, M. Grotschel and B. Korte, eds.Mathematical Programming: The State of the Art (Bonn, W. Germany, 1983) pp. 501\u2013529."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580881.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580881\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580881","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:12:12Z","timestamp":1556896332000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580881"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,7]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,7]]}},"alternative-id":["BF01580881"],"URL":"https:\/\/doi.org\/10.1007\/bf01580881","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,7]]}}}