{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T21:27:12Z","timestamp":1768339632096,"version":"3.49.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,7,14]],"date-time":"2006-07-14T00:00:00Z","timestamp":1152835200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[2007,1]]},"DOI":"10.1007\/s10589-006-8717-1","type":"journal-article","created":{"date-parts":[[2006,7,19]],"date-time":"2006-07-19T00:14:07Z","timestamp":1153268047000},"page":"5-41","source":"Crossref","is-referenced-by-count":23,"title":["Newton-KKT interior-point methods for indefinite quadratic programming"],"prefix":"10.1007","volume":"36","author":[{"given":"P.-A.","family":"Absil","sequence":"first","affiliation":[]},{"given":"Andr\u00e9 L.","family":"Tits","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,7,14]]},"reference":[{"issue":"1\u20132","key":"8717_CR1","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/j.cam.2005.10.006","volume":"189","author":"P.-A. Absil","year":"2006","unstructured":"P.-A. Absil, C.G. Baker, and K.A. Gallivan, \u201cA truncated-CG style method for symmetric generalized eigenvalue problems,\u201d J. Comput. Appllied Math., vol. 189, nos. 1\u20132, pp. 274\u2013285, 2006.","journal-title":"J. Comput. Appllied Math."},{"key":"8717_CR2","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1051\/ro\/1995290201951","volume":"29","author":"J.F. Bonnans","year":"1995","unstructured":"J.F. Bonnans and M. Bouhtou, \u201cThe trust region affine interior point algorithm for convex and nonconvex quadratic programming,\u201d RAIRO Rech. Op\u00e9r., vol. 29, pp. 195\u2013217, 1995.","journal-title":"RAIRO Rech. Op\u00e9r."},{"key":"8717_CR3","doi-asserted-by":"crossref","unstructured":"Z. Bai, J. Demmel, J. Dongarra, A. Ruhe, and H. van der Vorst (eds.), \u201cTemplates for the solution of algebraic eigenvalue problems: A practical guide,\u201d Society for Industrial and Applied Mathematics, Philadelphia, 2000.","DOI":"10.1137\/1.9780898719581"},{"key":"8717_CR4","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/PL00011391","volume":"89","author":"R.H. Byrd","year":"2000","unstructured":"R.H. Byrd, J.C. Gilbert, and J. Nocedal, \u201cA trust region method based on interior point techniques for nonlinear programming,\u201d Math. Program., vol. 89, pp. 149\u2013185, 2000.","journal-title":"Math. Program."},{"issue":"3","key":"8717_CR5","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1137\/S1052623493250639","volume":"7","author":"J. F. Bonnans","year":"1997","unstructured":"J. F. Bonnans and C. Pola, \u201cA trust region interior point algorithm for linearly constrained optimization,\u201d SIAM J. Optim., vol. 7, no. 3, pp. 717\u2013731, 1997.","journal-title":"SIAM J. Optim."},{"key":"8717_CR6","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1023\/A:1022944802542","volume":"25","author":"S. Bakhtiari","year":"2003","unstructured":"S. Bakhtiari and A.L. Tits, \u201cA simple primal-dual feasible interior-point method for nonlinear programming with monotone descent,\u201d Comput. Optim. Appl., vol. 25, pp. 17\u201338, 2003.","journal-title":"Comput. Optim. Appl."},{"key":"8717_CR7","unstructured":"A.R. Conn, N.I.M. Gould, and Ph. L. Toint, \u201cTrust-region methods,\u201d MPS\/SIAM Series on Optimization, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, and Math. Program. Soc. (MPS), Philadelphia, PA, 2000."},{"key":"8717_CR8","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s101070050069","volume":"85","author":"T.F. Coleman","year":"1999","unstructured":"T.F. Coleman and J. Liu, \u201cAn interior Newton method for quadratic programming,\u201d Math. Program., vol. 85, pp. 491\u2013523, 1999.","journal-title":"Math. Program."},{"key":"8717_CR9","first-page":"674","volume":"8","author":"I.I. Dikin","year":"1967","unstructured":"I.I. Dikin, \u201cIterative solution of problems of linear and quadratic programming,\u201d Sov. Math. Dokl., vol. 8, pp. 674\u2013675, 1967.","journal-title":"Sov. Math. Dokl."},{"issue":"2","key":"8717_CR10","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1023\/A:1008397325409","volume":"18","author":"C. Dang","year":"2000","unstructured":"C. Dang and L. Xu, \u201cA barrier function method for the nonconvex quadratic programming problem with box constraints,\u201d J. Glob. Optim., vol. 18, no. 2, pp. 165\u2013188, 2000.","journal-title":"J. Glob. Optim."},{"key":"8717_CR11","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/BF02275347","volume":"89","author":"A.S. El-Bakry","year":"1996","unstructured":"A.S. El-Bakry, R.A. Tapia, T. Tsuchiya, and Y. Zhang, \u201cOn the formulation and theory of the Newton interior-point method for nonlinear programming,\u201d J. Opt. Theory Appl., vol. 89, pp. 507\u2013541, 1996.","journal-title":"J. Opt. Theory Appl."},{"issue":"4","key":"8717_CR12","doi-asserted-by":"crossref","first-page":"1132","DOI":"10.1137\/S1052623496305560","volume":"8","author":"A. Forsgren","year":"1998","unstructured":"A. Forsgren and P.E. Gill, \u201cPrimal-dual interior methods for nonconvex nonlinear programming,\u201d SIAM J. Optim., vol. 8, no. 4, pp. 1132\u20131152, 1998.","journal-title":"SIAM J. Optim."},{"issue":"4","key":"8717_CR13","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1137\/S0036144502414942","volume":"44","author":"A. Forsgren","year":"2002","unstructured":"A. Forsgren, P. E. Gill, and M. H. Wright, \u201cInterior methods for nonlinear optimization,\u201d SIAM Rev., vol. 44, no. 4, pp. 525\u2013597, 2002.","journal-title":"SIAM Rev."},{"key":"8717_CR14","volume-title":"Nonlinear Programming: Sequential Unconstrained Minimization Techniques","author":"A.V. Fiacco","year":"1968","unstructured":"A.V. Fiacco and G.P. McCormick, Nonlinear Programming: Sequential Unconstrained Minimization Techniques Wiley, New-York, 1968."},{"key":"8717_CR15","doi-asserted-by":"crossref","unstructured":"D.M. Gay, M.L. Overton, and M. H. Wright, \u201cA primal-dual interior method for nonconvex nonlinear programming,\u201d Advances in Nonlinear Programming, Y. Yuan (ed.). Kluwer Academic Publisher, 1998, pp. 31\u201356.","DOI":"10.1007\/978-1-4613-3335-7_2"},{"issue":"2","key":"8717_CR16","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1080\/02331930412331326310","volume":"54","author":"C. Grossmann","year":"2005","unstructured":"C. Grossmann and M. Zadlo, \u201cA general class of penalty\/barrier path-following Newton methods for nonlinear programming,\u201d Optim., vol. 54, no. 2, pp. 161\u2013190, 2005.","journal-title":"Optim."},{"key":"8717_CR17","unstructured":"J.N. Herskovits, \u201cD\u00e9veloppement d\u2019une m\u00e9thode num\u00e9rique pour l\u2019optimization non-lin\u00e9aire,\u201d Ph.D. thesis, Universit\u00e9 Paris IX - Dauphine, Paris, France, January 1982."},{"issue":"1","key":"8717_CR18","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF02591987","volume":"36","author":"J.N. Herskovits","year":"1986","unstructured":"J.N. Herskovits, \u201cA two-stage feasible directions algorithm for nonlinear constrained optimization,\u201d Math. Program., vol. 36, no. 1, pp. 19\u201338, 1986.","journal-title":"Math. Program."},{"key":"8717_CR19","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01587076","volume":"44","author":"R.D.C. Monteiro","year":"1989","unstructured":"R.D.C. Monteiro and I. Adler, \u201cInterior path following primal-dual algorithms. Part ii: Convex quadratic programming,\u201d Math. Program., vol. 44, pp. 43\u201366, 1989.","journal-title":"Math. Program."},{"issue":"4","key":"8717_CR20","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF01396045","volume":"55","author":"J.J. Mor\u00e9","year":"1989","unstructured":"J.J. Mor\u00e9 and G. Toraldo, \u201cAlgorithms for bound constrained quadratic programming problems,\u201d Numer. Math., vol. 55, no. 4, pp. 377\u2013400, 1989.","journal-title":"Numer. Math."},{"issue":"1","key":"8717_CR21","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1137\/S1052623495283851","volume":"8","author":"R.D.C. Monteiro","year":"1998","unstructured":"R.D.C. Monteiro and T. Tsuchiya, \u201cGlobal convergence of the affine scaling algorithm for convex quadratic programming,\u201d SIAM J. Optim., vol. 8, no. 1, pp. 26\u201358, 1998.","journal-title":"SIAM J. Optim."},{"key":"8717_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/b98874","volume-title":"Numerical optimization","author":"J. Nocedal","year":"1999","unstructured":"J. Nocedal and S. Wright, \u201cNumerical optimization,\u201d Springer Series in Operations Research, Springer-Verlag, New York, 1999."},{"issue":"4","key":"8717_CR23","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1137\/0326046","volume":"26","author":"E.R. Panier","year":"1988","unstructured":"E.R. Panier, A.L. Tits, and J.N. Herskovits, \u201cA QP-free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization,\u201d SIAM J. Control Optim., vol. 26, no. 4, pp. 788\u2013811, 1988.","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"8717_CR24","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1137\/S1052623499353935","volume":"11","author":"H.-D. Qi","year":"2000","unstructured":"H.-D. Qi and L. Qi, \u201cA new QP-free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization,\u201d SIAM J. Optim., vol. 11, no. 1, pp. 113\u2013132, 2000.","journal-title":"SIAM J. Optim."},{"issue":"2","key":"8717_CR25","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s10898-004-8276-x","volume":"30","author":"P. Tseng","year":"2004","unstructured":"P. Tseng, \u201cConvergence properties of Dikin\u2019s affine scaling algorithm for nonconvex quadratic minimization,\u201d J. Glob. Optim., vol. 30, no. 2, pp. 285\u2013300, 2004.","journal-title":"J. Glob. Optim."},{"issue":"1","key":"8717_CR26","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1137\/S1052623401392123","volume":"14","author":"A.L. Tits","year":"2003","unstructured":"A.L. Tits, A. W\u00e4chter, S. Bakhtiari, T.J. Urban, and C.T. Lawrence, \u201cA primal-dual interior-point method for nonlinear programming with strong global and local convergence properties,\u201d SIAM J. Optim., vol. 14, no. 1, pp. 173\u2013199, 2003.","journal-title":"SIAM J. Optim."},{"key":"8717_CR27","doi-asserted-by":"crossref","unstructured":"P. Tseng and Y. Ye, \u201cOn some interior-point algorithms for nonconvex quadratic optimization,\u201d Math. Program., vol. 93, no. 2, Ser. A, pp. 217\u2013225, 2002.","DOI":"10.1007\/s10107-002-0310-5"},{"key":"8717_CR28","doi-asserted-by":"crossref","unstructured":"A.L. Tits and J.L. Zhou, \u201cA simple, quadratically convergent algorithm for linear and convex quadratic programming,\u201d in Large Scale Optimization: State of the Art, W.W. Hager, D.W. Hearn, and P.M. Pardalos (eds.), Kluwer Academic Publishers, pp. 411\u2013427, 1994.","DOI":"10.1007\/978-1-4613-3632-7_20"},{"key":"8717_CR29","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1023\/A:1008677427361","volume":"13","author":"R.J. Vanderbei","year":"1999","unstructured":"R.J. Vanderbei and D.F. Shanno, \u201cAn interior-point algorithm for nonconvex nonlinear programming,\u201d Comp. Optim. Appl., vol. 13, pp. 231\u2013252, 1999.","journal-title":"Comp. Optim. Appl."},{"issue":"1","key":"8717_CR30","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1137\/S1052623497322279","volume":"9","author":"M. H. Wright","year":"1998","unstructured":"M. H. Wright, \u201cIll-conditioning and computational error in interior methods for nonlinear programming,\u201d SIAM J. Optim., vol. 9, no. 1, pp. 84\u2013111, 1998.","journal-title":"SIAM J. Optim."},{"key":"8717_CR31","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1080\/10556789808805723","volume":"10","author":"H. Yamashita","year":"1998","unstructured":"H. Yamashita, \u201cA globally convergent primal-dual interior point method for constrained optimization,\u201d Optim. Meth. Softw., vol. 10, pp. 443\u2013469, 1998.","journal-title":"Optim. Meth. Softw."},{"key":"8717_CR32","unstructured":"Y. Ye, \u201cInterior algorithms for linear, quadratic, and linearly constrained convex programming,\u201d Ph.D. thesis, Stanford University, 1987."},{"key":"8717_CR33","doi-asserted-by":"crossref","unstructured":"Y. Ye, \u201cAn extension of Karmarkar\u2019s algorithm and the trust region method for quadratic programming,\u201d Progress in Mathematical Programming (Pacific Grove, CA, 1987). Springer, New York, 1989, pp. 49\u201363.","DOI":"10.1007\/978-1-4613-9617-8_3"},{"key":"8717_CR34","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF01580903","volume":"56","author":"Y. Ye","year":"1992","unstructured":"Y. Ye, \u201cOn affine scaling algorithms for nonconvex quadratic programming,\u201d Math. Program., vol. 56, pp. 285\u2013300, 1992.","journal-title":"Math. Program."},{"key":"8717_CR35","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF01581726","volume":"80","author":"Y. Ye","year":"1998","unstructured":"Y. Ye, \u201cOn the complexity of approximating a KKT point of quadratic programming,\u201d Math. Program., vol. 80, pp. 195\u2013211, 1998.","journal-title":"Math. Program."},{"issue":"4","key":"8717_CR36","doi-asserted-by":"crossref","first-page":"1222","DOI":"10.1137\/S1052623401383881","volume":"13","author":"Y.-F. Yang","year":"2003","unstructured":"Y.-F. Yang, D.-H. Li, and L. Qi, \u201cA feasible sequential linear equation method for inequality constrained optimization,\u201d SIAM J. Optim., vol. 13, no. 4, pp. 1222\u20131244, 2003.","journal-title":"SIAM J. Optim."},{"key":"8717_CR37","doi-asserted-by":"crossref","unstructured":"Y. Ye and E. Tse, \u201cAn extension of Karmarkar\u2019s projective algorithm for convex quadratic programming,\u201d Math. Program., vol. 44, no. 2 (Ser. A), pp. 157\u2013179, 1989.","DOI":"10.1007\/BF01587086"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-006-8717-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-006-8717-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-006-8717-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:30Z","timestamp":1559302590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-006-8717-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,14]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,1]]}},"alternative-id":["8717"],"URL":"https:\/\/doi.org\/10.1007\/s10589-006-8717-1","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,7,14]]}}}