{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T09:10:37Z","timestamp":1754557837700,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T00:00:00Z","timestamp":1591401600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T00:00:00Z","timestamp":1591401600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No.11571171"],"award-info":[{"award-number":["No.11571171"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s40314-020-01210-x","type":"journal-article","created":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T13:02:37Z","timestamp":1591448557000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A novel projected gradient-like method for optimization problems with simple constraints"],"prefix":"10.1007","volume":"39","author":[{"given":"Wei","family":"Wei","sequence":"first","affiliation":[]},{"given":"Hua","family":"Dai","sequence":"additional","affiliation":[]},{"given":"Weitai","family":"Liang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,6]]},"reference":[{"key":"1210_CR1","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10589-009-9240-y","volume":"45","author":"R Andreani","year":"2010","unstructured":"Andreani R, Birgin EG, Mart\u00ednez JM, Schuverdt ML (2010) Second-order negative-curvature methods for box-constrained and general constrained optimization. Comput Optim Appl 45:209\u2013236","journal-title":"Comput Optim Appl"},{"key":"1210_CR2","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.csda.2006.11.006","volume":"52","author":"MW Berry","year":"2007","unstructured":"Berry MW, Browne M, Langville AN, Pauca VP, Plemmons RJ (2007) Algorithms and applications for approximate nonnegative matrix factorization. Comput Stat Data Anal 52:155\u2013173","journal-title":"Comput Stat Data Anal"},{"key":"1210_CR3","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1109\/TAC.1976.1101194","volume":"21","author":"DP Bertsekas","year":"1976","unstructured":"Bertsekas DP (1976) On the Goldstein\u2013Levitin\u2013Polyak gradient projection method. IEEE Trans Autom Control 21:174\u2013184","journal-title":"IEEE Trans Autom Control"},{"key":"1210_CR4","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/0320018","volume":"20","author":"DP Bertsekas","year":"1982","unstructured":"Bertsekas DP (1982) Projected Newton methods for optimization problems with simple constraints. SIAM J Control Optim 20:221\u2013246","journal-title":"SIAM J Control Optim"},{"key":"1210_CR5","volume-title":"Nonlinear programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas DP (1999) Nonlinear programming. Athena Scientific, Belmont"},{"key":"1210_CR6","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/A:1019928808826","volume":"23","author":"EG Birgin","year":"2002","unstructured":"Birgin EG, Mart\u00ednez JM (2002) Large-scale active-set box-constrained optimization method with spectral projected gradients. Comput Optim Appl 23:101\u2013125","journal-title":"Comput Optim Appl"},{"key":"1210_CR7","doi-asserted-by":"publisher","first-page":"1190","DOI":"10.1137\/0916069","volume":"16","author":"RH Byrd","year":"1995","unstructured":"Byrd RH, Lu P, Nocedal J, Zhu C (1995) A limited memory algorithm for bound constrained optimization. SIAM J Sci Comput 16:1190\u20131208","journal-title":"SIAM J Sci Comput"},{"key":"1210_CR8","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF02592073","volume":"39","author":"PH Calamai","year":"1987","unstructured":"Calamai PH, Mor\u00e9 JJ (1987) Projected gradient methods for linearly constrained problems. Math Program 39:93\u2013116","journal-title":"Math Program"},{"key":"1210_CR9","doi-asserted-by":"publisher","first-page":"1016","DOI":"10.1016\/j.camwa.2014.01.009","volume":"67","author":"W Cheng","year":"2014","unstructured":"Cheng W, Chen Z, Li D (2014) An active set truncated Newton method for large-scale bound constrained optimization. Comput Math Appl 67:1016\u20131023","journal-title":"Comput Math Appl"},{"key":"1210_CR10","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1137\/0806023","volume":"6","author":"TF Coleman","year":"1996","unstructured":"Coleman TF, Li Y (1996) An interior trust region approach for nonlinear minimization subject to bounds. SIAM J Optim 6:418\u2013445","journal-title":"SIAM J Optim"},{"key":"1210_CR11","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1137\/0725029","volume":"25","author":"AR Conn","year":"1988","unstructured":"Conn AR, Gould NIM, Toint PhL (1988) Global convergence of a class of trust-region algorithms for optimization with simple bounds. SIAM J Numer Anal 25:433\u2013460","journal-title":"SIAM J Numer Anal"},{"key":"1210_CR12","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/0728030","volume":"28","author":"AR Conn","year":"1991","unstructured":"Conn AR, Gould NIM, Toint PhL (1991) A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds. SIAM J Numer Anal 28:545\u2013572","journal-title":"SIAM J Numer Anal"},{"key":"1210_CR13","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10957-016-1024-9","volume":"172","author":"A Cristofari","year":"2017","unstructured":"Cristofari A, De Santis M, Lucidi S, Rinaldi F (2017) A two-stage active-set algorithm for bound-constrained optimization. J Optim Theory Appl 172:369\u2013401","journal-title":"J Optim Theory Appl"},{"key":"1210_CR14","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s10589-012-9506-7","volume":"53","author":"M De Santis","year":"2012","unstructured":"De Santis M, Di Pillo G, Lucidi S (2012) An active set feasible method for large-scale optimization problems with bound constraints. Comput Optim Appl 53:395\u2013423","journal-title":"Comput Optim Appl"},{"key":"1210_CR15","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1137\/S1052623493253991","volume":"8","author":"F Facchinei","year":"1998","unstructured":"Facchinei F, J\u00fadice J, Soares J (1998) An active set Newton algorithm for large-scale nonlinear programs with box constraints. SIAM J Optim 8:158\u2013186","journal-title":"SIAM J Optim"},{"key":"1210_CR16","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1137\/S1052623499359890","volume":"12","author":"F Facchinei","year":"2002","unstructured":"Facchinei F, Lucidi S, Palagi L (2002) A truncated Newton algorithm for large scale box constrained optimization. SIAM J Optim 12:1100\u20131125","journal-title":"SIAM J Optim"},{"key":"1210_CR17","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1090\/S0002-9904-1964-11178-2","volume":"70","author":"AA Goldstein","year":"1964","unstructured":"Goldstein AA (1964) Convex programming in Hilbert space. Bull Am Math Soc 70:709\u2013710","journal-title":"Bull Am Math Soc"},{"key":"1210_CR18","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1137\/050635225","volume":"17","author":"WW Hager","year":"2006","unstructured":"Hager WW, Zhang H (2006) A new active set algorithm for box constrained optimization. SIAM J Optim 17:526\u2013557","journal-title":"SIAM J Optim"},{"key":"1210_CR19","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10589-006-6514-5","volume":"35","author":"C Kanzow","year":"2006","unstructured":"Kanzow C, Klug A (2006) On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints. Comput Optim Appl 35:177\u2013197","journal-title":"Comput Optim Appl"},{"key":"1210_CR20","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"DD Lee","year":"1999","unstructured":"Lee DD, Seung HS (1999) Learning the parts of objects by nonnegative matrix factorization. Nature 401:788\u2013791","journal-title":"Nature"},{"key":"1210_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(66)90114-5","volume":"6","author":"ES Levitin","year":"1966","unstructured":"Levitin ES, Polyak BT (1966) Constrained minimization problems. USSR Comput Math Math Phys 6:1\u201350","journal-title":"USSR Comput Math Math Phys"},{"key":"1210_CR22","doi-asserted-by":"publisher","first-page":"2756","DOI":"10.1162\/neco.2007.19.10.2756","volume":"19","author":"C-J Lin","year":"2007","unstructured":"Lin C-J (2007) Projected gradient methods for nonnegative matrix factorization. Neural Comput 19:2756\u20132779","journal-title":"Neural Comput"},{"key":"1210_CR23","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1137\/S1052623498345075","volume":"9","author":"C-J Lin","year":"1999","unstructured":"Lin C-J, More JJ (1999) Newton\u2019s method for large-scalebound constrained problems. SIAM J Optim 9:1100\u20131127","journal-title":"SIAM J Optim"},{"key":"1210_CR24","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1137\/0310009","volume":"10","author":"GP McCormick","year":"1972","unstructured":"McCormick GP, Tapia RA (1972) The gradient projection method under mild differentiability conditions. SlAM J Control 10:93\u201398","journal-title":"SlAM J Control"},{"key":"1210_CR25","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1002\/env.3170050203","volume":"5","author":"P Paatero","year":"1994","unstructured":"Paatero P, Tapper U (1994) Positive matrix factorization: a nonnegative factor model with optimal utilization of error estimates of data values. Environmetrics 5:111\u2013126","journal-title":"Environmetrics"},{"key":"1210_CR26","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.laa.2005.06.025","volume":"416","author":"VP Pauca","year":"2006","unstructured":"Pauca VP, Piper J, Plemmons RJ (2006) Nonnegative matrix factorization for spectral data analysis. Linear Algebra Appl 416:29\u201347","journal-title":"Linear Algebra Appl"},{"key":"1210_CR27","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1137\/S1052623494276518","volume":"8","author":"R Pytlak","year":"1998","unstructured":"Pytlak R (1998) An efficient algorithm for large-scale nonlinear programming problems with simple bounds on the variables. SIAM J Optim 8:532\u2013560","journal-title":"SIAM J Optim"},{"key":"1210_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61582-5","volume-title":"More test examples for nonlinear programming codes","author":"K Schittkowski","year":"1987","unstructured":"Schittkowski K (1987) More test examples for nonlinear programming codes. Springer, Berlin"},{"key":"1210_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1022690711754","volume":"92","author":"A Schwartz","year":"1997","unstructured":"Schwartz A, Polak E (1997) Family of projected descent methods for optimization problems with simple bounds. J Optim Theory Appl 92:1\u201331","journal-title":"J Optim Theory Appl"},{"key":"1210_CR30","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1142\/S0218001405004198","volume":"19","author":"Y Wang","year":"2005","unstructured":"Wang Y, Jia Y, Hu C, Turk M (2005) Non-negative matrix factorization framework for face recongnition. Int J Pattern Recogn Artif Intell 19:495\u2013511","journal-title":"Int J Pattern Recogn Artif Intell"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-020-01210-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-020-01210-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-020-01210-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,5]],"date-time":"2021-06-05T23:54:00Z","timestamp":1622937240000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-020-01210-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,6]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["1210"],"URL":"https:\/\/doi.org\/10.1007\/s40314-020-01210-x","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2020,6,6]]},"assertion":[{"value":"20 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"168"}}