{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T12:41:30Z","timestamp":1772800890404,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"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":[[1993,6]]},"DOI":"10.1007\/bf01580598","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:43:41Z","timestamp":1114681421000},"page":"1-19","source":"Crossref","is-referenced-by-count":130,"title":["On the convergence of the exponential multiplier method for convex programming"],"prefix":"10.1007","volume":"60","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","unstructured":"D.P. Bertsekas, G.S. Lauer, N.R. Sandell, Jr. and T.A. Posbergh, \u201cOptimal short term scheduling of large-scale power systems,\u201dIEEE Transactions on Automatic Control AC-28 (1982) 1\u201311."},{"key":"CR2","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"D.P. Bertsekas","year":"1989","unstructured":"D.P. Bertsekas and J.N. Tsitsiklis,Parallel and Distributed Computation: Numerical Methods (Prentice-Hall, Englewood Cliffs, NJ, 1989)."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01681332","volume":"9","author":"D.P. Bertsekas","year":"1975","unstructured":"D.P. Bertsekas, \u201cNecessary and sufficient conditions for a penalty method to be exact,\u201dMathematical Programming 9 (1975) 87\u201399.","journal-title":"Mathematical Programming"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"D.P. Bertsekas, \u201cNewton's method for linear optimal control problems,\u201d in:Proceedings of the Symposium on Large Scale Systems (Udine, 1976) pp. 353\u2013359.","DOI":"10.1016\/S1474-6670(17)67358-0"},{"key":"CR5","volume-title":"Constrained Optimization and Lagrange Multiplier Methods","author":"D.P. Bertsekas","year":"1982","unstructured":"D.P. Bertsekas,Constrained Optimization and Lagrange Multiplier Methods (Academic Press, New York, 1982)."},{"key":"CR6","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, \u201cThe relaxation method of finding the common point convex sets and its application to the solution of problems in convex programming,\u201dUSSR Computational Mathematics and Mathematical Physics 7 (1967) 200\u2013217.","journal-title":"USSR Computational Mathematics and Mathematical Physics"},{"key":"CR7","unstructured":"Y. Censor and S.A. Zenios, \u201cThe proximal minimization algorithm with D-functions,\u201d (1989), to appear in:Journal of Optimization Theory and Applications."},{"key":"CR8","unstructured":"G. Chen and M. Teboulle, \u201cConvergence analysis of a proximal-like minimization algorithm using Bregman functions,\u201d (1990), to appear in:SIAM Journal on Optimization."},{"key":"CR9","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":"CR10","unstructured":"J. Eckstein, \u201cNonlinear proximal point algorithms using Bregman functions, with applications to convex programming,\u201d (1990), to appear in:Mathematics of Operations Research."},{"key":"CR11","volume-title":"Nonlinear Programming: Sequential Unconstrained Minimization Techniques","author":"A.V. Fiacco","year":"1968","unstructured":"A.V. Fiacco and G.P. McCormick,Nonlinear Programming: Sequential Unconstrained Minimization Techniques (Wiley, New York, 1968)."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/BFb0120845","volume":"10","author":"E.G. Golshtein","year":"1979","unstructured":"E.G. Golshtein and N.V. Tretjiakov, \u201cModified Lagrangians in convex programming and their generalizations,\u201dMathematical Programming Studies 10 (1979) 86\u201397.","journal-title":"Mathematical Programming Studies"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1137\/0328029","volume":"28","author":"C.D. Ha","year":"1990","unstructured":"C.D. Ha, \u201cA generalization of the proximal point algorithm,\u201dSIAM Journal on Control and Optimization 28 (1990) 503\u2013512.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"263","DOI":"10.6028\/jres.049.027","volume":"49","author":"A.J. Hoffman","year":"1952","unstructured":"A.J. Hoffman, \u201cOn approximate solutions of systems of linear inequalities,\u201dJournal of Research of the National Bureau of Standards 49 (1952) 263\u2013265.","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"B.W. Kort and D.P. Bertsekas, \u201cA new penalty function method for constrained minimization,\u201d in:Proceedings of the 1972IEEE conference on decision and control (New Orleans, 1972) pp. 162\u2013166.","DOI":"10.1109\/CDC.1972.268971"},{"key":"CR16","first-page":"79","volume":"101","author":"G.S. Lauer","year":"1981","unstructured":"G.S. Lauer, D.P. Bertsekas, N.R. Sandell, Jr. and T.A. Posbergh, \u201cOptimal solution of large-scale unit commitment problems,\u201dIEEE Transactions on Power Systems and Apparatus 101 (1981) 79\u201386.","journal-title":"IEEE Transactions on Power Systems and Apparatus"},{"key":"CR17","volume-title":"Linear and Nonlinear Programming","author":"D.G. Luenberger","year":"1984","unstructured":"D.G. Luenberger,Linear and Nonlinear Programming (Addison-Wesley, Reading, MA, 1984)."},{"key":"CR18","volume-title":"Nonlinear proximal point algorithms","author":"F.J. Luque","year":"1984","unstructured":"F.J. Luque, \u201cNonlinear proximal point algorithms,\u201d Ph.D. Thesis, Department of Civil Engineering and Operations Research Center, Massachusetts Institute of Technology (Cambridge, MA, 1984)."},{"key":"CR19","volume-title":"\u201cThe nonlinear proximal point algorithm,\u201d Report LIDS-P-1598","author":"F.J. Luque","year":"1986","unstructured":"F.J. Luque, \u201cThe nonlinear proximal point algorithm,\u201d Report LIDS-P-1598, Laboratory for Information and Decision Systems, Massachusetts Institute of Technology (Cambridge, MA, 1986)."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1137\/0325033","volume":"25","author":"O.L. Mangasarian","year":"1987","unstructured":"O.L. Mangasarian and T.-H. Shiau, \u201cLipschitz continuity of solutions of linear inequalities, programs and complementarity problems,\u201dSIAM Journal of Control and Optimization 25 (1987) 583\u2013595.","journal-title":"SIAM Journal of Control and Optimization"},{"key":"CR21","first-page":"154","volume":"4","author":"B. Martinet","year":"1970","unstructured":"B. Martinet, \u201cRegularisation d'in\u00e9quations variationelles par approximations successives,\u201dRevue Fran\u00e7aise d'Automatique et Informatique Recherche Op\u00e9rationalle 4 (1970) 154\u2013159.","journal-title":"Revue Fran\u00e7aise d'Automatique et Informatique Recherche Op\u00e9rationalle"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/BF00933436","volume":"27","author":"V.H. Nguyen","year":"1979","unstructured":"V.H. Nguyen and J.J. Strodiot, \u201cOn the convergence rate of a penalty function method of exponential type,\u201dJournal of Optimization Theory and Applications 27 (1979) 495\u2013508.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"CR23","first-page":"34","volume":"10","author":"B.T. Poljak","year":"1974","unstructured":"B.T. Poljak and N.V. Tretjakov, \u201cAn iterative method for linear programming and its economic interpretation,\u201dMatecon 10 (1974) 34\u201346.","journal-title":"Matecon"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0024-3795(73)90007-4","volume":"6","author":"S.M. Robinson","year":"1973","unstructured":"S.M. Robinson, \u201cBounds for errors in the solution set of a perturbed linear program,\u201dLinear Algebra and its Applications 6 (1973) 69\u201381.","journal-title":"Linear Algebra and its Applications"},{"key":"CR25","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":"CR26","unstructured":"R.T. Rockafellar, \u201cNew applications of duality in convex programming,\u201d in:Proceedings of the Conference on Probability (Brasov, 1971) pp. 73\u201381."},{"key":"CR27","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 minimization,\u201dMathematical Programming 5 (1973) 354\u2013373.","journal-title":"Mathematical Programming"},{"key":"CR28","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"R.T. Rockafellar","year":"1976","unstructured":"R.T. Rockafellar, \u201cMonotone operators and the proximal point algorithm,\u201dSIAM Journal on Control and Optimization 14 (1976) 877\u2013898.","journal-title":"SIAM Journal on Control and Optimization"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580598.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580598\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580598","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:12:09Z","timestamp":1556896329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580598"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":28,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["BF01580598"],"URL":"https:\/\/doi.org\/10.1007\/bf01580598","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}