{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T03:43:48Z","timestamp":1705031028059},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"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":[[1990,1]]},"DOI":"10.1007\/bf01585734","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:12:20Z","timestamp":1114679540000},"page":"127-151","source":"Crossref","is-referenced-by-count":8,"title":["Relaxation methods for monotropic programs"],"prefix":"10.1007","volume":"46","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":"CR1","doi-asserted-by":"crossref","first-page":"1219","DOI":"10.1137\/0325067","volume":"25","author":"D.P. Bertsekas","year":"1987","unstructured":"D.P. Bertsekas, P.A. Hosein and P. Tseng, \u201cRelaxation methods for network flow problems with convex arc costs,\u201dSIAM Journal on Control and Optimization 25 (1987) 1219\u20131243.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1137\/0311049","volume":"11","author":"D.P. Bertsekas","year":"1973","unstructured":"D.P. Bertsekas and S.K. Mitter, \u201cA descent numerical method for optimization problems with nondifferentiable cost functionals,\u201dSIAM Journal on Control 11 (1973) 637\u2013652.","journal-title":"SIAM Journal on Control"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1287\/opre.36.1.93","volume":"36","author":"D.P. Bertsekas","year":"1988","unstructured":"D.P. Bertsekas and P. Tseng, \u201cRelaxation methods for minimum cost ordinary and generalized network flow problems,\u201dOperations Research Journal 36 (1988) 93\u2013114.","journal-title":"Operations Research Journal"},{"key":"CR4","volume-title":"Linear Programming and Extensions","author":"G.B. Dantzig","year":"1963","unstructured":"G.B. Dantzig,Linear Programming and Extensions (Princeton University Press, Princeton, NJ, 1963)."},{"key":"CR5","volume-title":"Relaxation algorithm for minimum cost network flow problems with convex, separable costs","author":"P. Hosein","year":"1985","unstructured":"P. Hosein, \u201cRelaxation algorithm for minimum cost network flow problems with convex, separable costs,\u201d M.Sc. Thesis in Electrical Engineering and Computer Science, Massachusetts Institute of Technology (Cambridge, MA, 1985)."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01585109","volume":"24","author":"C. Lemarechal","year":"1982","unstructured":"C. Lemarechal and R. Mifflin, \u201cGlobal and superlinear convergence of an algorithm for one dimensional minimization of convex functions,\u201dMathematical Programming 24 (1982) 241\u2013256.","journal-title":"Mathematical Programming"},{"key":"CR7","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, Massachusetts, 2nd ed., 1984).","edition":"2nd ed."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BFb0121185","volume":"31","author":"R. Mifflin","year":"1987","unstructured":"R. Mifflin, \u201cAn implementation of an algorithm for univariate minimization and an application to nested optimization,\u201dMathematical Programming Study 31 (1987) 155\u2013166.","journal-title":"Mathematical Programming Study"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0141-0296(84)90056-7","volume":"6","author":"V.H. Nguyen","year":"1987","unstructured":"V.H. Nguyen and J.J. Strodiot, \u201cA linearly constrained algorithm not requiring derivative continuity,\u201dEngineering Structures 6 (1987) 7\u201311.","journal-title":"Engineering Structures"},{"key":"CR10","volume-title":"Iterative Solution of Nonlinear Equations in Several Variables","author":"J.M. Ortega","year":"1970","unstructured":"J.M. Ortega and W.C. Rheinboldt,Iterative Solution of Nonlinear Equations in Several Variables (Academic Press, New York, 1970)."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF02591738","volume":"37","author":"E.R. Panier","year":"1987","unstructured":"E.R. Panier, \u201cAn active set method for solving linearly constrained nonsmooth optimization problems,\u201dMathematical Programming 37 (1987) 269\u2013292.","journal-title":"Mathematical Programming"},{"key":"CR12","first-page":"104","volume-title":"Combinatorial Mathematics and Its Applications","author":"R.T. Rockafellar","year":"1969","unstructured":"R.T. Rockafellar, \u201cThe elementary vectors of a subspace ofR N ,\u201d in: R.C. Bose and T.A. Dowling, eds.,Combinatorial Mathematics and Its Applications (The University of North Carolina Press, Chapel Hill, NC, 1969) pp. 104\u2013127."},{"key":"CR13","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, NJ, 1970)."},{"key":"CR14","first-page":"327","volume-title":"Nonlinear Programming, Vol. 4","author":"R.T. Rockafellar","year":"1981","unstructured":"R.T. Rockafellar, \u201cMonotropic programming: Descent algorithms and duality,\u201d in: O.L. Mangasarian, R. Meyer and S. Robinson, eds.,Nonlinear Programming, Vol. 4 (Academic Press, New York, 1981) pp. 327\u2013366."},{"key":"CR15","volume-title":"Network Flows and Monotropic Programming","author":"R.T. Rockafellar","year":"1983","unstructured":"R.T. Rockafellar,Network Flows and Monotropic Programming (Wiley, New York, 1983)."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF02579369","volume":"5","author":"E. Tardoz","year":"1985","unstructured":"E. Tardoz, \u201cA strongly polynomial minimum cost circulation algorithm,\u201dCombinatorica 5 (1985) 247\u2013256.","journal-title":"Combinatorica"},{"key":"CR17","volume-title":"Relaxation method for monotropic programming problems","author":"P. Tseng","year":"1986","unstructured":"P. Tseng, \u201cRelaxation method for monotropic programming problems,\u201d Ph.D. Thesis, Operations Research Center, Massachusetts Institute of Technology (Cambridge, MA, 1986)."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1287\/moor.12.4.569","volume":"12","author":"P. Tseng","year":"1987","unstructured":"P. Tseng and D.P. Bertsekas, \u201cRelaxation methods for linear programs,\u201dMathematics of Operations Research 12 (1987) 569\u2013596.","journal-title":"Mathematics of Operations Research"},{"key":"CR19","volume-title":"\u201cRelaxation methods for linear programs with side constraints,\u201d LIDS-P-1696","author":"P. Tseng","year":"1987","unstructured":"P. Tseng and D.P. Bertsekas, \u201cRelaxation methods for linear programs with side constraints,\u201d LIDS-P-1696, Laboratory for Information and Decision Systems, Massachusetts Institute of Technology (Cambridge, MA, 1987)."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF02592017","volume":"38","author":"P. Tseng","year":"1987","unstructured":"P. Tseng and D.P. Bertsekas, \u201cRelaxation methods for problems with strictly convex separable costs and linear constraints,\u201dMathematical Programming 38 (1987) 303\u2013321.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585734.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01585734\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585734","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:32:31Z","timestamp":1556897551000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01585734"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":20,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["BF01585734"],"URL":"https:\/\/doi.org\/10.1007\/bf01585734","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,1]]}}}