{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:51:09Z","timestamp":1761598269566,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"23","license":[{"start":{"date-parts":[[2020,10,31]],"date-time":"2020-10-31T00:00:00Z","timestamp":1604102400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,31]],"date-time":"2020-10-31T00:00:00Z","timestamp":1604102400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s00500-020-05304-w","type":"journal-article","created":{"date-parts":[[2020,10,31]],"date-time":"2020-10-31T09:08:41Z","timestamp":1604135321000},"page":"17761-17770","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9130-8163","authenticated-orcid":false,"given":"Serena","family":"Crisci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakub","family":"Kru\u017e\u00edk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Pecha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Hor\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,31]]},"reference":[{"key":"5304_CR1","doi-asserted-by":"crossref","unstructured":"Averick BM, Carter RG, Mor\u00e9 JJ (1991) The MINPACK-2 test problem collection","DOI":"10.2172\/79972"},{"key":"5304_CR2","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai J, Borwein JM (1988) Two point step size gradient methods. IMA J Numer Anal 8:141\u2013148. https:\/\/doi.org\/10.1093\/imanum\/8.1.141","journal-title":"IMA J Numer Anal"},{"key":"5304_CR3","volume-title":"Nonlinear programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas DP (1999) Nonlinear programming. Athena Scientific, Belmont"},{"key":"5304_CR4","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1137\/S1052623497330963","volume":"10","author":"EG Birgin","year":"2000","unstructured":"Birgin EG, Mart\u00ednez JM, Raydan M (2000) Nonmonotone spectral projected gradient methods on convex sets. SIAM J Optim 10:1196\u20131211","journal-title":"SIAM J Optim"},{"issue":"3","key":"5304_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v060.i03","volume":"60","author":"EG Birgin","year":"2014","unstructured":"Birgin EG, Mart\u00ednez JM, Raydan M (2014) Spectral projected gradient methods: review and perspectives. J Stat Softw 60(3):1\u201321","journal-title":"J Stat Softw"},{"issue":"1","key":"5304_CR6","doi-asserted-by":"publisher","first-page":"015002","DOI":"10.1088\/0266-5611\/25\/1\/015002","volume":"25","author":"S Bonettini","year":"2009","unstructured":"Bonettini S, Zanella R, Zanni L (2009) A scaled gradient projection method for constrained image deblurring. Inverse Probl 25(1):015002","journal-title":"Inverse Probl"},{"issue":"9","key":"5304_CR7","doi-asserted-by":"publisher","first-page":"095008","DOI":"10.1088\/0266-5611\/31\/9\/095008","volume":"31","author":"S Bonettini","year":"2015","unstructured":"Bonettini S, Prato M (2015) New convergence results for the scaled gradient projection method. Inverse Prob 31(9):095008","journal-title":"Inverse Prob"},{"issue":"2","key":"5304_CR8","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1023\/A:1009715923555","volume":"2","author":"CJC Burges","year":"1998","unstructured":"Burges CJC (1998) A tutorial on support vector machines for pattern recognition. Data Min Knowl Discov 2(2):121\u2013167","journal-title":"Data Min Knowl Discov"},{"issue":"3","key":"5304_CR9","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1023\/A:1022627411411","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes C, Vapnik V (1995) Support-vector networks. Mach Learn 20(3):273\u2013297. https:\/\/doi.org\/10.1023\/A:1022627411411","journal-title":"Mach Learn"},{"key":"5304_CR10","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/j.amc.2019.03.039","volume":"356","author":"S Crisci","year":"2019","unstructured":"Crisci S, Ruggiero V, Zanni L (2019) Steplength selection in gradient projection methods for box-constrained quadratic programs. Appl Math Comput 356:312\u2013327","journal-title":"Appl Math Comput"},{"issue":"2","key":"5304_CR11","doi-asserted-by":"publisher","first-page":"1300","DOI":"10.1137\/19M1268641","volume":"30","author":"S Crisci","year":"2020","unstructured":"Crisci S, Porta F, Ruggiero V, Zanni L (2020) Spectral properties of Barzilai-Borwein rules in solving singly linearly constrained optimization problems subject to lower and upper bounds. STAM J Optim 30(2):1300\u20131326","journal-title":"STAM J Optim"},{"key":"5304_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s00211-004-0569-y","volume":"100","author":"YH Dai","year":"2005","unstructured":"Dai YH, Fletcher R (2005) Projected Barzilai\u2013Borwein methods for large-scale box-constrained quadratic programming. Numer Math 100:21\u201347","journal-title":"Numer Math"},{"key":"5304_CR13","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10107-005-0595-2","volume":"106","author":"YH Dai","year":"2006","unstructured":"Dai YH, Fletcher R (2006) New algorithms for singly linearly constrained quadratic programming problems subject to lower and upper bounds. Math Prog 106:403\u2013421","journal-title":"Math Prog"},{"key":"5304_CR14","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.cam.2016.01.007","volume":"302","author":"R De Asmundis","year":"2016","unstructured":"De Asmundis R, di Serafino D, Landi G (2016) On the regularizing behavior of the SDA and SDC gradient methods in the solution of linear ill-posed problems. J Comput Appl Math 302:81\u201393","journal-title":"J Comput Appl Math"},{"key":"5304_CR15","doi-asserted-by":"crossref","unstructured":"di Serafino D, Toraldo G, Viola M (2020) Using gradient directions to get global convergence of newton-type methods. Appl Math Comput, p 125612","DOI":"10.1016\/j.amc.2020.125612"},{"issue":"4","key":"5304_CR16","doi-asserted-by":"publisher","first-page":"2809","DOI":"10.1137\/17M1128538","volume":"28","author":"D di Serafino","year":"2018","unstructured":"di Serafino D, Toraldo G, Viola M, Barlow JL (2018) A two-phase gradient method for quadratic programming problems with a single linear constraint and bounds on the variables. SIAM J Optim 28(4):2809\u20132838","journal-title":"SIAM J Optim"},{"key":"5304_CR17","doi-asserted-by":"crossref","unstructured":"Dolan ED, Mor\u00e9 JJ (2001) Benchmarking optimization software with COPS","DOI":"10.2172\/775270"},{"issue":"2","key":"5304_CR18","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan ED, Mor\u00e9 JJ (2002) Benchmarking optimization software with performance profiles. Math Program 91(2):201\u2013213","journal-title":"Math Program"},{"key":"5304_CR19","volume-title":"Optimal Quadratic Programming Algorithms, with Applications to Variational Inequalities","author":"Z Dost\u00e1l","year":"2009","unstructured":"Dost\u00e1l Z (2009) Optimal Quadratic Programming Algorithms, with Applications to Variational Inequalities, vol 23. SOIA, Springer, New York, US"},{"key":"5304_CR20","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-319-97136-0_4","volume-title":"High performance computing in science and engineering","author":"Z Dostal","year":"2018","unstructured":"Dostal Z, Toraldo G, Viola M, Vlach O (2018) Proportionality based gradient methods with applications in contact mechanics. In: Kozubek T, Cermak M, Tichy P, Blaheta R, Sistek J, Lukas D, Jaros J (eds) High performance computing in science and engineering. Springer International Publishing, Cham, pp 47\u201358"},{"issue":"2","key":"5304_CR21","doi-asserted-by":"crossref","first-page":"299","DOI":"10.3934\/jimo.2008.4.299","volume":"4","author":"G Frassoldati","year":"2008","unstructured":"Frassoldati G, Zanni L, Zanghirati G (2008) New adaptive stepsize selections in gradient methods. J Ind Manag Optim 4(2):299\u2013312","journal-title":"J Ind Manag Optim"},{"key":"5304_CR22","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"L Grippo","year":"1986","unstructured":"Grippo L, Lampariello F, Lucidi S (1986) A nonmonotone line search technique for Newton\u2019s method. SIAM J Numer Anal 23:707\u2013716","journal-title":"SIAM J Numer Anal"},{"key":"5304_CR23","unstructured":"Hapla V et al PERMON (Parallel, Efficient, Robust, Modular, Object-oriented, Numerical). http:\/\/permon.vsb.cz"},{"key":"5304_CR24","doi-asserted-by":"publisher","unstructured":"Kru\u017e\u00edk J, Hor\u00e1k D, \u010cerm\u00e1k M, Posp\u00ed\u0161il L, Pecha M (2020) Active set expansion strategies in MPRGP algorithm. Adv Eng Softw. https:\/\/doi.org\/10.1016\/j.advengsoft.2020.102895","DOI":"10.1016\/j.advengsoft.2020.102895"},{"key":"5304_CR25","doi-asserted-by":"publisher","unstructured":"Kru\u017e\u00edk J, Pecha M, Hapla V, Hor\u00e1k D, \u010cerm\u00e1k M (2018) Investigating convergence of linear SVM implemented in PermonSVM employing MPRGP algorithm. Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) vol 11087, pp 115\u2013129. LNCS, New York. https:\/\/doi.org\/10.1007\/978-3-319-97136-0_9","DOI":"10.1007\/978-3-319-97136-0_9"},{"key":"5304_CR26","unstructured":"Libsvm data: Classification (binary class). https:\/\/www.csie.ntu.edu.tw\/~cjlin\/libsvmtools\/datasets\/binary.html"},{"issue":"4","key":"5304_CR27","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/BF01396045","volume":"55","author":"JJ Mor\u00e8","year":"1989","unstructured":"Mor\u00e8 JJ, Toraldo G (1989) Algorithms for bound constrained quadratic programming problems. Numer Math 55(4):377\u2013400","journal-title":"Numer Math"},{"key":"5304_CR28","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1137\/0801008","volume":"1","author":"JJ Mor\u00e9","year":"1991","unstructured":"Mor\u00e9 JJ, Toraldo G (1991) On the solution of large quadratic programming problems with bound constraints. SIAM J Optim 1:93\u2013113","journal-title":"SIAM J Optim"},{"key":"5304_CR29","doi-asserted-by":"publisher","unstructured":"Pecha M, Hor\u00e1k D (2019) Analyzing l1-loss and l2-loss support vector machines implemented in PERMON toolbox. Springer International Publishing, pp 13\u201323. https:\/\/doi.org\/10.1007\/978-3-030-14907-9_2","DOI":"10.1007\/978-3-030-14907-9_2"},{"key":"5304_CR30","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1007\/s10915-015-9991-9","volume":"65","author":"F Porta","year":"2015","unstructured":"Porta F, Prato M, Zanni L (2015) A new steplength selection for scaled gradient methods with application to image deblurring. J Sci Comput 65:895\u2013919","journal-title":"J Sci Comput"},{"issue":"2\u20133","key":"5304_CR31","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1080\/10556780512331318182","volume":"20","author":"T Serafini","year":"2005","unstructured":"Serafini T, Zanghirati G, Zanni L (2005) Gradient projection methods for quadratic programs and applications in training support vector machines. Optim Methods Softw 20(2\u20133):353\u2013378. https:\/\/doi.org\/10.1080\/10556780512331318182","journal-title":"Optim Methods Softw"},{"issue":"4","key":"5304_CR32","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1137\/S1052623403428208","volume":"14","author":"H Zhang","year":"2004","unstructured":"Zhang H, Hager W (2004) A nonmonotone line search technique and its application to unconstrained optimization. SIAM J Optim 14(4):1045\u20131056","journal-title":"SIAM J Optim"},{"issue":"1","key":"5304_CR33","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10589-006-6446-0","volume":"35","author":"B Zhou","year":"2006","unstructured":"Zhou B, Gao L, Dai YH (2006) Gradient methods with adaptive step-sizes. Comput Optim Appl 35(1):69\u201386","journal-title":"Comput Optim Appl"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-05304-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-020-05304-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-05304-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T08:24:45Z","timestamp":1698308685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-020-05304-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,31]]},"references-count":33,"journal-issue":{"issue":"23","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["5304"],"URL":"https:\/\/doi.org\/10.1007\/s00500-020-05304-w","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2020,10,31]]},"assertion":[{"value":"31 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}