{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T20:34:08Z","timestamp":1779914048166,"version":"3.53.1"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1993,3]]},"DOI":"10.1007\/bf02096261","type":"journal-article","created":{"date-parts":[[2005,9,12]],"date-time":"2005-09-12T18:23:22Z","timestamp":1126549402000},"page":"157-178","source":"Crossref","is-referenced-by-count":279,"title":["Error bounds and convergence analysis of feasible descent methods: a general approach"],"prefix":"10.1007","volume":"46-47","author":[{"given":"Zhi-Quan","family":"Luo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul","family":"Tseng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF02096261_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":"BF02096261_CR2","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1109\/TAC.1976.1101194","volume":"AC-21","author":"D.P. Bertsekas","year":"1976","unstructured":"D.P. Bertsekas, On the Goldstein-Levitin-Polyak gradient projection method, IEEE Trans. Auto. Contr. AC-21 (1976) 174\u2013184.","journal-title":"IEEE Trans. Auto. Contr."},{"key":"BF02096261_CR3","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/0320018","volume":"20","author":"D.P. Bertsekas","year":"1982","unstructured":"D.P. Bertsekas, Projected Newton methods for optimization problems with simple constraints, SIAM J. Contr. Optim. 20 (1982) 221\u2013246.","journal-title":"SIAM J. Contr. Optim."},{"key":"BF02096261_CR4","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BFb0120965","volume":"17","author":"D.P. Bertsekas","year":"1982","unstructured":"D.P. Bertsekas and E. Gafni, Projection methods for variational inequalities with application to the traffic assignment problem, Math. Prog. Study 17 (1982) 139\u2013159.","journal-title":"Math. Prog. Study"},{"key":"BF02096261_CR5","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":"BF02096261_CR6","volume-title":"A variant of a projected variable metric method for bound constrained optimization problems","author":"J.F. Bonnans","year":"1983","unstructured":"J.F. Bonnans, A variant of a projected variable metric method for bound constrained optimization problems, Working paper, INRIA, France (1983)."},{"key":"BF02096261_CR7","doi-asserted-by":"publisher","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 of finding the common point of convex sets and its application to the solution of problems in convex programming, USSR Comp. Math. Math. Phys. 7 (1967) 200\u2013217.","journal-title":"USSR Comp. Math. Math. Phys."},{"key":"BF02096261_CR8","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/BF00935004","volume":"43","author":"Y.C. Cheng","year":"1984","unstructured":"Y.C. Cheng, On the gradient-projection method for solving the nonsymmetric linear complementarity problem, Appl. Math. Optim. 43 (1984) 527\u2013540.","journal-title":"Appl. Math. Optim."},{"key":"BF02096261_CR9","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1137\/0309028","volume":"9","author":"C.W. Cryer","year":"1971","unstructured":"C.W. Cryer, The solution of a quadratic programming problem using systematic over-relaxation, SIAM J. Contr. Optim. 9 (1971) 385\u2013392.","journal-title":"SIAM J. Contr. Optim."},{"key":"BF02096261_CR10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1002\/nav.3800060105","volume":"6","author":"D. D'Esopo","year":"1959","unstructured":"D. D'Esopo, A convex programming procedure, Naval Res. Logist. Quart. 6 (1959) 33\u201342.","journal-title":"Naval Res. Logist. Quart."},{"key":"BF02096261_CR11","volume-title":"Local convergence analysis for successive inexact quadratic programming methods, Working Paper, School of Organization and Management","author":"R.S. Dembo","year":"1984","unstructured":"R.S. Dembo and U. Tulowizki, Local convergence analysis for successive inexact quadratic programming methods, Working Paper, School of Organization and Management, Yale University, New Haven, CT (1984)."},{"key":"BF02096261_CR12","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1137\/0319022","volume":"19","author":"J.C. Dunn","year":"1981","unstructured":"J.C. Dunn, Global and asymptotic convergence rate estimates for a class of projected gradient processes, SIAM J. Contr. Optim. 19 (1981) 368\u2013400.","journal-title":"SIAM J. Contr. Optim."},{"key":"BF02096261_CR13","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BF00939081","volume":"55","author":"J.C. Dunn","year":"1987","unstructured":"J.C. Dunn, On the convergence of projected gradient processes to singular critical points, J. Optim. Theory Appl. 55 (1987) 203\u2013216.","journal-title":"J. Optim. Theory Appl."},{"key":"BF02096261_CR14","doi-asserted-by":"publisher","first-page":"936","DOI":"10.1137\/0322061","volume":"22","author":"E.M. Gafni","year":"1984","unstructured":"E.M. Gafni and D.P. Bertsekas, Two-metric projection methods for constrained optimization, SIAM J. Contr. Optim. 22 (1984) 936\u2013964.","journal-title":"SIAM J. Contr. Optim."},{"key":"BF02096261_CR15","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BF01448362","volume":"17","author":"M. Gawande","year":"1988","unstructured":"M. Gawande and J.C. Dunn, Variable metric gradient projection processes in convex feasible sets defined by nonlinear inequalities, Appl. Math. Optim. 17 (1988) 103\u2013119.","journal-title":"Appl. Math. Optim."},{"key":"BF02096261_CR16","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1090\/S0002-9904-1964-11178-2","volume":"70","author":"A.A. Goldstein","year":"1964","unstructured":"A.A. Goldstein, Convex programming in Hilbert space, Bull. Am. Math. Soc. 70 (1964) 709\u2013710.","journal-title":"Bull. Am. Math. Soc."},{"key":"BF02096261_CR17","first-page":"38","volume-title":"Proc. 12th Ann. Allerton Conf. on Circuits and Systems","author":"A.A. Goldstein","year":"1974","unstructured":"A.A. Goldstein, On gradient projection,Proc. 12th Ann. Allerton Conf. on Circuits and Systems, Allerton Park, IL (1974) 38\u201340."},{"key":"BF02096261_CR18","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/0329022","volume":"29","author":"O. G\u00fcler","year":"1991","unstructured":"O. G\u00fcler, On the convergence of the proximal point algorithm for convex minimization, SIAM J. Contr. Optim. 29 (1991) 403\u2013419.","journal-title":"SIAM J. Contr. Optim."},{"key":"BF02096261_CR19","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1002\/nav.3800040113","volume":"4","author":"C. Hildreth","year":"1957","unstructured":"C. Hildreth, A quadratic programming procedure, Naval Res. Logist. Quart. 4 (1957) 79\u201385; see also Erratum, Naval Res. Logist. Quart. 4 (1957) 361.","journal-title":"Naval Res. Logist. Quart."},{"key":"BF02096261_CR20","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, On approximate solutions of systems of linear inequalities, J. Res. Natl. Bur. Standards 49 (1952) 263\u2013265.","journal-title":"J. Res. Natl. Bur. Standards"},{"key":"BF02096261_CR21","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1137\/0801025","volume":"1","author":"A.N. Iusem","year":"1991","unstructured":"A.N. Iusem, On dual convergence and the rate of primal convergence of Bregman's convex programming method, SIAM J. Optim. 1 (1991) 401\u2013423.","journal-title":"SIAM J. Optim."},{"key":"BF02096261_CR22","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BF01580851","volume":"47","author":"A.N. Iusem","year":"1990","unstructured":"A.N. Iusem and A. De Pierro, On the convergence properties of Hildreth's quadratic programming algorithm, Math. Prog. 47 (1990) 37\u201351.","journal-title":"Math. Prog."},{"key":"BF02096261_CR23","first-page":"281","volume":"2","author":"H.B. Keller","year":"1965","unstructured":"H.B. Keller, On the solution of singular and semidefinite linear systems by iteration, SIAM J. Numer. Anal. 2 (1965) 281\u2013290.","journal-title":"SIAM J. Numer. Anal."},{"key":"BF02096261_CR24","first-page":"1462","volume":"27","author":"E.N. Khobotov","year":"1987","unstructured":"E.N. Khobotov, A modification of the extragradient method for the solution of variational inequalities and some optimization problems, Zh. Vychisl. Mat i Mat. Fiz. 27 (1987) 1462\u20131473.","journal-title":"Zh. Vychisl. Mat i Mat. Fiz."},{"key":"BF02096261_CR25","first-page":"747","volume":"12","author":"G.M. Korpelevich","year":"1976","unstructured":"G.M. Korpelevich, The extragradient method for finding saddle points and other problems, Ekon. i Mat. Metody, translated into English as Matecon 12 (1976) 747\u2013756.","journal-title":"Metody, translated into English as Matecon"},{"key":"BF02096261_CR26","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1137\/0314020","volume":"14","author":"B.W. Kort","year":"1976","unstructured":"B.W. Kort and D.P. Bertsekas, Combined primal-dual and penalty methods for convex programming, SIAM J. Contr. Optim. 14 (1976) 268\u2013294.","journal-title":"SIAM J. Contr. Optim."},{"key":"BF02096261_CR27","first-page":"E15","volume":"52","author":"J. Kruithof","year":"1937","unstructured":"J. Kruithof, Calculation of telephone traffic, De Ingenieur (E. Electrotechnik 3) 52 (1937) E15\u201325.","journal-title":"De Ingenieur (E. Electrotechnik 3)"},{"key":"BF02096261_CR28","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1137\/0803008","volume":"3","author":"W. Li","year":"1993","unstructured":"W. Li, Remarks on convergence of matrix splitting algorithm for the symmetric linear complementarity problem, SIAM J. Optim. 3 (1993) 155\u2013163.","journal-title":"SIAM J. Optim."},{"key":"BF02096261_CR29","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1137\/0325023","volume":"25","author":"Y.Y. Lin","year":"1987","unstructured":"Y.Y. Lin and J.-S. Pang, Iterative methods for large convex quadratic programs: A survey, SIAM J. Contr. Optim. 25 (1987) 383\u2013411.","journal-title":"SIAM J. Contr. Optim."},{"key":"BF02096261_CR30","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":"BF02096261_CR31","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0167-6377(92)90080-M","volume":"11","author":"Z.-Q. Luo","year":"1992","unstructured":"Z.-Q. Luo and P. Tseng, On global error bound for a class of monotone affine variational inequality problems, Oper. Res. Lett. 11 (1992) 159\u2013165.","journal-title":"Oper. Res. Lett."},{"key":"BF02096261_CR32","volume-title":"Error bound and reduced gradient projection algorithms for convex minimization over a polyhedral set, Technical Report, Department of Electrical and Computer Engineering, McMaster University, Hamilton, Ontario and Department of Mathematics","author":"Z.-Q. Luo","year":"1990","unstructured":"Z.-Q. Luo and P. Tseng, Error bound and reduced gradient projection algorithms for convex minimization over a polyhedral set, Technical Report, Department of Electrical and Computer Engineering, McMaster University, Hamilton, Ontario and Department of Mathematics, University of Washington, Seattle, WA (December 1990); to appear in SIAM J. Optim."},{"key":"BF02096261_CR33","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1137\/0329057","volume":"29","author":"Z.-Q. Luo","year":"1991","unstructured":"Z.-Q. Luo and P. Tseng, On the convergence of a matrix splitting algorithm for the symmetric monotone linear complementarity problem, SIAM J. Contr. Optim. 29 (1991) 1037\u20131060.","journal-title":"SIAM J. Contr. Optim."},{"key":"BF02096261_CR34","volume-title":"On the rate of convergence of a class of distributed asynchronous routing algorithms, Technical Report, Department of Electrical and Computer Engineering, McMaster University, Hamilton, Ontario and Department of Mathematics","author":"Z.-Q. Luo","year":"1991","unstructured":"Z.-Q. Luo and P. Tseng, On the rate of convergence of a class of distributed asynchronous routing algorithms, Technical Report, Department of Electrical and Computer Engineering, McMaster University, Hamilton, Ontario and Department of Mathematics, University of Washington, Seattle, WA (May 1991), to appear in Math. Oper. Res. 18 (1993)."},{"key":"BF02096261_CR35","doi-asserted-by":"crossref","unstructured":"Z.-Q. Luo and P. Tseng, On the convergence rate of dual ascent methods for strictly convex minimization, to appear in Math. Oper. Res. 18 (1993).","DOI":"10.1287\/moor.18.4.846"},{"key":"BF02096261_CR36","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF00939948","volume":"72","author":"Z.-Q. Luo","year":"1992","unstructured":"Z.-Q. Luo and P. Tseng, On the convergence of the coordinate descent method for convex differentiable minimization, J. Optim. Theory Appl. 72 (1992) 7\u201335.","journal-title":"J. Optim. Theory Appl."},{"key":"BF02096261_CR37","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1137\/0802004","volume":"2","author":"Z.-Q. Luo","year":"1992","unstructured":"Z.-Q. Luo and P. Tseng, Error bound and the convergence analysis of matrix splitting algorithms for the affine variational inequality problem, SIAM J. Optim. 2 (1992) 43\u201354.","journal-title":"SIAM J. Optim."},{"key":"BF02096261_CR38","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1137\/0330025","volume":"30","author":"Z.-Q. Luo","year":"1992","unstructured":"Z.-Q. Luo and P. Tseng, On the linear convergence of descent methods for convex essentially smooth minimization, SIAM J. Contr. Optim. 30 (1992) 408\u2013425.","journal-title":"SIAM J. Contr. Optim."},{"key":"BF02096261_CR39","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/BF01268170","volume":"22","author":"O.L. Mangasarian","year":"1977","unstructured":"O.L. Mangasarian, Solution of symmetric linear complementarity problems by iterative methods, J. Optim. Theory Appl. 22 (1977) 465\u2013485.","journal-title":"J. Optim. Theory Appl."},{"key":"BF02096261_CR40","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0305-0548(69)90004-5","volume":"11","author":"O.L. Mangasarian","year":"1984","unstructured":"O.L. Mangasarian, Sparsity-preserving SOR algorithms for separable quadratic and linear programming, Comp. Oper. Res. 11 (1984) 105\u2013112.","journal-title":"Comp. Oper. Res."},{"key":"BF02096261_CR41","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BF01582267","volume":"48","author":"O.L. Mangasarian","year":"1990","unstructured":"O.L. Mangasarian, Error bounds for nondegenerate monotone linear complementarity problems, Math. Prog. 48 (1990) 437\u2013445.","journal-title":"Math. Prog."},{"key":"BF02096261_CR42","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1137\/0801009","volume":"1","author":"O.L. Mangasarian","year":"1991","unstructured":"O.L. Mangasarian, Convergence of iterates of an inexact matrix splitting algorithm for the symmetric monotone linear complementarity problem, SIAM J. Optim. 1 (1991) 114\u2013122.","journal-title":"SIAM J. Optim."},{"key":"BF02096261_CR43","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0024-3795(92)90049-G","volume":"174","author":"O.L. Mangasarian","year":"1992","unstructured":"O.L. Mangasarian, Global error bounds for monotone affine variational inequality problems, Lin. Alg. Appl. 174 (1992) 153\u2013163.","journal-title":"Lin. Alg. Appl."},{"key":"BF02096261_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01448356","volume":"17","author":"O.L. Mangasarian","year":"1988","unstructured":"O.L. Mangasarian and R. De Leone, Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs. Appl. Math. Optim. 17 (1988) 1\u201314.","journal-title":"Appl. Math. Optim."},{"key":"BF02096261_CR45","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF02591991","volume":"36","author":"O.L. Mangasarian","year":"1986","unstructured":"O.L. Mangasarian and T.-H. Shiau, Error bounds for monotone linear complementarity problems, Math. Prog. 36 (1986) 81\u201389.","journal-title":"Math. Prog."},{"key":"BF02096261_CR46","first-page":"258","volume":"29","author":"P. Marcotte","year":"1991","unstructured":"P. Marcotte, Application of Khobotov's algorithm to variational inequalities and network equilibrium problems, Inf. Syst. Oper. Res. 29 (1991) 258\u2013270.","journal-title":"Inf. Syst. Oper. Res."},{"key":"BF02096261_CR47","first-page":"154","volume":"4","author":"B. Martinet","year":"1970","unstructured":"B. Martinet, Regularisation d'in\u00e9quations variationnelles par approximations successives, Rev. Fran\u00e7aise d'Auto. et Inform. Rech. Op\u00e9r. 4 (1970) 154\u2013159.","journal-title":"Rev. Fran\u00e7aise d'Auto. et Inform. Rech. Op\u00e9r."},{"key":"BF02096261_CR48","first-page":"163","volume":"274","author":"B. Martinet","year":"1972","unstructured":"B. Martinet, Determination approch\u00e9e d'un point fixe d'une application pseudo-contractante, C.R. Acad. Sci. Paris 274 (1972) 163\u2013165.","journal-title":"C.R. Acad. Sci. Paris"},{"key":"BF02096261_CR49","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0024-3795(90)90058-K","volume":"132","author":"R. Mathias","year":"1990","unstructured":"R. Mathias, and J.-S. Pang, Error bounds for the linear complementarity problem with aP-matrix, Lin. Alg. Appl. 132 (1990) 123\u2013136.","journal-title":"Lin. Alg. Appl."},{"key":"BF02096261_CR50","unstructured":"J.J. Mor\u00e9, Gradient projection techniques for large-scale optimization problems,Proc. 28th Conf. on Decision and Control, Tampa, FL (December 1989)."},{"key":"BF02096261_CR51","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":"BF02096261_CR52","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF00934765","volume":"37","author":"J.-S. Pang","year":"1982","unstructured":"J.-S. Pang, On the convergence of a basic iterative method for the implicit complementarity problem, J. Optim. Theory Appl. 37 (1982) 149\u2013162.","journal-title":"J. Optim. Theory Appl."},{"key":"BF02096261_CR53","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00934130","volume":"42","author":"J.-S. Pang","year":"1984","unstructured":"J.-S. Pang, Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem, J. Optim. Theory Appl. 42 (1984) 1\u201317.","journal-title":"J. Optim. Theory Appl."},{"key":"BF02096261_CR54","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF00939250","volume":"49","author":"J.-S. Pang","year":"1986","unstructured":"J.-S. Pang, More results on the convergence of iterative methods for the symmetric linear complementarity problem, J. Optim. Theory Appl. 49 (1986) 107\u2013134.","journal-title":"J. Optim. Theory Appl."},{"key":"BF02096261_CR55","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/BF02591989","volume":"36","author":"J.-S. Pang","year":"1986","unstructured":"J.-S. Pang, Inexact Newton methods for the nonlinear complementarity problem, Math. Prog. 36 (1986) 54\u201371.","journal-title":"Math. Prog."},{"key":"BF02096261_CR56","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1287\/moor.12.3.474","volume":"12","author":"J.-S. Pang","year":"1987","unstructured":"J.-S. Pang, A posteriori error bounds for the linearly-constrained variational inequality problem, Math. Oper. Res. 12 (1987) 474\u2013484.","journal-title":"Math. Oper. Res."},{"key":"BF02096261_CR57","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/BFb0120929","volume":"14","author":"S.M. Robinson","year":"1981","unstructured":"S.M. Robinson, Some continuity properties of polyhedral multifunctions, Math. Prog. Study 14 (1981) 206\u2013214.","journal-title":"Math. Prog. Study"},{"key":"BF02096261_CR58","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/BFb0120989","volume":"14","author":"S.M. Robinson","year":"1982","unstructured":"S.M. Robinson, Generalized equations and their solutions, Part II: Applications to nonlinear programming, Math. Prog. Study 14 (1982) 200\u2013221.","journal-title":"Math. Prog. Study"},{"key":"BF02096261_CR59","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"R.T. Rockafellar","year":"1976","unstructured":"R.T. Rockafellar, Monotone operators and the proximal point algorithm, SIAM J. Contr. Optim. 14 (1976) 877\u2013898.","journal-title":"SIAM J. Contr. Optim."},{"key":"BF02096261_CR60","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1287\/moor.1.2.97","volume":"1","author":"R.T. Rockafellar","year":"1976","unstructured":"R.T. Rockafellar, Augmented Lagrangians and applications of the proximal point algorithm in convex programming, Math. Oper. Res. 1 (1976) 97\u2013116.","journal-title":"Math. Oper. Res."},{"key":"BF02096261_CR61","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1137\/0328011","volume":"28","author":"P. Tseng","year":"1990","unstructured":"P. Tseng, Dual Ascent methods for problems with strictly convex costs and linear constraints: A unified approach, SIAM J. Contr. Optim. 28 (1990) 214\u2013242.","journal-title":"SIAM J. Contr. Optim."},{"key":"BF02096261_CR62","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1137\/0801036","volume":"1","author":"P. Tseng","year":"1991","unstructured":"P. Tseng, On the rate of convergence of a partially asynchronous gradient projection algorithm, SIAM J. Optim, 1 (1991) 603\u2013619.","journal-title":"SIAM J. Optim"},{"key":"BF02096261_CR63","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1109\/TAC.1986.1104261","volume":"AC-31","author":"J.N. Tsitsiklis","year":"1986","unstructured":"J.N. Tsitsiklis and D.P. Bertsekas, Distributed asynchronous optimal routing in data networks, IEEE Trans. Auto. Contr. AC-31 (1986) 325\u2013332.","journal-title":"IEEE Trans. Auto. Contr."},{"key":"BF02096261_CR64","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1109\/TAC.1986.1104412","volume":"AC-31","author":"J.N. Tsitsiklis","year":"1986","unstructured":"J.N. Tsitsiklis, D.P. Bertsekas and M. Athans, Distributed asynchronous deterministic and stochastic gradient optimization algorithms, IEEE Trans. Auto. Contr. AC-31 (1986) 803\u2013812.","journal-title":"IEEE Trans. Auto. Contr."},{"key":"BF02096261_CR65","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1137\/0111043","volume":"11","author":"J. Warga","year":"1963","unstructured":"J. Warga, Minimizing certain convex functions, J. Soc. Indust. Appl. Math. 11 (1963) 588\u2013593.","journal-title":"J. Soc. Indust. Appl. Math."},{"key":"BF02096261_CR66","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(66)90114-5","volume":"6","author":"E.S. Levitin","year":"1965","unstructured":"E.S. Levitin and B.T. Polyak, Constrained minimization methods, USSR Comp. Math. Math. Phys. 6 (1965) 1\u201350.","journal-title":"USSR Comp. Math. Math. Phys."},{"key":"BF02096261_CR67","doi-asserted-by":"publisher","first-page":"1160","DOI":"10.1137\/0329062","volume":"29","author":"J.C. Dunn","year":"1991","unstructured":"J.C. Dunn, A subspace decomposition principle for scaled gradient projection methods: global theory, SIAM J. Contr. Optim. 29 (1991) 1160\u20131175.","journal-title":"SIAM J. Contr. Optim."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02096261.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF02096261\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02096261","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02096261.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T00:14:50Z","timestamp":1652487290000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF02096261"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":67,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["BF02096261"],"URL":"https:\/\/doi.org\/10.1007\/bf02096261","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}