{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T21:06:21Z","timestamp":1778360781337,"version":"3.51.4"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T00:00:00Z","timestamp":1591401600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T00:00:00Z","timestamp":1591401600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100010665","name":"H2020 Marie Sklodowska-Curie Actions","doi-asserted-by":"publisher","award":["764759"],"award-info":[{"award-number":["764759"]}],"id":[{"id":"10.13039\/100010665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s10107-020-01517-x","type":"journal-article","created":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T10:02:31Z","timestamp":1591437751000},"page":"619-647","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Random projections for quadratic programs"],"prefix":"10.1007","volume":"183","author":[{"given":"Claudia","family":"D\u2019Ambrosio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3139-6821","authenticated-orcid":false,"given":"Leo","family":"Liberti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre-Louis","family":"Poirion","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ky","family":"Vu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,6]]},"reference":[{"key":"1517_CR1","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1016\/S0022-0000(03)00025-4","volume":"66","author":"D Achlioptas","year":"2003","unstructured":"Achlioptas, D.: Database-friendly random projections: Johnson\u2013Lindenstrauss with binary coins. J. Comput. Syst. Sci. 66, 671\u2013687 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"1517_CR2","doi-asserted-by":"crossref","unstructured":"Ailon, N., Chazelle, B.: Approximate nearest neighbors and fast Johnson\u2013Lindenstrauss lemma. In: Proceedings of the Symposium on the Theory Of Computing, Volume \u201906 of STOC. ACM, Seattle (2006)","DOI":"10.1145\/1132516.1132597"},{"key":"1517_CR3","unstructured":"Boutsidis, C., Zouzias, A., Drineas, P.: Random projections for $$k$$-means clustering. In: Advances in Neural Information Processing Systems, NIPS. NIPS Foundation, La Jolla, pp. 298\u2013306 (2010)"},{"key":"1517_CR4","unstructured":"Dasgupta, S.: Experiments with random projection. In: Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence, pp. 143\u2013151. Morgan Kaufman, San Francisco (2000)"},{"issue":"2","key":"1517_CR5","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1090\/qam\/112751","volume":"18","author":"W Dorn","year":"1960","unstructured":"Dorn, W.: Duality in quadratic programming. Q. Appl. Math. 18(2), 155\u2013162 (1960)","journal-title":"Q. Appl. Math."},{"key":"1517_CR6","unstructured":"Gould, N., Toint, P.: A quadratic programming bibliography. In: Technical Report 2000\u20132001. RAL Numerical Analysis Group (2001)"},{"key":"1517_CR7","unstructured":"IBM: ILOG CPLEX 12.8 User\u2019s Manual. IBM (2017)"},{"key":"1517_CR8","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the Symposium on the Theory Of Computing, Volume\u00a030 of STOC, pp. 604\u2013613. ACM, New York (1998)","DOI":"10.1145\/276698.276876"},{"issue":"3","key":"1517_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1273340.1273347","volume":"3","author":"P Indyk","year":"2007","unstructured":"Indyk, P., Naor, A.: Nearest neighbor preserving embeddings. ACM Trans. Algorithms 3(3), 31 (2007)","journal-title":"ACM Trans. Algorithms"},{"key":"1517_CR10","series-title":"Contemporary Mathematics","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1090\/conm\/026\/737400","volume-title":"Conference in Modern Analysis and Probability","author":"W Johnson","year":"1984","unstructured":"Johnson, W., Lindenstrauss, J.: Extensions of Lipschitz mappings into a Hilbert space. In: Hedlund, G. (ed.) Conference in Modern Analysis and Probability. Contemporary Mathematics, vol. 26, pp. 189\u2013206. AMS, Providence, RI (1984)"},{"issue":"1","key":"1517_CR11","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/2559902","volume":"61","author":"D Kane","year":"2014","unstructured":"Kane, D., Nelson, J.: Sparser Johnson\u2013Lindenstrauss transforms. J. ACM 61(1), 4 (2014)","journal-title":"J. ACM"},{"key":"1517_CR12","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1016\/j.orl.2018.06.006","volume":"46","author":"L Liberti","year":"2018","unstructured":"Liberti, L., Vu, K.: Barvinok\u2019s naive algorithm in distance geometry. Oper. Res. Lett. 46, 476\u2013481 (2018)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"1517_CR13","first-page":"77","volume":"7","author":"H Markowitz","year":"1952","unstructured":"Markowitz, H.: Portfolio selection. J. Finance 7(1), 77\u201391 (1952)","journal-title":"J. Finance"},{"key":"1517_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF01585093","volume":"24","author":"J May","year":"1982","unstructured":"May, J., Smith, R.: Random polytopes: their definition, generation and aggregate properties. Math. Program. 24, 39\u201354 (1982)","journal-title":"Math. Program."},{"issue":"4","key":"1517_CR15","doi-asserted-by":"publisher","first-page":"22:1","DOI":"10.1145\/2641760","volume":"8","author":"S Paul","year":"2014","unstructured":"Paul, S., Boutsidis, C., Magdon-Ismail, M., Drineas, P.: Random projections for linear support vector machines. ACM Trans Knowl Discov Data 8(4), 22:1\u201322:25 (2014)","journal-title":"ACM Trans Knowl Discov Data"},{"key":"1517_CR16","doi-asserted-by":"crossref","unstructured":"Pilanci, M., Wainwright, M.: Randomized sketches of convex programs with sharp guarantees. In: International Symposium on Information Theory (ISIT), pp. 921\u2013925. IEEE, Piscataway (2014)","DOI":"10.1109\/ISIT.2014.6874967"},{"issue":"1","key":"1517_CR17","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1137\/15M1021106","volume":"27","author":"M Pilanci","year":"2017","unstructured":"Pilanci, M., Wainwright, M.: Newton sketch: a linear time optimization algorithm with linear-quadratic convergence. SIAM J. Optim. 27(1), 205\u2013245 (2017)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1517_CR18","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1080\/00207728308926445","volume":"14","author":"J Shim","year":"1983","unstructured":"Shim, J.: A survey of quadratic programming applications to business and economics. Int. J. Syst. Sci. 14(1), 105\u2013115 (1983)","journal-title":"Int. J. Syst. Sci."},{"key":"1517_CR19","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0020-0190(90)90100-C","volume":"36","author":"S Vavasis","year":"1990","unstructured":"Vavasis, S.: Quadratic programming is in NP. Inf. Process. Lett. 36, 73\u201377 (1990)","journal-title":"Inf. Process. Lett."},{"key":"1517_CR20","doi-asserted-by":"crossref","unstructured":"Vempala, S.: The random projection method. In: Number 65 in DIMACS Series in Discrete Mathematics and Theoretical Computer Science. AMS, Providence, RI (2004)","DOI":"10.1090\/dimacs\/065"},{"key":"1517_CR21","doi-asserted-by":"crossref","unstructured":"Venkatasubramanian, S., Wang, Q.: The Johnson\u2013Lindenstrauss transform: an empirical study. In: Algorithm Engineering and Experiments, Volume 13 of ALENEX, pp. 164\u2013173. SIAM, Providence, RI (2011)","DOI":"10.1137\/1.9781611972917.16"},{"key":"1517_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/9781108231596","volume-title":"High-dimensional Probability","author":"R Vershynin","year":"2018","unstructured":"Vershynin, R.: High-dimensional Probability. CUP, Cambridge (2018)"},{"key":"1517_CR23","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-030-17953-3_33","volume-title":"Integer Programming and Combinatorial Optimization (IPCO)","author":"K Vu","year":"2019","unstructured":"Vu, K., Poirion, P.-L., D\u2019Ambrosio, C., Liberti, L.: Random projections for quadratic programs over a Euclidean ball. In: Lodi, A., et al. (eds.) Integer Programming and Combinatorial Optimization (IPCO). LNCS, vol. 11480, pp. 442\u2013452. Springer, New York (2019)"},{"issue":"4","key":"1517_CR24","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1287\/moor.2017.0894","volume":"43","author":"K Vu","year":"2018","unstructured":"Vu, K., Poirion, P.-L., Liberti, L.: Random projections for linear programming. Math. Oper. Res. 43(4), 1051\u20131071 (2018)","journal-title":"Math. Oper. Res."},{"key":"1517_CR25","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.dam.2018.08.025","volume":"253","author":"K Vu","year":"2019","unstructured":"Vu, K., Poirion, P.-L., Liberti, L.: Gaussian random projections for Euclidean membership problems. Discrete Appl. Math. 253, 93\u2013102 (2019)","journal-title":"Discrete Appl. Math."},{"issue":"1\u20132","key":"1517_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/0400000060","volume":"10","author":"D Woodruff","year":"2014","unstructured":"Woodruff, D.: Sketching as a tool for linear algebra. Found. Trends Theor. Comput. Sci. 10(1\u20132), 1\u2013157 (2014)","journal-title":"Found. Trends Theor. Comput. Sci."},{"issue":"5","key":"1517_CR27","doi-asserted-by":"publisher","first-page":"S78","DOI":"10.1137\/130919258","volume":"36","author":"J Yang","year":"2014","unstructured":"Yang, J., Meng, X., Mahoney, M.: Quantile regression for large-scale applications. SIAM J. Sci. Comput. 36(5), S78\u2013S110 (2014)","journal-title":"SIAM J. Sci. Comput."},{"key":"1517_CR28","unstructured":"Zhang, L., Mahdavi, M., Jin, R., Yang, T., Zhu, S.: Recovering the optimal solution by dual random projection. In: Shalev-Shwartz S., Steinwart I. (eds) Conference on Learning Theory (COLT), Volume 30 of Proceedings of Machine Learning Research, pp. 135\u2013157. $$\\langle $$jmlr.org$$\\rangle $$ (2013)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01517-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-020-01517-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01517-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,5]],"date-time":"2021-06-05T23:43:43Z","timestamp":1622936623000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-020-01517-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,6]]},"references-count":28,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["1517"],"URL":"https:\/\/doi.org\/10.1007\/s10107-020-01517-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,6]]},"assertion":[{"value":"10 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}