{"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":1777454578495,"version":"3.51.4"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,11,16]],"date-time":"2011-11-16T00:00:00Z","timestamp":1321401600000},"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":[[2012,9]]},"DOI":"10.1007\/s10589-011-9448-5","type":"journal-article","created":{"date-parts":[[2011,11,16]],"date-time":"2011-11-16T09:15:21Z","timestamp":1321434921000},"page":"115-130","source":"Crossref","is-referenced-by-count":4,"title":["The nearest point problem in a polyhedral set and its extensions"],"prefix":"10.1007","volume":"53","author":[{"given":"Zhe","family":"Liu","sequence":"first","affiliation":[]},{"given":"Yahya","family":"Fathi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,11,16]]},"reference":[{"key":"9448_CR1","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"},{"issue":"5","key":"9448_CR2","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1080\/10556780500247790","volume":"21","author":"I. Das","year":"2006","unstructured":"Das, I.: An active set quadratic programming algorithm for real-time model predictive control. Optim. Methods Softw. 21(5), 833\u2013849 (2006)","journal-title":"Optim. Methods Softw."},{"key":"9448_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. Autom. Control 25, 1225\u20131227 (1980)","journal-title":"IEEE Trans. Autom. Control"},{"key":"9448_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":"9448_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":"9448_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":"9448_CR7","unstructured":"ILOG CPLEX 11.0, User\u2019s Manual. ILOG S.A. and ILOG Inc. (2007)"},{"key":"9448_CR8","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":"9448_CR9","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":"9448_CR10","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1145\/356068.356075","volume":"10","author":"M.L. Lenard","year":"1984","unstructured":"Lenard, M.L., Minkoff, M.: Randomly generated test problems for positive definite quadratic programming. ACM Trans. Math. Softw. 10, 86\u201396 (1984)","journal-title":"ACM Trans. Math. Softw."},{"key":"9448_CR11","unstructured":"Lindo API 6.0 User Manual. Lindo Systems, Inc. (2010)"},{"key":"9448_CR12","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 II: convex quadratic programming. Math. Program. 44, 43\u201366 (1989)","journal-title":"Math. Program."},{"key":"9448_CR13","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":"9448_CR14","volume-title":"Linear Complementarity, Linear and Nonlinear Programming","author":"K.G. Murty","year":"1988","unstructured":"Murty, K.G.: Linear Complementarity, Linear and Nonlinear Programming. Helderman, Berlin (1988). http:\/\/www-personal.engin.umich.edu\/~murty\/"},{"key":"9448_CR15","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":"9448_CR16","first-page":"3324","volume-title":"Proceedings of International Conference on Robotics and Automation","author":"S. Quinlan","year":"1994","unstructured":"Quinlan, S.: Efficient distance computation between non-convex objects. In: Proceedings of International Conference on Robotics and Automation, pp.\u00a03324\u20133329 (1994)"},{"key":"9448_CR17","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. Optim. Theory Appl. 104, 281\u2013299 (2000)","journal-title":"J. Optim. Theory Appl."},{"key":"9448_CR18","first-page":"48","volume":"30","author":"D.R. Wilhelmsen","year":"1976","unstructured":"Wilhelmsen, D.R.: A nearest point problem for convex polyhedral cones and applications to positive linear approximation. Math. Comput. 30, 48\u201357 (1976)","journal-title":"Math. Comput."},{"key":"9448_CR19","doi-asserted-by":"crossref","first-page":"382","DOI":"10.2307\/1909468","volume":"27","author":"P. Wolfe","year":"1959","unstructured":"Wolfe, P.: The simplex method for quadratic programming. Econometrica 27, 382\u2013398 (1959)","journal-title":"Econometrica"},{"key":"9448_CR20","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."},{"key":"9448_CR21","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/s10589-009-9303-0","volume":"49","author":"Z. Liu","year":"2011","unstructured":"Liu, Z., Fathi, Y.: An active index algorithm for the nearest point problem in a polyhedral cone. Comput. Optim. Appl. 49, 435\u2013456 (2011)","journal-title":"Comput. Optim. Appl."},{"key":"9448_CR22","unstructured":"Liu, Z.: The nearest point problem in a polyhedra cone and its extensions. Ph.D. Dissertation, North Carolina State University, Raleigh, NC (2009)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-011-9448-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-011-9448-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-011-9448-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:36:41Z","timestamp":1559288201000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-011-9448-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,16]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["9448"],"URL":"https:\/\/doi.org\/10.1007\/s10589-011-9448-5","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,16]]}}}