{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:34:22Z","timestamp":1757313262527,"version":"3.37.3"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,6,10]],"date-time":"2021-06-10T00:00:00Z","timestamp":1623283200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,10]],"date-time":"2021-06-10T00:00:00Z","timestamp":1623283200000},"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":["11871153"],"award-info":[{"award-number":["11871153"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"publisher","award":["2019J01644"],"award-info":[{"award-number":["2019J01644"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s10915-021-01541-9","type":"journal-article","created":{"date-parts":[[2021,6,10]],"date-time":"2021-06-10T20:02:42Z","timestamp":1623355362000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["An Efficient Hessian Based Algorithm for Singly Linearly and Box Constrained Least Squares Regression"],"prefix":"10.1007","volume":"88","author":[{"given":"Lanyu","family":"Lin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6586-2862","authenticated-orcid":false,"given":"Yong-Jin","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,10]]},"reference":[{"key":"1541_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2, 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"issue":"4","key":"1541_CR2","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF01403888","volume":"5","author":"\u00c5 Bj\u00f6rck","year":"1988","unstructured":"Bj\u00f6rck, \u00c5.: A direct method for sparse least squares problems with lower and upper bounds. Numer. Math. 5(4), 19\u201332 (1988)","journal-title":"Numer. Math."},{"key":"1541_CR3","doi-asserted-by":"publisher","first-page":"132","DOI":"10.4208\/eajam.080310.200910a","volume":"1","author":"X Chen","year":"2011","unstructured":"Chen, X., Ching, W.-K., Chen, X.S., Cong, Y., Tsing, N.-K.: Construction of probabilistic Boolean networks from a prescribed transition probability matrix: a maximum entropy rate approach. East Asian J. Appl. Math. 1, 132\u2013154 (2011)","journal-title":"East Asian J. Appl. Math."},{"key":"1541_CR4","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1049\/iet-syb.2008.0173","volume":"3","author":"W-K Ching","year":"2009","unstructured":"Ching, W.-K., Chen, X., Tsing, N.-K.: Generating probabilistic Boolean networks from a prescribed transition probability matrix. IET Syst. Biol. 3, 453\u2013464 (2009)","journal-title":"IET Syst. Biol."},{"key":"1541_CR5","volume-title":"Optimization and Nonsmooth Analysis","author":"FH Clarke","year":"1983","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley, New York (1983)"},{"key":"1541_CR6","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s12532-014-0066-y","volume":"6","author":"R Cominetti","year":"2014","unstructured":"Cominetti, R., Mascarenhas, W.F., Silva, P.J.S.: A Newton\u2019s method for the continuous quadratic knapsack problem. Math. Program. Comput. 6, 151\u2013169 (2014)","journal-title":"Math. Program. Comput."},{"issue":"9","key":"1541_CR7","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1023\/A:1022365107361","volume":"3","author":"AJ Cox","year":"1999","unstructured":"Cox, A.J., Higham, N.J.: Accuracy and stability of the null space method for solving the equality constrained least squares problem. BIT 3(9), 34\u201350 (1999)","journal-title":"BIT"},{"key":"1541_CR8","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10107-005-0595-2","volume":"106","author":"Y-H Dai","year":"2006","unstructured":"Dai, Y.-H., Fletcher, R.: New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds. Math. Program. 106, 403\u2013421 (2006)","journal-title":"Math. Program."},{"issue":"7","key":"1541_CR9","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0167-6377(94)00059-F","volume":"1","author":"F Facchinei","year":"1995","unstructured":"Facchinei, F.: Minimization of $${\\rm SC}^{1}$$ functions and the Maratos effect. Oper. Res. Lett. 1(7), 131\u2013137 (1995)","journal-title":"Oper. Res. Lett."},{"key":"1541_CR10","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"F Facchinei","year":"2003","unstructured":"Facchinei, F., Pang, J.-S.: Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer, New York (2003)"},{"key":"1541_CR11","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D Gabay","year":"1976","unstructured":"Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite element approximation. Comput. Math. Appl. 2, 17\u201340 (1976)","journal-title":"Comput. Math. Appl."},{"key":"1541_CR12","first-page":"41","volume":"9","author":"R Glowinski","year":"1975","unstructured":"Glowinski, R., Marroco, A.: Sur l\u2019approximation, par \u00e9l\u00e9ments finis d\u2019ordre un, et la r\u00e9solution, par p\u00e9nalisation-dualit\u00e9 d\u2019une classe de probl\u00e8mes de Dirichlet non lin\u00e9aires. ESAIM Math. Model. Numer. Anal. 9, 41\u201376 (1975)","journal-title":"ESAIM Math. Model. Numer. Anal."},{"key":"1541_CR13","volume-title":"Matrix Computations","author":"GH Golub","year":"1996","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations. Johns Hopkins University Press, Baltimore (1996)"},{"key":"1541_CR14","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1137\/1002004","volume":"2","author":"TNE Greville","year":"1960","unstructured":"Greville, T.N.E.: Some applications of the pseudoinverse of a matrix. SIAM Rev. 2, 15\u201322 (1960)","journal-title":"SIAM Rev."},{"issue":"4","key":"1541_CR15","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1023\/A:1022653001160","volume":"9","author":"JY Han","year":"1997","unstructured":"Han, J.Y., Sun, D.F.: Newton and quasi-Newton methods for normal maps with polyhedral sets. J. Optim. Theory Appl. 9(4), 659\u2013676 (1997)","journal-title":"J. Optim. Theory Appl."},{"issue":"8","key":"1541_CR16","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/BF01588328","volume":"1","author":"R Helgason","year":"1980","unstructured":"Helgason, R., Kennington, J., Lall, H.: A polynomially bounded algorithm for a singly constrained quadratic program. Math. Program. 1(8), 338\u2013343 (1980)","journal-title":"Math. Program."},{"key":"1541_CR17","unstructured":"Huang, L., Jia, J.Z., Yu, B., Chun, B.-G., Maniatis, P., Naik, M.: Predicting execution time of computer programs using sparse polynomial regression. In: Proceedings of the 23rd Conference on Neural Information Processing Systems, vol. 1, pp. 883\u2013891 (2010)"},{"key":"1541_CR18","unstructured":"Klopfenstein, Q., Vaiter, S.: Linear support vector regression with linear constraints. To appear in Mach. Learn. 39 pages (2019)"},{"issue":"5","key":"1541_CR19","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1515\/9783112479926-011","volume":"4","author":"B Kummer","year":"1988","unstructured":"Kummer, B.: Newton\u2019s method for non-differentiable functions. Adv. Math. Optim. 4(5), 114\u2013125 (1988)","journal-title":"Adv. Math. Optim."},{"key":"1541_CR20","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1137\/S1052623494267127","volume":"7","author":"C Lemarchal","year":"1997","unstructured":"Lemarchal, C., Sagastizbal, C.: Practical aspects of the Moreau-Yosida regularization: theoretical preliminaries. SIAM J. Optim. 7, 367\u2013385 (1997)","journal-title":"SIAM J. Optim."},{"issue":"8","key":"1541_CR21","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1137\/16M1097572","volume":"2","author":"XD Li","year":"2018","unstructured":"Li, X.D., Sun, D.F., Toh, K.-C.: A highly efficient semismooth Newton augmented Lagrangian method for solving Lasso problems. SIAM J. Optim. 2(8), 433\u2013458 (2018)","journal-title":"SIAM J. Optim."},{"issue":"8","key":"1541_CR22","doi-asserted-by":"publisher","first-page":"1842","DOI":"10.1137\/17M1136390","volume":"2","author":"XD Li","year":"2018","unstructured":"Li, X.D., Sun, D.F., Toh, K.-C.: On efficiently solving the subproblems of a level-set method for fused Lasso problems. SIAM J. Optim. 2(8), 1842\u20131866 (2018)","journal-title":"SIAM J. Optim."},{"key":"1541_CR23","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/s10107-018-1342-9","volume":"179","author":"XD Li","year":"2020","unstructured":"Li, X.D., Sun, D.F., Toh, K.-C.: On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope. Math. Program. 179, 419\u2013446 (2020)","journal-title":"Math. Program."},{"issue":"9","key":"1541_CR24","doi-asserted-by":"publisher","first-page":"2026","DOI":"10.1137\/18M1207752","volume":"2","author":"MX Lin","year":"2019","unstructured":"Lin, M.X., Liu, Y.-J., Sun, D.F., Toh, K.-C.: Efficient sparse semismooth Newton methods for the clustered Lasso problem. SIAM J. Optim. 2(9), 2026\u20132052 (2019)","journal-title":"SIAM J. Optim."},{"key":"1541_CR25","doi-asserted-by":"crossref","unstructured":"Liu, J., Yuan, L., Ye, J.P.: An efficient algorithm for a class of fused Lasso problems. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, vol. 2010, pp. 323\u2013332. (2010)","DOI":"10.1145\/1835804.1835847"},{"key":"1541_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.24014\/juring.v2i1.7467","volume":"2","author":"ZY Luo","year":"2019","unstructured":"Luo, Z.Y., Sun, D.F., Toh, K.-C., Xiu, N.H.: Solving the OSCAR and SLOPE models using a semismooth Newton-based augmented Lagrangian method. J. Mach. Learn. Res. 2, 1\u201325 (2019)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"1541_CR27","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0322019","volume":"2","author":"FJ Luque","year":"1984","unstructured":"Luque, F.J.: Asymptotic convergence analysis of the proximal point algorithm. SIAM J. Control. Optim. 2(2), 277\u2013293 (1984)","journal-title":"SIAM J. Control. Optim."},{"issue":"5","key":"1541_CR28","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1137\/0315061","volume":"1","author":"R Mifflin","year":"1977","unstructured":"Mifflin, R.: Semismooth and semiconvex functions in constrained optimization. SIAM J. Control Optim. 1(5), 959\u2013972 (1977)","journal-title":"SIAM J. Control Optim."},{"issue":"3","key":"1541_CR29","doi-asserted-by":"publisher","first-page":"273","DOI":"10.24033\/bsmf.1625","volume":"9","author":"J-J Moreau","year":"1965","unstructured":"Moreau, J.-J.: Proximit\u00e9 et dualit\u00e9 dans un espace hilbertien. Bull. Soc. Math. France 9(3), 273\u2013299 (1965)","journal-title":"Bull. Soc. Math. France"},{"key":"1541_CR30","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1016\/j.cam.2005.06.053","volume":"198","author":"S Morigi","year":"2007","unstructured":"Morigi, S., Reichel, L., Sgallari, F., Zama, F.: An iterative method for linear discrete ill-posed problems with box constraints. J. Comput. Appl. Math. 198, 505\u2013520 (2007)","journal-title":"J. Comput. Appl. Math."},{"issue":"4","key":"1541_CR31","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/BFb0120929","volume":"1","author":"SM Robinson","year":"1981","unstructured":"Robinson, S.M.: Some continuity properties of polyhedral multifunctions. Math. Program. Stud. 1(4), 206\u2013214 (1981)","journal-title":"Math. Program. Stud."},{"key":"1541_CR32","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"1541_CR33","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1287\/moor.1.2.97","volume":"1","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Math. Oper. Res. 1, 97\u2013116 (1976)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"1541_CR34","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"1","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 1(4), 877\u2013898 (1976)","journal-title":"SIAM J. Control Optim."},{"key":"1541_CR35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, Berlin (1998)"},{"issue":"3","key":"1541_CR36","doi-asserted-by":"publisher","first-page":"1443","DOI":"10.1162\/089976601750264965","volume":"1","author":"B Sch\u00f6lkopf","year":"2001","unstructured":"Sch\u00f6lkopf, B., Platt, J.C., Shawe-Taylor, J., Smola, A.J., Williamson, R.C.: Estimating the support of a high-dimensional distribution. Neural Comput. 1(3), 1443\u20131471 (2001)","journal-title":"Neural Comput."},{"issue":"7","key":"1541_CR37","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1007\/BF02510363","volume":"3","author":"GW Stewart","year":"1997","unstructured":"Stewart, G.W.: On the weighting method for least squares problems with linear equality constraints. BIT 3(7), 961\u2013967 (1997)","journal-title":"BIT"},{"key":"1541_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2016\/3934872","volume":"6","author":"YY Teng","year":"2016","unstructured":"Teng, Y.Y., Qi, S.L., Xiao, D.Y., Xu, L.S., Kang, Y.: A general solution to least squares problems with box constraints and its applications. Math. Probl. Eng. 6, 1\u201311 (2016)","journal-title":"Math. Probl. Eng."},{"issue":"2","key":"1541_CR39","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1002\/nla.2001","volume":"2","author":"YW Wen","year":"2015","unstructured":"Wen, Y.W., Wang, M., Cao, Z.Y., Cheng, X.Q., Ching, W.-K., Vassiliadis, V.S.: Sparse solution of nonnegative least squares problems with applications in the construction of probabilistic Boolean networks. Numer. Linear Algebra Appl. 2(2), 883\u2013899 (2015)","journal-title":"Numer. Linear Algebra Appl."},{"issue":"9","key":"1541_CR40","first-page":"51","volume":"4","author":"S Zeb","year":"2017","unstructured":"Zeb, S., Yousaf, M.: Repeated QR updating algorithm for solution of equality constrained linear least squares problems. J. Math. 4(9), 51\u201361 (2017)","journal-title":"J. Math."},{"key":"1541_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.22152\/programming-journal.org\/2019\/3\/1","volume":"3","author":"YJ Zhang","year":"2018","unstructured":"Zhang, Y.J., Zhang, N., Sun, D.F., Toh, K.-C.: An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems. Math. Program. 3, 1\u201341 (2018)","journal-title":"Math. Program."},{"key":"1541_CR42","doi-asserted-by":"publisher","first-page":"1737","DOI":"10.1137\/080718206","volume":"2","author":"X-Y Zhao","year":"2010","unstructured":"Zhao, X.-Y., Sun, D.F., Toh, K.-C.: A Newton-CG augmented Lagrangian method for semidefinite programming. SIAM J. Optim. 2, 1737\u20131765 (2010)","journal-title":"SIAM J. Optim."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-021-01541-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-021-01541-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-021-01541-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T17:11:25Z","timestamp":1672420285000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-021-01541-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,10]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["1541"],"URL":"https:\/\/doi.org\/10.1007\/s10915-021-01541-9","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"type":"print","value":"0885-7474"},{"type":"electronic","value":"1573-7691"}],"subject":[],"published":{"date-parts":[[2021,6,10]]},"assertion":[{"value":"25 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 April 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 June 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"26"}}