{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T07:52:23Z","timestamp":1770537143219,"version":"3.49.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"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,3]]},"DOI":"10.1007\/bf01581245","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:46:38Z","timestamp":1114681598000},"page":"231-247","source":"Crossref","is-referenced-by-count":48,"title":["Dual coordinate ascent methods for non-strictly convex minimization"],"prefix":"10.1007","volume":"59","author":[{"given":"Paul","family":"Tseng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Optimisation M\u00e9thodes Num\u00e9riques","author":"A. Auslender","year":"1976","unstructured":"A. Auslender,Optimisation M\u00e9thodes Num\u00e9riques (Masson, Paris, 1976)."},{"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":"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":"CR4","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1137\/0325050","volume":"25","author":"Y. Censor","year":"1987","unstructured":"Y. Censor and A. Lent, \u201cOptimization of \u201clogx\u201d entropy over linear equality constraints,\u201dSIAM Journal on Control and Optimization 25 (1987) 921\u2013933.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1093\/comjnl\/13.2.178","volume":"13","author":"P.C. Haarhoff","year":"1970","unstructured":"P.C. Haarhoff and J.D. Buys, \u201cA new method for the optimization of a nonlinear function subject to nonlinear constraints,\u201dThe Computer Journal 13 (1970) 178\u2013184.","journal-title":"The Computer Journal"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01580719","volume":"40","author":"S.-P. Han","year":"1988","unstructured":"S.-P. Han, \u201cA successive projection method,\u201dMathematical Programming 40 (1988) 1\u201314.","journal-title":"Mathematical Programming"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1287\/moor.14.2.237","volume":"14","author":"S.-P. Han","year":"1989","unstructured":"S.-P. Han, \u201cA decomposition method and its application to convex programming,\u201dMathematics of Operations Research 14 (1989) 237\u2013248.","journal-title":"Mathematics of Operations Research"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF00927673","volume":"4","author":"M.R. Hestenes","year":"1969","unstructured":"M.R. Hestenes, \u201cMultiplier and gradient methods,\u201dJournal of Optimization Theory and Applications 4 (1969) 303\u2013320.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"CR9","volume-title":"On the convergence of dual ascent methods for large-scale linearly constrained optimizaton problems","author":"J.-S. Pang","year":"1984","unstructured":"J.-S. Pang, \u201cOn the convergence of dual ascent methods for large-scale linearly constrained optimizaton problems,\u201d Unpublished manuscript, School of Management, The University of Texas (Dallas, 1984)."},{"key":"CR10","first-page":"283","volume-title":"Optimization","author":"M.J.D. Powell","year":"1969","unstructured":"M.J.D. Powell, \u201cA Method for Nonlinear Constraints in Minimization Problems,\u201d in: R. Fletcher, ed.,Optimization (Academic Press, New York, 1969) pp. 283\u2013298."},{"key":"CR11","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":"CR12","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/moor.1.2.97","volume":"1","author":"R.T. Rockafellar","year":"1976","unstructured":"R.T. Rockafellar, \u201cAugmented lagrangians and applications of the proximal point algorithm in convex programming,\u201dMathematics of Operations Research 1 (1976) 97\u2013116.","journal-title":"Mathematics of Operations Research"},{"key":"CR13","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"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1287\/moor.16.3.462","volume":"16","author":"P. Tseng","year":"1991","unstructured":"P. Tseng and D.P. Bertsekas, \u201cRelaxation methods for problems with strictly convex costs and linear inequality constraints,\u201dMathematics of Operations Research 16 (1991) 462\u2013481.","journal-title":"Mathematics of Operations Research"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1137\/0328011","volume":"28","author":"P. Tseng","year":"1990","unstructured":"P. Tseng, \u201cDual ascent methods for problems with strictly convex costs and linear costraints: a unified approach,\u201dSIAM Journal on Control and Optimization 28 (1990) 214\u2013242.","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\/BF01581245.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581245\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581245","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:12:16Z","timestamp":1556896336000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581245"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["BF01581245"],"URL":"https:\/\/doi.org\/10.1007\/bf01581245","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}