{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T02:56:03Z","timestamp":1774752963309,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1987,10,1]],"date-time":"1987-10-01T00:00:00Z","timestamp":560044800000},"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":[[1987,10]]},"DOI":"10.1007\/bf02592017","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T15:32:50Z","timestamp":1175182370000},"page":"303-321","source":"Crossref","is-referenced-by-count":34,"title":["Relaxation methods for problems with strictly convex separable costs and linear constraints"],"prefix":"10.1007","volume":"38","author":[{"given":"Paul","family":"Tseng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitri P.","family":"Bertsekas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02592017_CR1","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1137\/0325006","volume":"25","author":"D.P. Bertsekas","year":"1987","unstructured":"D.P. Bertsekas and D. Elbaz, \u201cDistributed asynchronous relaxation methods for convex network flow problems,\u201dSIAM Journal on Control and Optimization 25 (1987) 74\u201385.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"BF02592017_CR2","unstructured":"D.P. Bertsekas, P.A. Hosein and P. Tseng, \u201cRelaxation methods for network flow problems with convex arc costs,\u201d LIDS Report P-1523, Mass. Institute of Technology, December 1985,SIAM Journal on Control and Optimization, to appear."},{"key":"BF02592017_CR3","unstructured":"D.P. Bertsekas and P. Tseng, \u201cRelaxation Methods for Linear Programs,\u201d LIDS Report P-1553, Mass. Institute of Technology, April 1986, to appear inMathematics of Operations Research."},{"key":"BF02592017_CR4","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/BFb0120964","volume":"17","author":"R.W. Cottle","year":"1982","unstructured":"R.W. Cottle and J.S. Pang, \u201cOn the convergence of a block successive over-relaxation method for a class of linear complementary problems,\u201dMathematical Programming Study 17 (1982) 126\u2013138.","journal-title":"Mathematical Programming Study"},{"key":"BF02592017_CR5","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1985","unstructured":"G.H. Golub and C.F. Van Loan,Matrix Computations (Johns Hopkins Univ. Press, Baltimore, MD, 1985)."},{"key":"BF02592017_CR6","volume-title":"Introduction to Linear and Nonlinear Programming","author":"D.G. Luenberger","year":"1984","unstructured":"D.G. Luenberger,Introduction to Linear and Nonlinear Programming (Addison-Wesley, Reading, MA, 2nd ed., 1984).","edition":"2nd ed."},{"key":"BF02592017_CR7","unstructured":"J.S. Pang, \u201cOn the convergence of dual ascent methods for large-scale linearly constrained optimization problems,\u201d Unpublished manuscript, The University of Texas at Dallas, 1984."},{"key":"BF02592017_CR8","volume-title":"Computational Methods in Optimization: A Unified Approach","author":"E. Polak","year":"1971","unstructured":"E. Polak,Computational Methods in Optimization: A Unified Approach (Academic Press, New York, 1971)."},{"key":"BF02592017_CR9","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01584660","volume":"4","author":"M.J.D. Powell","year":"1973","unstructured":"M.J.D. Powell, \u201cOn search directions for minimization algorithms,\u201dMathematical Programming 4 (1973) 193\u2013201.","journal-title":"Mathematical Programming"},{"key":"BF02592017_CR10","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"R.T. Rockafellar,Convex Analysis (Princeton University Press, Princeton, New Jersey, 1970)."},{"key":"BF02592017_CR11","volume-title":"Network Flows and Monotropic Programming","author":"R.T. Rockafellar","year":"1983","unstructured":"R.T. Rockafellar,Network Flows and Monotropic Programming (Wiley-Interscience, New York, 1983)."},{"key":"BF02592017_CR12","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/BF00934779","volume":"12","author":"R. W. H. Sargent","year":"1973","unstructured":"R. W. H. Sargent and D.J. Sebastian, \u201cOn the Convergence of Sequential Minimization Algorithms,\u201dJournal of Optimization Theory and Applications 12 (1973) 567\u2013575.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"BF02592017_CR13","unstructured":"P. Tseng, \u201cRelaxation methods for monotropic programming problems,\u201d Ph.D. Thesis, Dept. of Electrical Engineering and Computer Science, Operations Research Center, Mass. Institute of Technology (1986)."},{"key":"BF02592017_CR14","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1287\/mnsc.16.9.642","volume":"16","author":"N. Zadeh","year":"1970","unstructured":"N. Zadeh, \u201cA note on the cyclic coordinate ascent method,\u201dManagement Science 16 (1970) 642\u2013644.","journal-title":"Management Science"},{"key":"BF02592017_CR15","volume-title":"Nonlinear Programming: A Unified Approach","author":"W.I. Zangwill","year":"1969","unstructured":"W.I. Zangwill,Nonlinear Programming: A Unified Approach (Prentice-Hall, Englewood Cliffs, New Jersey, 1969)."},{"key":"BF02592017_CR16","series-title":"Working Paper","volume-title":"Simulating a distributed synchronous relaxation method for convex network problems","author":"S.A. Zenios","year":"1985","unstructured":"S.A. Zenios and J.M. Mulvey, \u201cSimulating a distributed synchronous relaxation method for convex network problems,\u201d Working Paper, Department of Civil Engineering, Princeton University, Princeton, New Jersey, January 1985."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592017.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02592017\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592017","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:37:51Z","timestamp":1558395471000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02592017"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,10]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,10]]}},"alternative-id":["BF02592017"],"URL":"https:\/\/doi.org\/10.1007\/bf02592017","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,10]]}}}