{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:22:58Z","timestamp":1777454578506,"version":"3.51.4"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,11,17]],"date-time":"2009-11-17T00:00:00Z","timestamp":1258416000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1007\/s10589-009-9303-0","type":"journal-article","created":{"date-parts":[[2009,11,16]],"date-time":"2009-11-16T16:00:22Z","timestamp":1258387222000},"page":"435-456","source":"Crossref","is-referenced-by-count":9,"title":["An active index algorithm for the nearest point problem in a polyhedral cone"],"prefix":"10.1007","volume":"49","author":[{"given":"Zhe","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yahya","family":"Fathi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,11,17]]},"reference":[{"key":"9303_CR1","volume-title":"Recent Developments in Mathematical Programming","author":"K.S. Al-Sultan","year":"1991","unstructured":"Al-Sultan, K.S., Murty, K.G.: Nearest points in nonsimplicial cones and LCPs with PSD symmetric matrices. In: Recent Developments in Mathematical Programming. Gordon and Breach Science Publishers, Philadelphia (1991). Edited by Santosh Kumar on behalf of the Australian Society for Operations Research"},{"key":"9303_CR2","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF01769704","volume":"10","author":"K.M. Anstreicher","year":"1993","unstructured":"Anstreicher, K.M., Hertog, D.D., Ross, C., Terlaky, T.: A long-step Barrier method for convex quadratic programming. Algorithmica 10, 365\u2013382 (1993)","journal-title":"Algorithmica"},{"key":"9303_CR3","doi-asserted-by":"crossref","first-page":"1225","DOI":"10.1109\/TAC.1980.1102537","volume":"25","author":"S.C. Fang","year":"1980","unstructured":"Fang, S.C.: An iterative method for generalized complementarity problems. IEEE Trans. Automat. Contr. AC 25, 1225\u20131227 (1980)","journal-title":"IEEE Trans. Automat. Contr. AC"},{"key":"9303_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02591962","volume":"27","author":"D. Goldfarb","year":"1983","unstructured":"Goldfarb, D., Idnani, A.: A numerically stable dual method for solving strictly convex quadratic programs. Math. Program. 27, 1\u201333 (1983)","journal-title":"Math. Program."},{"key":"9303_CR5","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF01588795","volume":"49","author":"D. Goldfarb","year":"1990","unstructured":"Goldfarb, D., Liu, S.: An O(n 3 L) primal interior point algorithm for convex quadratic programming. Math. Program. 49, 325\u2013340 (1990)","journal-title":"Math. Program."},{"key":"9303_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01580719","volume":"40","author":"S.P. Han","year":"1988","unstructured":"Han, S.P.: A successive projection method. Math. Program. 40, 1\u201314 (1988)","journal-title":"Math. Program."},{"key":"9303_CR7","unstructured":"Kostina, E., Kostyukova, O.: A primal-dual active-set method for convex quadratic programming. http:\/\/www.iwr.uni-heidelberg.de\/organization\/sfb359\/PP\/Preprint2003-05.pdf"},{"key":"9303_CR8","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1287\/mnsc.11.7.681","volume":"11","author":"C.E. Lemke","year":"1965","unstructured":"Lemke, C.E.: Bimatrix equilibrium points and mathematical programming. Manag. Sci. 11, 681\u2013689 (1965)","journal-title":"Manag. Sci."},{"key":"9303_CR9","unstructured":"Liu, Z.: The nearest point problem in a polyhedral cone and its extensions. Ph.D. Dissertation, North Carolina State University (2009)"},{"key":"9303_CR10","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01587076","volume":"44","author":"R.D.C. Monteiro","year":"1989","unstructured":"Monteiro, R.D.C., Adler, I.: Interior path following primal-dual algorithms, part\u00a0II: convex quadratic programming. Math. Program. 44, 43\u201366 (1989)","journal-title":"Math. Program."},{"key":"9303_CR11","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/BF01583789","volume":"23","author":"K.G. Murty","year":"1982","unstructured":"Murty, K.G., Fathi, Y.: A critical index algorithm for nearest point problems on simplicial cones. Math. Program. 23, 206\u2013215 (1982)","journal-title":"Math. Program."},{"key":"9303_CR12","first-page":"3","volume":"1","author":"K.G. Murty","year":"2006","unstructured":"Murty, K.G.: A new practically efficient interior point method for LP. Algorithmic Oper. Res. 1, 3\u201319 (2006)","journal-title":"Algorithmic Oper. Res."},{"key":"9303_CR13","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1023\/A:1004605612267","volume":"104","author":"V. Ruggiero","year":"2000","unstructured":"Ruggiero, V., Zanni, L.: A modified projection algorithm for large strictly convex quadratic programs. J.\u00a0Optim. Theory Appl. 104, 281\u2013299 (2000)","journal-title":"J.\u00a0Optim. Theory Appl."},{"key":"9303_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-46216-0","volume-title":"Convexity and Optimization in Finite Dimensions","author":"J. Stoer","year":"1970","unstructured":"Stoer, J., Witzgall, C.: Convexity and Optimization in Finite Dimensions. Springer, Berlin (1970)"},{"key":"9303_CR15","first-page":"48","volume":"30","author":"D.R. Wilhelmsen","year":"1976","unstructured":"Wilhelmsen, D.R.: A nearest point algorithm for convex polyhedral cones and applications to positive linear approximation. Math. Comput. 30, 48\u201357 (1976)","journal-title":"Math. Comput."},{"key":"9303_CR16","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/BF01580381","volume":"11","author":"P. Wolfe","year":"1976","unstructured":"Wolfe, P.: Finding the nearest point in a polytope. Math. Program. 11, 128\u2013149 (1976)","journal-title":"Math. Program."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-009-9303-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-009-9303-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-009-9303-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:38Z","timestamp":1559302598000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-009-9303-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,17]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["9303"],"URL":"https:\/\/doi.org\/10.1007\/s10589-009-9303-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11,17]]}}}