{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T17:26:35Z","timestamp":1778693195485,"version":"3.51.4"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030179526","type":"print"},{"value":"9783030179533","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17953-3_33","type":"book-chapter","created":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:25:20Z","timestamp":1556753120000},"page":"442-452","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Random Projections for Quadratic Programs over a Euclidean Ball"],"prefix":"10.1007","author":[{"given":"Ky","family":"Vu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre-Louis","family":"Poirion","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudia","family":"D\u2019Ambrosio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leo","family":"Liberti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,13]]},"reference":[{"key":"33_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-Lindenstrauss with binary coins. J. Comput. Syst. Sci. 66, 671\u2013687 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"33_CR2","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. American Mathematical Society, Providence (1984)"},{"issue":"1","key":"33_CR3","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-Lindenstrauss transforms. J. ACM 61(1), 4 (2014)","journal-title":"J. ACM"},{"key":"33_CR4","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":"2","key":"33_CR5","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1287\/ijoc.2014.0623","volume":"27","author":"M Lubin","year":"2015","unstructured":"Lubin, M., Dunning, I.: Computing in operations research using Julia. INFORMS J. Comput. 27(2), 238\u2013248 (2015). https:\/\/doi.org\/10.1287\/ijoc.2014.0623","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"33_CR6","first-page":"77","volume":"7","author":"H Markowitz","year":"1952","unstructured":"Markowitz, H.: Portfolio selection. J. Financ. 7(1), 77\u201391 (1952)","journal-title":"J. Financ."},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1111\/itor.12541","volume":"26","author":"L Mencarelli","year":"2019","unstructured":"Mencarelli, L., D\u2019Ambrosio, C.: Complex portfolio selection via convex mixed-integer quadratic programming: a survey. Int. Trans. Oper. Res. 26, 389\u2013414 (2019)","journal-title":"Int. Trans. Oper. Res."},{"key":"33_CR8","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"},{"key":"33_CR9","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":"33_CR10","unstructured":"Vavasis, S., Zippel, R.: Proving polynomial-time for sphere-constrained quadratic programming. Technical report 90\u20131182, Department of Computer Science, Cornell University (1990)"},{"key":"33_CR11","volume-title":"Nonlinear Optimization: Complexity Issues","author":"S Vavasis","year":"1991","unstructured":"Vavasis, S.: Nonlinear Optimization: Complexity Issues. Oxford University Press, Oxford (1991)"},{"key":"33_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.08.025","author":"K Vu","year":"2018","unstructured":"Vu, K., Poirion, P.L., Liberti, L.: Gaussian random projections for Euclidean membership problems. Discrete Appl. Math. (2018). https:\/\/doi.org\/10.1016\/j.dam.2018.08.025","journal-title":"Discrete Appl. Math."},{"key":"33_CR13","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, 1051\u20131404 (2018). https:\/\/doi.org\/10.1287\/moor.2017.0894","journal-title":"Math. Oper. Res."},{"issue":"1","key":"33_CR14","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"33_CR15","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 Theoret. Comput. Sci. 10(1\u20132), 1\u2013157 (2014)","journal-title":"Found. Trends Theoret. Comput. Sci."},{"key":"33_CR16","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), Proceedings of Machine Learning Research, vol. 30, pp. 135\u2013157 (2013). http:\/\/www.jmlr.org"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17953-3_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:44:16Z","timestamp":1709815456000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17953-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030179526","9783030179533"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17953-3_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ann Arbor, MI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/umich.edu\/~ipco2019conf\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"113","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}