{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T09:44:10Z","timestamp":1780393450696,"version":"3.54.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2012,3,9]],"date-time":"2012-03-09T00:00:00Z","timestamp":1331251200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s10107-012-0519-x","type":"journal-article","created":{"date-parts":[[2012,3,7]],"date-time":"2012-03-07T22:28:13Z","timestamp":1331159293000},"page":"273-293","source":"Crossref","is-referenced-by-count":22,"title":["Sparse solutions to random standard quadratic optimization problems"],"prefix":"10.1007","volume":"141","author":[{"given":"Xin","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiming","family":"Peng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuzhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,3,9]]},"reference":[{"issue":"4","key":"519_CR1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1002\/rsa.20199","volume":"31","author":"I. Barany","year":"2007","unstructured":"Barany I., Vempala S., Vetta A.: Nash equilibria in random games. Random Struct. Algorithms 31(4), 391\u2013405 (2007)","journal-title":"Random Struct. Algorithms"},{"key":"519_CR2","doi-asserted-by":"crossref","unstructured":"Beier, R., V\u00f6cking, B.: Random knapsack in expected polynomial time. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, pp. 232\u2013241 (2003)","DOI":"10.1145\/780575.780578"},{"key":"519_CR3","doi-asserted-by":"crossref","unstructured":"Berman, A., Plemmons, R.J.: Nonnegative Matrices in the Mathematical Sciences. SIAM Classics in Applied Mathematics, Philadelphia (1994)","DOI":"10.1137\/1.9781611971262"},{"key":"519_CR4","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1023\/A:1008369322970","volume":"13","author":"I.M. Bomze","year":"1998","unstructured":"Bomze I.M.: On standard quadratic optimization problems. J. Global Optim. 13, 369\u2013387 (1998)","journal-title":"J. Global Optim."},{"key":"519_CR5","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1023\/A:1026583532263","volume":"18","author":"I.M. Bomze","year":"2000","unstructured":"Bomze I.M., D M., de Klerk E., Roos C., Quist A.J., Terlaky T.: On copositive programming and standard quadratic optimization problems. J. Global Optim. 18, 301\u2013320 (2000)","journal-title":"J. Global Optim."},{"key":"519_CR6","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1023\/A:1020209017701","volume":"24","author":"I.M. Bomze","year":"2002","unstructured":"Bomze I.M., de Klerk E.: Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. J. Global Optim. 24, 163\u2013185 (2002)","journal-title":"J. Global Optim."},{"key":"519_CR7","doi-asserted-by":"crossref","unstructured":"Bomze, I.M., Locatelli, M.: Separable standard quadratic optimization problems. Optim. Lett. (2011). doi: 10.1007\/s11590-011-0309-z","DOI":"10.1007\/s11590-011-0309-z"},{"issue":"1","key":"519_CR8","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s10107-007-0138-0","volume":"115","author":"I.M. Bomze","year":"2008","unstructured":"Bomze I.M., Locatelli M., Tardella F.: New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability. Math. Program. 115(1), 31\u201364 (2008)","journal-title":"Math. Program."},{"key":"519_CR9","doi-asserted-by":"crossref","unstructured":"Bruckstein, A.M., Elad, M., Zibulevsky, M.: A non-negative and sparse enough solution of an underdetermined linear system of equations is unique. In: IEEE Xplore, 3rd International Symposium on Communications, Control and Signal Processing, ISCCSP, pp. 762\u2013767 (2008)","DOI":"10.1109\/ISCCSP.2008.4537325"},{"key":"519_CR10","doi-asserted-by":"crossref","first-page":"1539","DOI":"10.1016\/j.laa.2009.05.021","volume":"431","author":"S. Burer","year":"2009","unstructured":"Burer S., Anstreicher K.M., Duer M.: The difference between 5 \u00d7\u00a05 doubly nonnegative and completely positive matrices. Linear Algebra Appl. 431, 1539\u20131552 (2009)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"519_CR11","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/MSP.2007.914731","volume":"25","author":"E. Cand\u00e9s","year":"2008","unstructured":"Cand\u00e9s E., Wakin M.: An introduction to compressive sampling. IEEE Signal Process. Mag. 25(2), 21\u201330 (2008)","journal-title":"IEEE Signal Process. Mag."},{"issue":"2","key":"519_CR12","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"E. Cand\u00e9s","year":"2006","unstructured":"Cand\u00e9s E., Romberg J., Tao T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52(2), 489\u2013509 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"519_CR13","doi-asserted-by":"crossref","DOI":"10.1002\/0471722162","volume-title":"Order Statistics","author":"H.A. David","year":"2003","unstructured":"David H.A., Nagaraja H.N.: Order Statistics. Wiley, NJ (2003)"},{"key":"519_CR14","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1137\/S1052623401383248","volume":"12","author":"E. Klerk de","year":"2002","unstructured":"de Klerk E., Pasechnik D.V.: Approximation of the stability number of a graph via copositive programming. SIAM J. Optim. 12, 875\u2013892 (2002)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"519_CR15","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"D. Donoho","year":"2006","unstructured":"Donoho D.: Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"519_CR16","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1287\/moor.22.3.754","volume":"22","author":"L.E. Gibbons","year":"1997","unstructured":"Gibbons L.E., Hearn D.W., Pardalos P., Ramana M.V.: Continuous characterizations of the maximal clique problem. Math. Oper. Res. 22, 754\u2013768 (1997)","journal-title":"Math. Oper. Res."},{"key":"519_CR17","doi-asserted-by":"crossref","unstructured":"Goldberg, A.V., Marchetti-Spaccamela, A.: On finding the exact solution of a zero-one knapsack problem. In: Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, pp. 359\u2013368 (1984)","DOI":"10.1145\/800057.808701"},{"key":"519_CR18","unstructured":"Grant, M., Boyd, S., Ye, Y.: CVX Users\u2019 Guide (2007). http:\/\/www.stanford.edu\/~boyd\/cvx\/cvx_usrguide.pdf ."},{"key":"519_CR19","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/BF00940067","volume":"68","author":"W.W. Hager","year":"1991","unstructured":"Hager W.W., Pardalos P.M., Roussos I.M., Sahinoglou H.D.: Active constraints, indefinite quadratic test problems, and complexity. J. Opt. Theor. Appl. 68, 499\u2013511 (1991)","journal-title":"J. Opt. Theor. Appl."},{"key":"519_CR20","doi-asserted-by":"crossref","unstructured":"Hu, J., Mitchell, J.E., Pang, J.S.: An LPCC approach to nonconvex quadratic programs. Math. Program. Ser. A. doi: 10.1007\/s10107-010-0426-y","DOI":"10.1007\/s10107-010-0426-y"},{"key":"519_CR21","volume-title":"Resource Allocation Problems: Algorithmic Approaches","author":"T. Irabaki","year":"1988","unstructured":"Irabaki T., Katoh N.: Resource Allocation Problems: Algorithmic Approaches. MIT Press, Cambridge (1988)"},{"key":"519_CR22","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0024-3795(00)00138-5","volume":"313","author":"W. Kaplan","year":"2000","unstructured":"Kaplan W.: A test for copositive matrices. Linear Algebra Appl. 313, 203\u2013206 (2000)","journal-title":"Linear Algebra Appl."},{"key":"519_CR23","first-page":"77","volume":"7","author":"H.M. Markowitz","year":"1952","unstructured":"Markowitz H.M.: Portfolio selection. J. Finance 7, 77\u201391 (1952)","journal-title":"J. Finance"},{"key":"519_CR24","doi-asserted-by":"crossref","unstructured":"Mukherjee, L., Singh, V., Peng, J., Hinrichs, C.: Learning Kernels for variants of normalized cuts: convex relaxations and applications. In: Proceedings of Conference on Computer Vision and Pattern Recognition (CVPR). San Francisco (2010)","DOI":"10.1109\/CVPR.2010.5540076"},{"key":"519_CR25","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02592948","volume":"39","author":"K.G. Murty","year":"1987","unstructured":"Murty K.G., Kabadi S.N.: Some NP-complete problems in quadratic and nonlinear programming. Math. Program. 39, 117\u2013129 (1987)","journal-title":"Math. Program."},{"key":"519_CR26","doi-asserted-by":"crossref","first-page":"2439","DOI":"10.1016\/j.dam.2007.09.020","volume":"156","author":"A. Scozzari","year":"2008","unstructured":"Scozzari A., Tardella F.: A clique algorithm for standard quadratic programming. Discrete Appl. Math. 156, 2439\u20132448 (2008)","journal-title":"Discrete Appl. Math."},{"key":"519_CR27","unstructured":"Toh, K.C., T\u00fct\u00fcnc\u00fc, R.H., Todd, M.: On the implementation and usage of SDPT3 (2006). http:\/\/www.math.nus.edu.sg\/~mattohkc\/guide4-0-draft.pdf"},{"key":"519_CR28","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0024-3795(89)90076-1","volume":"119","author":"H. V\u00e4liaho","year":"1989","unstructured":"V\u00e4liaho H.: Quadratic programming criteria for copositive matrices. Linear Algebra Appl. 119, 163\u2013182 (1989)","journal-title":"Linear Algebra Appl."},{"key":"519_CR29","doi-asserted-by":"crossref","first-page":"325","DOI":"10.2307\/1970008","volume":"67","author":"E.P. Wigner","year":"1958","unstructured":"Wigner E.P.: On the distribution of the roots of certain symmetric matrices. Ann. Math. 67, 325\u2013327 (1958)","journal-title":"Ann. Math."},{"key":"519_CR30","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1016\/j.laa.2008.07.028","volume":"430","author":"S. Yang","year":"2009","unstructured":"Yang S., Li X.: Algorithms for determining the copositivity of a given matrix. Linear Algebra Appl. 430, 609\u2013618 (2009)","journal-title":"Linear Algebra Appl."},{"key":"519_CR31","unstructured":"Zhu, Z., Dang, C., Ye, Y.: A FPTAS for Computing a Symmetric Leontief Competitive Economy Equilibrium. Math. Program. (to appear)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0519-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-012-0519-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0519-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,24]],"date-time":"2019-06-24T22:11:50Z","timestamp":1561414310000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-012-0519-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,9]]},"references-count":31,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["519"],"URL":"https:\/\/doi.org\/10.1007\/s10107-012-0519-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,9]]}}}