{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T18:06:28Z","timestamp":1761674788997,"version":"3.41.2"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1023\/a:1008714607737","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T11:37:32Z","timestamp":1040557052000},"page":"111-120","source":"Crossref","is-referenced-by-count":44,"title":["Convergence of the Gradient Projection Method for Generalized Convex Minimization"],"prefix":"10.1007","volume":"16","author":[{"given":"Changyu","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naihua","family":"Xiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"265230_CR1","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1109\/TAC.1976.1101194","volume":"AC-21","author":"D.P. Bertsekas","year":"1976","unstructured":"D.P. Bertsekas, \u201cOn the Goldstein-Levitin-Polyak gradient projection method,\u201d IEEE Trans. Automat. Contr., vol. AC-21, pp. 174\u2013184, 1976.","journal-title":"IEEE Trans. Automat. Contr."},{"key":"265230_CR2","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/0320018","volume":"20","author":"D.P. Bertsekas","year":"1982","unstructured":"D.P. Bertsekas, \u201cProjected Newton method for optimization problems with simple constraints,\u201d SIAM J. Control Optim., vol. 20, pp. 221\u2013246, 1982.","journal-title":"SIAM J. Control Optim."},{"key":"265230_CR3","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF01580867","volume":"47","author":"J.V. Burke","year":"1990","unstructured":"J.V. Burke, J.J. Mor\u00e9, and G. Toraldo, \u201cConvergence properties of trust region methods for linear and convex constraints,\u201d Math. Programming, vol. 47, pp. 305\u2013336, 1990.","journal-title":"Math. Programming"},{"key":"265230_CR4","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF02592073","volume":"39","author":"P.H. Calamai","year":"1987","unstructured":"P.H. Calamai and J.J. Mor\u00e9, \u201cProjected gradient methods for linearly constrained problems,\u201d Math. Programming, vol. 39, pp. 93\u2013116, 1987.","journal-title":"Math. Programming"},{"key":"265230_CR5","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/BF00935004","volume":"43","author":"Y.C. Cheng","year":"1984","unstructured":"Y.C. Cheng, \u201cOn the gradient-projection method for solving the nonsymmetric linear complementarity problem,\u201d J. Optim. Theory Appl., vol. 43, pp. 527\u2013541, 1984.","journal-title":"J. Optim. Theory Appl."},{"key":"265230_CR6","series-title":"Technical Report","volume-title":"Minimizing and stationary sequences of optimization problems","author":"C.C. Chou","year":"1996","unstructured":"C.C. Chou, K.F. Ng, and J.S. Pang, \u201cMinimizing and stationary sequences of optimization problems,\u201dTechnical Report, The Johns Hopkins University, Baltimore, Maryland 21218-2692, USA, 1996."},{"issue":"2","key":"265230_CR7","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1137\/0725029","volume":"25","author":"A.R. Conn","year":"1988","unstructured":"A.R. Conn, N.I.M. Gould, and PH.L. Toint, \u201cGlobal convergence of a class of trust region algorithms for optimization with simple bounds,\u201d SIAM J. Numer. Anal., vol. 25, no. 2, pp. 433\u2013460, 1988.","journal-title":"SIAM J. Numer. Anal."},{"key":"265230_CR8","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1090\/S0025-5718-1988-0929544-3","volume":"50","author":"A.R. Conn","year":"1988","unstructured":"A.R. Conn, N.I.M. Gould, and PH.L. Toint, \u201cTesting a class of methods for solving minimization problems with simple bounds on the variable,\u201d Mathematics of Computation, vol. 50, pp. 399\u2013430, 1988.","journal-title":"Mathematics of Computation"},{"key":"265230_CR9","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1137\/0114053","volume":"14","author":"J.M. Danskin","year":"1966","unstructured":"J.M. Danskin, \u201cThe theory of max-min, with applications,\u201d SIAM J. Appl. Math., vol. 14, pp. 641\u2013664, 1966.","journal-title":"SIAM J. Appl. Math."},{"key":"265230_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0022-247X(67)90162-X","volume":"17","author":"J.C. Dunn","year":"1967","unstructured":"J.C. Dunn, \u201cOn the classification of singular and nonsingular extremals for the pontryagin maximum principle,\u201d J. Math. Anal. Appl., vol. 17, pp. 1\u201336, 1967.","journal-title":"J. Math. Anal. Appl."},{"key":"265230_CR11","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1137\/0319022","volume":"19","author":"J.C. Dunn","year":"1981","unstructured":"J.C. Dunn, \u201cGlobal and asymptotic convergence rate estimates for a class of projected gradient processes,\u201d SIAM J. Control Optim., vol. 19, pp. 368\u2013400, 1981.","journal-title":"SIAM J. Control Optim."},{"key":"265230_CR12","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF00939081","volume":"55","author":"J.C. Dunn","year":"1987","unstructured":"J.C. Dunn, \u201cOn the convergence of projected gradient processes to singular attractors,\u201d J. Optim. Theory Appl., vol. 55, pp. 203\u2013215, 1987.","journal-title":"J. Optim. Theory Appl."},{"key":"265230_CR13","doi-asserted-by":"crossref","first-page":"1160","DOI":"10.1137\/0329062","volume":"29","author":"J.C. Dunn","year":"1991","unstructured":"J.C. Dunn, \u201cA subspace decomposition principle for scaled gradient projection methods: Global theory,\u201d SIAM J. Control Optim., vol. 29, pp. 1160\u20131175, 1991.","journal-title":"SIAM J. Control Optim."},{"key":"265230_CR14","series-title":"Laboratory for Information and Decision Systems Report","volume-title":"Convergence of a gradient projection method","author":"E.M. Gafni","year":"1982","unstructured":"E.M. Gafni and D.P. Bertsekas, \u201cConvergence of a gradient projection method,\u201d Laboratory for Information and Decision Systems Report No.P-121, Massachusetts Institute of Technology, Cambridge, MA, 1982."},{"key":"265230_CR15","doi-asserted-by":"crossref","first-page":"936","DOI":"10.1137\/0322061","volume":"22","author":"E.M. Gafni","year":"1984","unstructured":"E.M. Gafni and D.P. Bertsekas, \u201cTwo-metric projection methods for constrained optimization,\u201d SIAM J. Control. Optim., vol. 22, pp. 936\u2013964, 1984.","journal-title":"SIAM J. Control. Optim."},{"key":"265230_CR16","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1090\/S0002-9904-1964-11178-2","volume":"70","author":"A.A. Goldstein","year":"1964","unstructured":"A.A. Goldstein, \u201cConvex programming in Hilbert space,\u201d Bull. Amer. Math. Soc., vol. 70, pp. 709\u2013710, 1964.","journal-title":"Bull. Amer. Math. Soc."},{"key":"265230_CR17","unstructured":"A.A. Goldstein, \u201cOn gradient projection,\u201d in Proc. 12th Ann. Allerton Conference and Circuits and Systems, Allerton Park, IL, 1974, pp. 38-40."},{"key":"265230_CR18","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF02192649","volume":"89","author":"K.C. Kiwiel","year":"1996","unstructured":"K.C. Kiwiel and K. Murty, \u201cConvergence of the steepest descent method for minimizing quasiconvex function,\u201d J. Optim. Theory Appl., vol. 89, pp. 221\u2013226, 1996.","journal-title":"J. Optim. Theory Appl."},{"key":"265230_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0041-5553(66)90114-5","volume":"6","author":"E.S. Levitin","year":"1966","unstructured":"E.S. Levitin and B.T. Polyak, \u201cConstrained minimization problems,\u201d USSR. Comput. Math. Math. Phys., vol. 6, pp. 1\u201350, 1966.","journal-title":"USSR. Comput. Math. Math. Phys."},{"key":"265230_CR20","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF00939948","volume":"72","author":"Z.Q. Luo","year":"1992","unstructured":"Z.Q. Luo and P. Tseng, \u201cOn the convergence of the coordinate descent method for convex differentiable minimization,\u201d J. Optim. Theory Appl., vol. 72, pp. 7\u201335, 1992.","journal-title":"J. Optim. Theory Appl."},{"key":"265230_CR21","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1137\/0330025","volume":"30","author":"Z.Q. Luo","year":"1992","unstructured":"Z.Q. Luo and P. Tseng, \u201cOn the linear convergence of descent methods for convex essentially smooth minimization,\u201d SIAM J. Control Optim., vol. 30, pp. 408\u2013425, 1992.","journal-title":"SIAM J. Control Optim."},{"key":"265230_CR22","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1137\/0310009","volume":"10","author":"G.P. McCormick","year":"1972","unstructured":"G.P. McCormick and R.A. Tapia, \u201cThe gradient projection method under mild differentiability conditions,\u201d SIAM J. Control Optim., vol. 10, pp. 93\u201398, 1972.","journal-title":"SIAM J. Control Optim."},{"key":"265230_CR23","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1137\/0324042","volume":"24","author":"R.R. Phelps","year":"1986","unstructured":"R.R. Phelps, \u201cThe gradient projection method using Curry's steplength,\u201d SIAM J. Control Optim., vol. 24, pp. 692\u2013699, 1986.","journal-title":"SIAM J. Control Optim."},{"key":"265230_CR24","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01449032","volume":"12","author":"B. Rustem","year":"1984","unstructured":"B. Rustem, \u201cA class of superlinearly convergent projection algorithms with relaxed stepsizes,\u201d Appl. Math. Optim., vol. 12, pp. 29\u201343, 1984.","journal-title":"Appl. Math. Optim."},{"key":"265230_CR25","doi-asserted-by":"crossref","first-page":"1814","DOI":"10.1137\/S0363012994268655","volume":"34","author":"M.V. Solodov","year":"1996","unstructured":"M.V. Solodov and P. Tseng, \u201cModified projection-type methods for monotone variational inequalities,\u201d SIAM J. Control Optim., vol. 34, pp. 1814\u20131830, 1996.","journal-title":"SIAM J. Control Optim."},{"key":"265230_CR26","first-page":"37","volume":"4","author":"C.Y. Wang","year":"1981","unstructured":"C.Y. Wang, \u201cConvergence characterizations of both newpivote method and simplified Levitin-Polyak gradient projection method,\u201d Acta Math. Appl. Sinica, vol. 4, pp. 37\u201352, 1981. (In Chinese)","journal-title":"Acta Math. Appl. Sinica"},{"key":"265230_CR27","unstructured":"C.Y. Wang, \u201cOn convergence properties of an improved reduced gradient method,\u201d Ke Xue Tongbao, vol. 17, pp. 1030-1033. (In Chinese)"},{"key":"265230_CR28","first-page":"286","volume":"11","author":"F. Wu","year":"1995","unstructured":"F. Wu and S. Wu, \u201cA modified Frank-Wolfe algorithm and its convergence properties,\u201d Acta Math. Appl. Sinica, vol. 11, pp. 286\u2013291, 1995.","journal-title":"Acta Math. Appl. Sinica"},{"key":"265230_CR29","first-page":"396","volume":"10","author":"G.L. Xue","year":"1987","unstructured":"G.L. Xue, \u201cA family of gradient projection algorithms and their convergence properties,\u201d Acta Math. Appl. Sinica, vol. 10, pp. 396\u2013404, 1987. (In Chinese)","journal-title":"Acta Math. Appl. Sinica"},{"key":"265230_CR30","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF00939279","volume":"50","author":"G.L. Xue","year":"1986","unstructured":"G.L. Xue, \u201cOn convergence properties of a Least-Distance programming procedure for minimization problems under linear constraints,\u201d J. Optim. Theory Appl., vol. 50, pp. 365\u2013370, 1986.","journal-title":"J. Optim. Theory Appl."},{"key":"265230_CR31","volume-title":"Contributions to Nonlinear Functional Analysis","author":"E.H. Zarantonello","year":"1971","unstructured":"E.H. Zarantonello, \u201cProjections on convex sets in Hilbert space and spectral theory,\u201d in Contributions to Nonlinear Functional Analysis, E.H. Zarantonello (ed.), Academic Press: New York, 1971."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008714607737.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008714607737\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008714607737.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:09:37Z","timestamp":1752376177000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008714607737"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["265230"],"URL":"https:\/\/doi.org\/10.1023\/a:1008714607737","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}