{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T01:07:07Z","timestamp":1648948027810},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T00:00:00Z","timestamp":1574726400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T00:00:00Z","timestamp":1574726400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"liangshan Shao","award":["71771111"],"award-info":[{"award-number":["71771111"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s12190-019-01305-7","type":"journal-article","created":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T12:02:41Z","timestamp":1574769761000},"page":"725-752","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Non-interior-point smoothing Newton method for CP revisited and its application to support vector machines"],"prefix":"10.1007","volume":"62","author":[{"given":"Tie","family":"Ni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,26]]},"reference":[{"key":"1305_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1023\/B:COAP.0000026882.34332.1b","volume":"28","author":"L Bergamaschi","year":"2004","unstructured":"Bergamaschi, L., Gondzio, J., Zilli, G.: Preconditioning indefinite systems in interior point methods for optimization. Comput. Optim. Appl. 28, 149\u2013171 (2004)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"1305_CR2","doi-asserted-by":"publisher","first-page":"1787","DOI":"10.1137\/130947155","volume":"25","author":"S Bellavia","year":"2015","unstructured":"Bellavia, S., De Simone, V., di Serafino, D., Morini, B.: Updating constraint preconditioners for KKT systems in quadratic programming via low-rank corrections. SIAM J. Optim. 25(3), 1787\u20131808 (2015)","journal-title":"SIAM J. Optim."},{"key":"1305_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1080\/10556789208805504","volume":"1","author":"KP Bennett","year":"1992","unstructured":"Bennett, K.P., Mangasarian, O.L.: Robust linear programming discrimination of two linearly inseparable sets. Optim. Methods Softw. 1, 23\u201334 (1992)","journal-title":"Optim. Methods Softw."},{"key":"1305_CR4","unstructured":"Bradley, P.S., Mangasarian, O.L.: Feature selection via concave minimization and support vector machines. In: Shavlik, J. (ed.) Machine Learning Proceedings of the Fifteenth International Conference (ICML98), pp. 82\u201390 (1998). ftp:\/\/ftp.cs.wisc.edu\/math-prog\/tech-reports\/98-03.ps. Accessed Mar 2018"},{"key":"1305_CR5","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1137\/0614081","volume":"14","author":"B Chen","year":"1993","unstructured":"Chen, B., Harker, P.T.: A non-interior-point continuation method for linear complementarity problem. SIAM J. Matrix Anal. Appl. 14, 1168\u20131190 (1993)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1305_CR6","volume-title":"Learning from Data\u2014Concepts, Theory and Methods","author":"V Cherkassky","year":"1998","unstructured":"Cherkassky, V., Mulier, F.: Learning from Data\u2014Concepts, Theory and Methods. Wiley, New York (1998)"},{"key":"1305_CR7","first-page":"273","volume":"20","author":"C Corts","year":"1995","unstructured":"Corts, C., Vapnik, V.N.: Support vector networks. Mach. Learn. 20, 273\u2013297 (1995)","journal-title":"Mach. Learn."},{"key":"1305_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801389","volume-title":"Support Vector Machines and Other Kernel-based Learning Methods","author":"N Cristianini","year":"2000","unstructured":"Cristianini, N., Shawe-Taylor, J.: Support Vector Machines and Other Kernel-based Learning Methods. Cambridge University Press, Cambridge (2000)"},{"issue":"6","key":"1305_CR9","doi-asserted-by":"publisher","first-page":"A2783","DOI":"10.1137\/141002062","volume":"37","author":"I Dassios","year":"2014","unstructured":"Dassios, I., Fountoulakis, K., Gondzio, J.: A preconditioner for a primal-dual Newton conjugate gradients method for compressed sensing problems. SIAM J. Sci. Comput. 37(6), A2783\u2013A2812 (2014)","journal-title":"SIAM J. Sci. Comput."},{"key":"1305_CR10","first-page":"35","volume":"9","author":"V De Simone","year":"2018","unstructured":"De Simone, V., di Serafino, D., Morini, B.: On preconditioner updates for sequences of saddle-point linear systems. Commun. Appl. Ind. Math. 9, 35\u201341 (2018)","journal-title":"Commun. Appl. Ind. Math."},{"key":"1305_CR11","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1002\/nla.308","volume":"10","author":"C Durazzi","year":"2003","unstructured":"Durazzi, C., Ruggiero, V.: Indefinitely preconditioned conjugate gradient method for large sparse equality and inequality constrained quadratic problems. Numer. Linear Algebra Appl. 10, 673\u2013688 (2003)","journal-title":"Numer. Linear Algebra Appl."},{"key":"1305_CR12","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":"1305_CR13","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s12532-012-0035-2","volume":"4","author":"MP Friedlander","year":"2012","unstructured":"Friedlander, M.P., Orban, D.: A primal-dual regularized interior-point method for convex quadratic programs. Math. Program. Comput. 4, 71\u2013107 (2012)","journal-title":"Math. Program. Comput."},{"key":"1305_CR14","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s10589-010-9361-3","volume":"51","author":"J Gondzio","year":"2012","unstructured":"Gondzio, J.: Matrix-free interior point method. Comput. Optim. Appl. 51, 457\u2013480 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"1305_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix Analysis","author":"RA Horn","year":"1985","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (1985)"},{"key":"1305_CR16","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1023\/A:1023648305969","volume":"117","author":"ZH Huang","year":"2003","unstructured":"Huang, Z.H., Han, J., Chen, Z.: A predictor-corrector smoothing Newton algorithm, based on a new smoothing function, for solving the nonlinear complementarity problem with a $$P_0$$ function. J. Optim. Theory Appl. 117, 39\u201368 (2003)","journal-title":"J. Optim. Theory Appl."},{"key":"1305_CR17","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/s10589-008-9180-y","volume":"45","author":"ZH Huang","year":"2010","unstructured":"Huang, Z.H., Ni, T.: Smoothing algorithms for complementarity problems over symmetric cones. Comput. Optim. Appl. 45, 557\u2013579 (2010)","journal-title":"Comput. Optim. Appl."},{"key":"1305_CR18","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/s10589-016-9872-7","volume":"66","author":"ZH Huang","year":"2017","unstructured":"Huang, Z.H., Qi, L.: Formulating an n-person noncooperative game as a tensor complementarity problem. Comput. Optim. Appl. 66, 557\u2013576 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"1305_CR19","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10107-003-0457-8","volume":"99","author":"ZH Huang","year":"2004","unstructured":"Huang, Z.H., Qi, L., Sun, D.: Sub-quadratic convergence of a smoothing Newton algorithm for the $$P_0$$- and monotone LCP. Math. Program. 99, 423\u2013441 (2004)","journal-title":"Math. Program."},{"key":"1305_CR20","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10589-006-6512-7","volume":"35","author":"ZH Huang","year":"2006","unstructured":"Huang, Z.H., Sun, D., Zhao, G.Y.: A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming. Comput. Optim. Appl. 35, 199\u2013237 (2006)","journal-title":"Comput. Optim. Appl."},{"key":"1305_CR21","first-page":"169","volume-title":"Advances in Kernel Methods\u2014Support Vector Learning","author":"T Joachims","year":"1999","unstructured":"Joachims, T.: Making large-scale support vector machine learning practical. In: Scholkopf, B., Burges, C.J.C., Smola, A.J. (eds.) Advances in Kernel Methods\u2014Support Vector Learning, pp. 169\u2013184. MIT Press, Cambridge (1999)"},{"key":"1305_CR22","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1137\/S0895479894273134","volume":"17","author":"C Kanzow","year":"1996","unstructured":"Kanzow, C.: Some noninterior continuation methods for linear complementarity problems. SIAM J. Matrix Anal. Appl. 17, 851\u2013868 (1996)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1305_CR23","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1011215321374","volume":"20","author":"Y-J Lee","year":"2001","unstructured":"Lee, Y.-J., Mangasarian, O.L.: SSVM: a smooth support vector machine for classification. Comput. Optim. Appl. 20, 5\u201322 (2001)","journal-title":"Comput. Optim. Appl."},{"key":"1305_CR24","doi-asserted-by":"publisher","first-page":"1032","DOI":"10.1109\/72.788643","volume":"10","author":"OL Mangasarian","year":"1999","unstructured":"Mangasarian, O.L., Musicant, D.R.: Successive overrelaxation for support vector machines. IEEE Trans. Neural Netw. 10, 1032\u20131037 (1999)","journal-title":"IEEE Trans. Neural Netw."},{"key":"1305_CR25","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1002\/nla.2054","volume":"23","author":"B Morini","year":"2016","unstructured":"Morini, B., Simoncini, V., Tani, M.: Spectral estimates for unreduced symmetric KKT systems arising from Interior Point methods. Numer. Linear. Algebra 23, 776\u2013800 (2016)","journal-title":"Numer. Linear. Algebra"},{"issue":"1","key":"1305_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-017-9907-8","volume":"68","author":"B Morini","year":"2017","unstructured":"Morini, B., Simoncini, V., Tani, M.: A comparison of reduced and unreduced symmetric KKT systems arising from interior point methods. Comput. Optim. Appl. 68(1), 1\u201329 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"1305_CR27","unstructured":"Murphy, P.M., Aha, D.W.: UCI repository of machine learning databases (1992). http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html. Accessed Mar 2018"},{"key":"1305_CR28","first-page":"2207","volume":"216","author":"T Ni","year":"2010","unstructured":"Ni, T., Wang, P.: A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search. Appl. Math. Comput. 216, 2207\u20132214 (2010)","journal-title":"Appl. Math. Comput."},{"key":"1305_CR29","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.ins.2016.04.010","volume":"358\u2013359","author":"T Ni","year":"2016","unstructured":"Ni, T., Zhai, J.: A matrix-free smoothing algorithm for large-scale support vector machines. Inform. Sci. 358\u2013359, 29\u201343 (2016)","journal-title":"Inform. Sci."},{"key":"1305_CR30","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1016\/j.camwa.2017.04.033","volume":"74","author":"M Porcelli","year":"2017","unstructured":"Porcelli, M., Simoncini, V., Stoll, M.: Preconditioning PDE-constrained optimization with $$L^{1}$$-sparsity and control constraints. Comput. Math. Appl. 74, 1059\u20131075 (2017)","journal-title":"Comput. Math. Appl."},{"key":"1305_CR31","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1137\/S1052623497324047","volume":"10","author":"HD Qi","year":"2000","unstructured":"Qi, H.D.: A regularized smoothing Newton method for box constrained variational inequality problems with $$P_0$$-functions. SIAM J. Optim. 10, 315\u2013330 (2000)","journal-title":"SIAM J. Optim."},{"key":"1305_CR32","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1137\/S105262349834895X","volume":"11","author":"L Qi","year":"2000","unstructured":"Qi, L., Zhou, G.: A smoothing Newton method for minimizing a sum of Euclidean norms. SIAM J. Optim. 11, 389\u2013410 (2000)","journal-title":"SIAM J. Optim."},{"key":"1305_CR33","unstructured":"Smale, S.: Algorithms for solving equations. In: Gleason, A.M. (ed.) Proceeding of International Congress of Mathematicians, pp. 172\u2013195. American Mathematics Society, Providence (1987)"},{"key":"1305_CR34","volume-title":"Statistical Learning Theory","author":"VN Vapnik","year":"1998","unstructured":"Vapnik, V.N.: Statistical Learning Theory. Wiley, New York (1998)"},{"key":"1305_CR35","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1137\/S1052623403428208","volume":"14","author":"H-C Zhang","year":"2004","unstructured":"Zhang, H.-C., Hager, W.W.: A nonmonotone line search technique and its application to unconstrained optimization. SIAM. J. Optim. 14, 1043\u20131056 (2004)","journal-title":"SIAM. J. Optim."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-019-01305-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12190-019-01305-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-019-01305-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,25]],"date-time":"2020-11-25T00:47:40Z","timestamp":1606265260000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12190-019-01305-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,26]]},"references-count":35,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["1305"],"URL":"https:\/\/doi.org\/10.1007\/s12190-019-01305-7","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,26]]},"assertion":[{"value":"20 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}