{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:25:00Z","timestamp":1740122700306,"version":"3.37.3"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,2,9]],"date-time":"2019-02-09T00:00:00Z","timestamp":1549670400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11571061","11401075"],"award-info":[{"award-number":["11571061","11401075"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["DUT16LK05"],"award-info":[{"award-number":["DUT16LK05"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s10589-019-00069-x","type":"journal-article","created":{"date-parts":[[2019,2,8]],"date-time":"2019-02-08T22:10:04Z","timestamp":1549663804000},"page":"311-352","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["PAL-Hom method for QP and an application to LP"],"prefix":"10.1007","volume":"73","author":[{"given":"Guoqiang","family":"Wang","sequence":"first","affiliation":[]},{"given":"Bo","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,9]]},"reference":[{"key":"69_CR1","doi-asserted-by":"crossref","unstructured":"Averick, B.M., Carter, R.G., Xue, G.L., Mor\u00e9, J.J.: The minpack-2 test problem collection. Technical Report, Argonne National Lab., IL, USA (1992)","DOI":"10.2172\/79972"},{"key":"69_CR2","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Belmont (1999)"},{"key":"69_CR3","unstructured":"Best, M.J.: An algorithm for the solution of the parametric quadratic programming problem. CORR 82-14, Department of Combinatorics and Optimization, University of Waterloo, Canada (1982)"},{"key":"69_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-99789-1_5","volume-title":"An Algorithm for the Solution of the Parametric Quadratic Programming Problem","author":"MJ Best","year":"1996","unstructured":"Best, M.J.: An Algorithm for the Solution of the Parametric Quadratic Programming Problem. Springer, Berlin (1996)"},{"issue":"1","key":"69_CR5","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1145\/200979.201043","volume":"21","author":"I Bongartz","year":"1995","unstructured":"Bongartz, I., Conn, A.R., Gould, N., Toint, P.L.: Cute: constrained and unconstrained testing environment. ACM Trans. Math. Softw. (TOMS) 21(1), 123\u2013160 (1995)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"69_CR6","volume-title":"Dual Algorithms for Constrained Optimization Problems","author":"JD Buys","year":"1972","unstructured":"Buys, J.D.: Dual Algorithms for Constrained Optimization Problems. Brondder-Offset, Rotterdam (1972)"},{"key":"69_CR7","unstructured":"Chang, C.C., Lin, C.J.: LIBSVM: A library for support vector machines. ACM Trans. Intell. Syst. Technol. 2,( 27): 1\u201327 (2011). \n                    http:\/\/www.csie.ntu.edu.tw\/~cjlin\/libsvm"},{"issue":"2","key":"69_CR8","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/0728030","volume":"28","author":"AR Conn","year":"1991","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds. SIAM J. Numer. Anal. 28(2), 545\u2013572 (1991)","journal-title":"SIAM J. Numer. Anal."},{"key":"69_CR9","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: LANCELOT: A Fortran Package for Large-Scale Nonlinear Optimization (Release A). Springer, Berlin (2013)"},{"key":"69_CR10","doi-asserted-by":"crossref","unstructured":"Cornuejols, G., T\u00fct\u00fcnc\u00fc, R.: Optimization Methods in Finance. Cambridge University Press, Cambridge (2006)","DOI":"10.1017\/CBO9780511753886"},{"issue":"4","key":"69_CR11","doi-asserted-by":"publisher","first-page":"1120","DOI":"10.1137\/S1052623499362573","volume":"13","author":"Z Dost\u00e1l","year":"2003","unstructured":"Dost\u00e1l, Z., Friedlander, A., Santos, S.A.: Augmented Lagrangians with adaptive precision control for quadratic programming with simple bounds and equality constraints. SIAM J. Optim. 13(4), 1120\u20131140 (2003)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"69_CR12","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/S0377-0427(99)00368-4","volume":"126","author":"Z Dost\u00e1l","year":"2000","unstructured":"Dost\u00e1l, Z., Gomes, F.A.M., Santos, S.A.: Duality-based domain decomposition with natural coarse-space for variational inequalities. J. Comput. Appl. Math. 126(1\u20132), 397\u2013415 (2000)","journal-title":"J. Comput. Appl. Math."},{"issue":"13\u201314","key":"69_CR13","doi-asserted-by":"publisher","first-page":"1611","DOI":"10.1016\/S0045-7825(00)00180-8","volume":"190","author":"Z Dost\u00e1l","year":"2000","unstructured":"Dost\u00e1l, Z., Gomes, F.A.M., Santos, S.A.: Solution of contact problems by feti domain decomposition with natural coarse space projections. Comput. Methods Appl. Mech. Eng. 190(13\u201314), 1611\u20131627 (2000)","journal-title":"Comput. Methods Appl. Mech. Eng."},{"issue":"Dec","key":"69_CR14","first-page":"1889","volume":"6","author":"RE Fan","year":"2005","unstructured":"Fan, R.E., Chen, P.H., Lin, C.J.: Working set selection using second order information for training support vector machines. J. Mach. Learn. Res. 6(Dec), 1889\u20131918 (2005)","journal-title":"J. Mach. Learn. Res."},{"key":"69_CR15","unstructured":"Ferreau, H.J.: An Online Active Set Strategy for Fast Solution of Parametric Quadratic Programs with Applications to Predictive Engine Control. University of Heidelberg, Heidelberg (2006)"},{"issue":"8","key":"69_CR16","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1002\/rnc.1251","volume":"18","author":"HJ Ferreau","year":"2008","unstructured":"Ferreau, H.J., Bock, H.G., Diehl, M.: An online active set strategy to overcome the limitations of explicit MPC. Int. J. Robust Nonlinear Control 18(8), 816\u2013830 (2008)","journal-title":"Int. J. Robust Nonlinear Control"},{"issue":"4","key":"69_CR17","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s12532-014-0071-1","volume":"6","author":"HJ Ferreau","year":"2014","unstructured":"Ferreau, H.J., Kirches, C., Potschka, A., Bock, H.G., Diehl, M.: qpOASES: a parametric active-set algorithm for quadratic programming. Math. Progr. Comput. 6(4), 327\u2013363 (2014)","journal-title":"Math. Progr. Comput."},{"issue":"1","key":"69_CR18","first-page":"76","volume":"7","author":"R Fletcher","year":"1971","unstructured":"Fletcher, R.: A general quadratic programming algorithm. IMA J. Numer. Anal. 7(1), 76\u201391 (1971)","journal-title":"IMA J. Numer. Anal."},{"issue":"2","key":"69_CR19","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s101070050113","volume":"87","author":"R Fletcher","year":"2000","unstructured":"Fletcher, R.: Stable reduced hessian updates for indefinite quadratic programming. Math. Progr. 87(2), 251\u2013264 (2000)","journal-title":"Math. Progr."},{"key":"69_CR20","doi-asserted-by":"crossref","unstructured":"Forsgren, A., E, P.G., Wong, E.: Primal and dual active-set methods for convex quadratic programming. Math. Progr. 159(1\u20132), 469\u2013508 (2016)","DOI":"10.1007\/s10107-015-0966-2"},{"key":"69_CR21","first-page":"10","volume":"13","author":"DM Gay","year":"1985","unstructured":"Gay, D.M.: Electronic mail distribution of linear programming test problems. Math. Progr. Soc. COAL Newsl. 13, 10\u201312 (1985)","journal-title":"Math. Progr. Soc. COAL Newsl."},{"key":"69_CR22","unstructured":"Gill, P.E., Murray, W., Saunders, M.A.: User\u2019s Guide for Qpopt 1.0: A Fortran Package for Quadratic Programming, Technical Report SOL 95-4, Systems Optimization Laboratory, Dept. Operations Research, Stanford University (1995)"},{"key":"69_CR23","unstructured":"Gill, P.E., Murray, W., Saunders, M.A.: User\u2019s Guide for Snopt Version 7: Software for Large-scale Linear and Quadratic Programming. Report NA 05-2, Department of Mathematics, University of California, San Diego (2008)"},{"issue":"2","key":"69_CR24","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BF02592025","volume":"36","author":"PE Gill","year":"1986","unstructured":"Gill, P.E., Murray, W., Saunders, M.A., Tomlin, J.A., Wright, M.H.: On projected newton barrier methods for linear programming and an equivalence to Karmarkar\u2019s projective method. Math. Progr. 36(2), 183\u2013209 (1986)","journal-title":"Math. Progr."},{"issue":"1","key":"69_CR25","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s12532-014-0075-x","volume":"7","author":"PE Gill","year":"2015","unstructured":"Gill, P.E., Wong, E.: Methods for convex and general quadratic programming. Math. Progr. Comput. 7(1), 71\u2013112 (2015)","journal-title":"Math. Progr. Comput."},{"issue":"3","key":"69_CR26","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1093\/imanum\/11.3.299","volume":"11","author":"NI Gould","year":"1991","unstructured":"Gould, N.I.: An algorithm for large-scale quadratic programming. IMA J. Numer. Anal. 11(3), 299\u2013324 (1991)","journal-title":"IMA J. Numer. Anal."},{"key":"69_CR27","unstructured":"Hager, W.W., c.\u00a0Zhang, H.: A new active set algorithm for box constrained optimization. SIAM J. Optim. 17(2), 526\u2013557 (2006)"},{"issue":"5","key":"69_CR28","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF00927673","volume":"4","author":"MR Hestenes","year":"1969","unstructured":"Hestenes, M.R.: Multiplier and gradient methods. J. Optim. Theory Appl. 4(5), 303\u2013320 (1969)","journal-title":"J. Optim. Theory Appl."},{"key":"69_CR29","doi-asserted-by":"crossref","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. In: Proceedings of the sixteenth Annual ACM Symposium onTheory of Computing, pp. 302\u2013311. ACM (1984)","DOI":"10.1145\/800057.808695"},{"key":"69_CR30","unstructured":"Lichman, M.: UCI machine learning repository (2013). \n                    http:\/\/archive.ics.uci.edu\/ml"},{"issue":"4","key":"69_CR31","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1137\/S1052623498345075","volume":"9","author":"CJ Lin","year":"1999","unstructured":"Lin, C.J., Mor\u00e9, J.J.: Newton\u2019s method for large bound-constrained optimization problems. SIAM J. Optim. 9(4), 1100\u20131127 (1999)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"69_CR32","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1137\/0718039","volume":"18","author":"OL Mangasarian","year":"1981","unstructured":"Mangasarian, O.L.: Iterative solution of linear programs. SIAM J. Numer. Anal. 18(4), 606\u2013614 (1981)","journal-title":"SIAM J. Numer. Anal."},{"issue":"6","key":"69_CR33","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1137\/0317052","volume":"17","author":"OL Mangasarian","year":"1979","unstructured":"Mangasarian, O.L., Meyer, R.R.: Nonlinear perturbation of linear programs. SIAM J. Control Optim. 17(6), 745\u2013752 (1979)","journal-title":"SIAM J. Control Optim."},{"issue":"4","key":"69_CR34","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S Mehrotra","year":"1992","unstructured":"Mehrotra, S.: On the implementation of a primal-dual interior point method. SIAM J. Optim. 2(4), 575\u2013601 (1992)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"69_CR35","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Progr. 103(1), 127\u2013152 (2005)","journal-title":"Math. Progr."},{"key":"69_CR36","unstructured":"Nesterov, Y., et\u00a0al.: Gradient methods for minimizing composite objective function. In: Technical report, Center for Operations Research and Econometrics (CORE), Catholic University of Louvain (2007)"},{"key":"69_CR37","unstructured":"Osuna, E., Freund, R., Girosi, F.: An improved training algorithm for support vector machines. In: Proceedings of the VII IEEE Workshop Neural Networks for Signal Processing, pp. 276\u2013285. IEEE (1997)"},{"key":"69_CR38","first-page":"283","volume-title":"Optimization","author":"MJD Powell","year":"1969","unstructured":"Powell, M.J.D.: A method for nonlinear constraints in minimization problems. In: Fletcher, R. (ed.) Optimization, pp. 283\u2013298. Academic Press, London (1969)"},{"key":"69_CR39","doi-asserted-by":"crossref","unstructured":"Ritter, K.: On Parametric Linear and Quadratic Programming Problems. Technical Report, DTIC Document (1981)","DOI":"10.21236\/ADA100602"},{"issue":"2","key":"69_CR40","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/nav.3800140203","volume":"14","author":"K Ritter","year":"1967","unstructured":"Ritter, K., Meyer, M.: A method for solving nonlinear maximum-problems depending on parameters. Nav. Res. Logist. (NRL) 14(2), 147\u2013162 (1967)","journal-title":"Nav. Res. Logist. (NRL)"},{"issue":"2","key":"69_CR41","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(2), 97\u2013116 (1976)","journal-title":"Math. Oper. Res."},{"key":"69_CR42","volume-title":"Optimization for Machine Learning","author":"S Sra","year":"2012","unstructured":"Sra, S., Nowozin, S., Wright, S.J.: Optimization for Machine Learning. MIT Press, Cambridge (2012)"},{"issue":"1","key":"69_CR43","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Progr. 106(1), 25\u201357 (2006)","journal-title":"Math. Progr."},{"issue":"3","key":"69_CR44","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/BF00939565","volume":"65","author":"SJ Wright","year":"1990","unstructured":"Wright, S.J.: Implementing proximal point methods for linear programming. J. Optim. Theory Appl. 65(3), 531\u2013554 (1990)","journal-title":"J. Optim. Theory Appl."},{"key":"69_CR45","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-Dual Interior-Point Methods","author":"SJ Wright","year":"1997","unstructured":"Wright, S.J.: Primal-Dual Interior-Point Methods. SIAM, Philadelphia (1997)"},{"issue":"1","key":"69_CR46","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10114-013-2740-9","volume":"30","author":"YX Yuan","year":"2014","unstructured":"Yuan, Y.X.: Analysis on a superlinearly convergent augmented Lagrangian method. Acta Math. Sin. Engl. Ser. 30(1), 1\u201310 (2014)","journal-title":"Acta Math. Sin. Engl. Ser."},{"issue":"1","key":"69_CR47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/10556789808805699","volume":"10","author":"Y Zhang","year":"1998","unstructured":"Zhang, Y.: Solving large-scale linear programs by interior-point methods under the matlab environment. Optim. Methods Softw. 10(1), 1\u201331 (1998)","journal-title":"Optim. Methods Softw."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00069-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00069-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00069-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,8]],"date-time":"2020-02-08T19:12:40Z","timestamp":1581189160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00069-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,9]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["69"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00069-x","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2019,2,9]]},"assertion":[{"value":"14 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}