{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T15:52:04Z","timestamp":1680450724293},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1993,10,1]],"date-time":"1993-10-01T00:00:00Z","timestamp":749433600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1993,10]]},"DOI":"10.1007\/bf02072644","type":"journal-article","created":{"date-parts":[[2005,8,13]],"date-time":"2005-08-13T17:03:40Z","timestamp":1123952620000},"page":"299-311","source":"Crossref","is-referenced-by-count":2,"title":["Nonsmooth optimization methods for parallel decomposition of multicommodity flow problems"],"prefix":"10.1007","volume":"44","author":[{"given":"Renato","family":"De Leone","sequence":"first","affiliation":[]},{"given":"Manlio","family":"Gaudioso","sequence":"additional","affiliation":[]},{"given":"Maria Flavia","family":"Monaco","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02072644_CR1","unstructured":"D.P. Bertsekas and J.N. Tsitsiklis,Parallel and Distributed Computation (Prentice-Hall, 1989)."},{"key":"BF02072644_CR2","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"L.M. Bregman","year":"1967","unstructured":"L.M. Bregman, The relaxation method for finding the common point of convex sets and its application to the solution of problems in convex programming, USSR Comput. Math. and Math. Phys. 7 (1967) 200\u2013217.","journal-title":"USSR Comput. Math. and Math. Phys."},{"key":"BF02072644_CR3","series-title":"Tech. Report","volume-title":"A primal-dual algorithm for large scale multicommodity network optimization problems and its parallel implementation","author":"Y. Censor","year":"1991","unstructured":"Y. Censor, E.D. Chajakis and S.A. Zenios, A primal-dual algorithm for large scale multicommodity network optimization problems and its parallel implementation, Tech. Report 91-09-03, Decision Sciences Department, The Wharton School, Philadelphia, PA (1991)."},{"key":"BF02072644_CR4","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF00934676","volume":"34","author":"Y. Censor","year":"1981","unstructured":"Y. Censor and A. Lent, An iterative row-action method for interval convex programming, J. Optim. Theory Appl. 34 (1981) 321\u2013353.","journal-title":"J. Optim. Theory Appl."},{"key":"BF02072644_CR5","unstructured":"A.V. Fiacco,Introduction to Sensitivity and Stability Analysis in Nonlinear Programming (Academic Press, 1983)."},{"key":"BF02072644_CR6","unstructured":"R. Fletcher,Practical Methods of Optimization, 2nd ed., vol. 2 (Wiley, 1990)."},{"key":"BF02072644_CR7","unstructured":"M. Gaudioso, Nonsmooth optimization with inexact calculation of the objective function, Tech. Report 8, Dip. di Elettronica, Informatica e Sistemistica, Universit\u00e0 della Calabria (1992)."},{"key":"BF02072644_CR8","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/BF01583790","volume":"23","author":"M. Gaudioso","year":"1982","unstructured":"M. Gaudioso and M.F. Monaco, A bundle type approach to the unconstrained minimization of convex nonsmooth functions, Math. Progr. 23 (1982) 216\u2013226.","journal-title":"Math. Progr."},{"key":"BF02072644_CR9","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1287\/opre.18.3.375","volume":"18","author":"A.M. Geoffrion","year":"1970","unstructured":"A.M. Geoffrion, Primal resource-directive approaches for optimizing nonlinear decomposable systems, Oper. Res. 18 (1970) 375\u2013403.","journal-title":"Oper. Res."},{"key":"BF02072644_CR10","unstructured":"P.A. Jensen and J.W. Barnes,Network Flow Programming (Wiley, 1980)."},{"key":"BF02072644_CR11","unstructured":"J.L. Kennington and R.V. Helgason,Algorithms for Network Programming (Wiley, 1980)."},{"key":"BF02072644_CR12","unstructured":"D.-S. Kim and A. Nagurney, Massively parallel implementation of the splitting equilibration algorithm, Comp. Sci. Econ. Manag. (1992), to appear."},{"key":"BF02072644_CR13","doi-asserted-by":"crossref","unstructured":"K.C. Kiwiel, Approximations in decomposition of large scale convex programs via a nondifferentiable optimization method, in:Proc. 11th IFAC World Congress, eds. V. Utkin and U. Jaaksoo, Tallin (August 1990).","DOI":"10.1016\/S1474-6670(17)52088-1"},{"key":"BF02072644_CR14","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01585731","volume":"46","author":"K.C. Kiwiel","year":"1990","unstructured":"K.C. Kiwiel, Proximity control in bundle methods for convex nondifferentiable minimization, Math. Progr. 46 (1990) 105\u2013122.","journal-title":"Math. Progr."},{"key":"BF02072644_CR15","unstructured":"C. Lemarechal, Nondifferentiable optimization, in:Handbooks in Operations Research and Management Science, vol. 1:Optimization, eds. G.L. Nemhauser, A.H.G. Rinnooy Kan and M.J. Todd (North-Holland, 1989)."},{"key":"BF02072644_CR16","unstructured":"O.L. Mangasarian,Nonlinear Programming (McGraw-Hill, 1969)."},{"key":"BF02072644_CR17","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/978-94-011-3162-9_6","volume":"22","author":"A. Nagurney","year":"1992","unstructured":"A. Nagurney and A. Eydeland, A splitting equilibration algorithm for the computation of large-scale constrained matrix problems: theoretical analysis and applications, in:Computational Economics and Econometrics, Advanced Studies in Theoretical and Applied Econometrics, eds. H.M. Amman, D.A. Belsley and L.F. Pau, vol. 22 (1992) pp. 65\u2013105.","journal-title":"Computational Economics and Econometrics"},{"key":"BF02072644_CR18","series-title":"Techn. Report","volume-title":"Parallel decomposition of multicommodity network flows using smooth penalty functions","author":"M.C. Pinar","year":"1990","unstructured":"M.C. Pinar and S.A. Zenios, Parallel decomposition of multicommodity network flows using smooth penalty functions, Techn. Report 90-12-06, Decision Sciences Department, The Wharton School, Philadelphia, PA (1990)."},{"key":"BF02072644_CR19","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1137\/0802008","volume":"2","author":"H. Schramm","year":"1992","unstructured":"H. Schramm and J. Zowe, A version of the bundle idea for minimizing a nonsmooth function: conceptual idea, convergence analysis, numerical results, SIAM J. Optim. 2 (1992) 121\u2013152.","journal-title":"SIAM J. Optim."},{"key":"BF02072644_CR20","unstructured":"G.L. Schultz, Barrier decomposition for the parallel optimization of block-angular programs, PhD thesis, University of Wisconsin-Madison (1991)."},{"key":"BF02072644_CR21","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1137\/0801035","volume":"4","author":"G.L. Schultz","year":"1991","unstructured":"G.L. Schultz and R.R. Meyer, An interior point method for block angular optimization, SIAM J. Optim. 4 (1991) 583\u2013602.","journal-title":"SIAM J. Optim."},{"key":"BF02072644_CR22","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1137\/0801024","volume":"1","author":"S.A. Zenios","year":"1991","unstructured":"S.A. Zenios and Y. Censor, Massively parallel row-action algorithms for some nonlinear transportation problems, SIAM J. Optim. 1 (1991) 373\u2013400.","journal-title":"SIAM J. Optim."},{"key":"BF02072644_CR23","series-title":"Tech. Report","volume-title":"A smooth penalty function algorithm for network-structured problems","author":"S.A. Zenios","year":"1991","unstructured":"S.A. Zenios, M.C. Pinar and R.S. Dembo, A smooth penalty function algorithm for network-structured problems, Tech. Report 90-12-05, Decision Sciences Department, The Wharton School, Philadelphia, PA (1991)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02072644.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02072644\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02072644","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T20:08:16Z","timestamp":1557778096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02072644"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,10]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,10]]}},"alternative-id":["BF02072644"],"URL":"https:\/\/doi.org\/10.1007\/bf02072644","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,10]]}}}