{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:41:26Z","timestamp":1740123686925,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,3,19]],"date-time":"2022-03-19T00:00:00Z","timestamp":1647648000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,19]],"date-time":"2022-03-19T00:00:00Z","timestamp":1647648000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s11075-022-01279-x","type":"journal-article","created":{"date-parts":[[2022,3,19]],"date-time":"2022-03-19T22:02:26Z","timestamp":1647727346000},"page":"711-748","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2943-9389","authenticated-orcid":false,"given":"Yaguang","family":"Yang","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,19]]},"reference":[{"key":"1279_CR1","doi-asserted-by":"crossref","unstructured":"Berkelaar, A. B., Roos, K., Terlaky, T.: The optimal set and optimal partition approach to linear and quadratic programming. In: Recent Advances in Sensitivity Analysis and Parametric Programming. Kluwer Publishers, Berlin (1997)","DOI":"10.1007\/978-1-4615-6103-3_6"},{"key":"1279_CR2","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/0320018","volume":"20","author":"DP Bertsekas","year":"1982","unstructured":"Bertsekas, D.P.: Projected Newton methods for optimization problems with simple constraints. SIAM J. Control Optim. 20, 221\u2013246 (1982)","journal-title":"SIAM J. Control Optim."},{"key":"1279_CR3","doi-asserted-by":"publisher","first-page":"1110","DOI":"10.1016\/j.apnum.2008.05.006","volume":"59","author":"C Cartis","year":"2009","unstructured":"Cartis, C.: Some disadvantages of a Mehrotra-type primal-dual corrector interior-point algorithm for linear programming. Appl. Numer. Math. 59, 1110\u20131119 (2009)","journal-title":"Appl. Numer. Math."},{"key":"1279_CR4","unstructured":"Cartis, C., Gould, N.I.M.: Finding a Point in the Relative Interior of a Polyhedren. Oxford. Technical Report. Computing Laboratory, Oxford University (2007)"},{"key":"1279_CR5","volume-title":"Differential Geometry of Curves and Surfaces","author":"MP do Carmo","year":"1976","unstructured":"do Carmo, M.P.: Differential Geometry of Curves and Surfaces. Prentice-Hall, New Jersey (1976)"},{"key":"1279_CR6","doi-asserted-by":"crossref","unstructured":"Goldman, A.J., Tucker, A.W.: Theory of linear programming. In: Linear Equalities and Related Systems, pp 53\u201397. Princeton University Press, Princeton (1956)","DOI":"10.1515\/9781400881987-005"},{"key":"1279_CR7","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01580610","volume":"60","author":"O Guler","year":"1993","unstructured":"Guler, O., Ye, Y.: Convergence behavior of interior-point algorithms. Math. Program. 60, 215\u2013228 (1993)","journal-title":"Math. Program."},{"key":"1279_CR8","unstructured":"Han, C. G., Pardalos, P., Ye, Y: Computational aspects of an interior point algorithm for quadratic programming problem with box constraints. In: Large-Scale Numerical Optimization, pp 92\u2013112. SIAM Publications, Philadelphia (1990)"},{"key":"1279_CR9","doi-asserted-by":"crossref","unstructured":"Herbison-Evans, D.: Solving quartics and cubics for graphics. Technical Report, Basser Department of Computer Science, University of Sydney. Sydney, Australia (1994)","DOI":"10.1016\/B978-0-12-543457-7.50009-7"},{"issue":"12","key":"1279_CR10","doi-asserted-by":"publisher","first-page":"2271","DOI":"10.1080\/00207160.2017.1283020","volume":"94","author":"B Kheirfam","year":"2017","unstructured":"Kheirfam, B.: An arc-search infeasible interior point algorithm for HLCP in the $N_{\\infty }$-neighborhood of the central path. Int. J. Comput. Math. 94(12), 2271\u20132282 (2017)","journal-title":"Int. J. Comput. Math."},{"issue":"3","key":"1279_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10915-021-01609-6","volume":"88","author":"B Kheirfam","year":"2021","unstructured":"Kheirfam, B.: A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization. J. Sci. Comput. 88(3), 1\u201323 (2021)","journal-title":"J. Sci. Comput."},{"key":"1279_CR12","doi-asserted-by":"publisher","first-page":"261","DOI":"10.3934\/naco.2018015","volume":"2","author":"B Kheirfam","year":"2018","unstructured":"Kheirfam, B., Moslemi, M.: On the extend of an arc-search interior-point algorithm for semidefinite optimization. Numer. Algebra Control Optim. 2, 261\u2013275 (2018)","journal-title":"Numer. Algebra Control Optim."},{"issue":"1","key":"1279_CR13","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s11075-020-01033-1","volume":"88","author":"B Kheirfam","year":"2021","unstructured":"Kheirfam, B., Osmanpour, N., Keyanpour, M.: An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood. Numer. Algor. 88(1), 143\u2013163 (2021)","journal-title":"Numer. Algor."},{"key":"1279_CR14","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0024-3795(91)90275-2","volume":"152","author":"I Lustig","year":"1991","unstructured":"Lustig, I., Marsten, II., Shannon, D.: Computational experience with a primal-dual interior-point method for linear programming. Linear Algebra Applic. 152, 191\u2013222 (1991)","journal-title":"Linear Algebra Applic."},{"key":"1279_CR15","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1137\/0802022","volume":"2","author":"I Lustig","year":"1992","unstructured":"Lustig, I., Marsten, R., Shannon, D.: On implementing Mehrotra\u2019s predictor-corrector interior-point method for linear programming. SIAM J. Optim. 2, 432\u2013449 (1992)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1279_CR16","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10440-018-0164-3","volume":"157","author":"H Mansouri","year":"2018","unstructured":"Mansouri, H., Pirhaji, M., Zangiabadi, M.: An arc search infeasible interior-point algorithm for symmetric optimization using a new wide neighborhood. Acta Applicandae Mathematicae 157(1), 75\u201391 (2018)","journal-title":"Acta Applicandae Mathematicae"},{"key":"1279_CR17","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, 575\u2013601 (1992)","journal-title":"SIAM J. Optim."},{"key":"1279_CR18","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1287\/moor.18.4.964","volume":"18","author":"S Mizuno","year":"1993","unstructured":"Mizuno, S., Todd, M., Ye, Y.: On adaptive step primal-dual interior-point algorithms for linear programming. Math. Oper. Res. 18, 964\u2013981 (1993)","journal-title":"Math. Oper. Res."},{"key":"1279_CR19","first-page":"27","volume":"44","author":"R Monteiro","year":"1989","unstructured":"Monteiro, R., Adler, I.: Interior path following primal-dual algorithms. Part I: Linear Program. Math. Program. 44, 27\u201341 (1989)","journal-title":"Part I: Linear Program. Math. Program."},{"key":"1279_CR20","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1287\/moor.15.2.191","volume":"15","author":"R Monteiro","year":"1990","unstructured":"Monteiro, R., Adler, I, Resende, M.G.C.: A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension. Math. Oper. Res. 15, 191\u2013214 (1990)","journal-title":"Math. Oper. Res."},{"key":"1279_CR21","volume-title":"Handbook of Mathematics for Engineers and Scientists","author":"AD Polyanin","year":"2007","unstructured":"Polyanin, A.D., Manzhirov, A.V.: Handbook of Mathematics for Engineers and Scientists. Boca Raton, Chapman & Hall\/CRC (2007)"},{"key":"1279_CR22","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1080\/02331934.2017.1401071","volume":"67","author":"MS Shahraki","year":"2018","unstructured":"Shahraki, M.S., Mansouri, H., Zangiabadi, M.: A wide neighborhood infeasible-interior-point method with arc-search for-SCLCPs. Optimization 67, 409\u2013425 (2018)","journal-title":"Optimization"},{"key":"1279_CR23","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-Dual Interior-Point Methods","author":"S Wright","year":"1997","unstructured":"Wright, S.: Primal-Dual Interior-Point Methods. SIAM, Philadelphia (1997)"},{"issue":"1","key":"1279_CR24","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s11590-016-0997-5","volume":"11","author":"X Yang","year":"2017","unstructured":"Yang, X., Liu, H., Zhang, Y.: An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path. Optim. Lett. 11(1), 135\u2013152 (2017)","journal-title":"Optim. Lett."},{"issue":"1\u20132","key":"1279_CR25","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s12190-015-0900-z","volume":"51","author":"X Yang","year":"2016","unstructured":"Yang, X., Zhang, Y., Liu, H.: A wide neighborhood infeasible-interior-point method with arc-search for linear programming. J. Appl. Math. Comput. 51(1\u20132), 209\u2013225 (2016)","journal-title":"J. Appl. Math. Comput."},{"key":"1279_CR26","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1007\/s10957-013-0281-0","volume":"158","author":"Y Yang","year":"2013","unstructured":"Yang, Y.: A polynomial arc-search interior-point algorithm for linear programming. J. Optim. Theory Applic. 158, 859\u2013873 (2013)","journal-title":"J. Optim. Theory Applic."},{"key":"1279_CR27","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.ejor.2011.06.020","volume":"215","author":"Y Yang","year":"2011","unstructured":"Yang, Y.: A polynomial arc-search interior-point algorithm for convex quadratic programming. Europ. J. Oper. Res. 215, 25\u201338 (2011)","journal-title":"Europ. J. Oper. Res."},{"issue":"4","key":"1279_CR28","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1007\/s11075-016-0180-1","volume":"74","author":"Y Yang","year":"2017","unstructured":"Yang, Y.: CurveLP-a MATLAB implementation of an infeasible interior-point algorithm for linear programming. Numer. Algor. 74(4), 967\u2013996 (2017)","journal-title":"Numer. Algor."},{"key":"1279_CR29","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1007\/s11075-018-0469-3","volume":"79","author":"Y Yang","year":"2018","unstructured":"Yang, Y.: Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming. Numer. Algor. 79, 957\u2013992 (2018)","journal-title":"Numer. Algor."},{"key":"1279_CR30","volume-title":"Spacecraft Modeling, Attitude Determination, and Control: Quaternion-Based Approach","author":"Y Yang","year":"2020","unstructured":"Yang, Y.: Spacecraft Modeling, Attitude Determination, and Control: Quaternion-Based Approach. CRC Press, Boca Raton (2020)"},{"key":"1279_CR31","doi-asserted-by":"publisher","DOI":"10.1201\/9781003042518","volume-title":"Arc-Search Techniques for Interior-Point Methods","author":"Y Yang","year":"2020","unstructured":"Yang, Y.: Arc-Search Techniques for Interior-Point Methods. CRC Press, Boca Raton (2020)"},{"key":"1279_CR32","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/s11590-017-1142-9","volume":"12","author":"Y Yang","year":"2018","unstructured":"Yang, Y., Yamashita, M.: An arc-search O(nL) infeasible-interior-point algorithm for linear programming. Optim. Lett. 12, 781\u2013798 (2018)","journal-title":"Optim. Lett."},{"key":"1279_CR33","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1007\/s11590-019-01414-z","volume":"13","author":"M Zhang","year":"2019","unstructured":"Zhang, M., Yuan, B., Zhou, Y., Luo, X., Huang, Z.: A primal-dual interior-point algorithm with arc-search for semidefinite programming. Optim. Lett. 13, 1157\u20131175 (2019)","journal-title":"Optim. Lett."},{"key":"1279_CR34","unstructured":"Zhang, Y.: Solving Large-Scale Linear Programs by Interior-Point Methods Under the MATLAB Environment. Baltimore County, Technical Report, Department of Mathematics and Statistics, University of Maryland (1996)"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-022-01279-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-022-01279-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-022-01279-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,9]],"date-time":"2022-09-09T07:37:17Z","timestamp":1662709037000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-022-01279-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,19]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["1279"],"URL":"https:\/\/doi.org\/10.1007\/s11075-022-01279-x","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2022,3,19]]},"assertion":[{"value":"9 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of interest"}}]}}