iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.crossref.org/works/10.1007/S10898-013-0128-0
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T18:29:49Z","timestamp":1726424989908},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,12,11]],"date-time":"2013-12-11T00:00:00Z","timestamp":1386720000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s10898-013-0128-0","type":"journal-article","created":{"date-parts":[[2013,12,10]],"date-time":"2013-12-10T05:42:43Z","timestamp":1386654163000},"page":"307-315","source":"Crossref","is-referenced-by-count":5,"title":["Optimal rank-sparsity decomposition"],"prefix":"10.1007","volume":"60","author":[{"given":"Jon","family":"Lee","sequence":"first","affiliation":[]},{"given":"Bai","family":"Zou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,12,11]]},"reference":[{"issue":"2","key":"128_CR1","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1137\/090761793","volume":"21","author":"V Chandrasekaran","year":"2011","unstructured":"Chandrasekaran, V., Sanghavi, S., Parrilo, P.A., Willsky, A.S.: Rank-sparsity incoherence for matrix decomposition. SIAM J. Optim. 21(2), 572\u2013596 (2011)","journal-title":"SIAM J. Optim."},{"key":"128_CR2","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/s10107-003-0420-8","volume":"96","author":"J de Farias","year":"2003","unstructured":"de Farias, J., Ismael, R.: A polyhedral study of the cardinality constrained knapsack problem. Math. Program. A 96, 439\u2013467 (2003)","journal-title":"Math. Program. A"},{"key":"128_CR3","unstructured":"Fazel, Maryam.: Matrix rank minimization with applications. Ph.D. thesis, Stanford University, 2002"},{"issue":"3","key":"128_CR4","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht, B., Fazel, M., Parrilo, P.A.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52(3), 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"key":"128_CR5","unstructured":"Lee, J.: Maximum entropy sampling. In: El-Shaarawi, A.H., Piegorsch, W.W. (eds.) Encyclopedia of Environmetrics\u2019. Wiley, 2001. Revised and updated for the Second Edition, 2012"},{"key":"128_CR6","first-page":"3441","volume":"13","author":"K Mohan","year":"2012","unstructured":"Mohan, K., Fazel, M.: Iterative reweighted algorithms for matrix rank minimization. J. Mach. Learn. Res. 13, 3441\u20133473 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"128_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3532-1","volume-title":"Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory Algorithms, Software, and Applications","author":"M Tawarmalani","year":"2002","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory Algorithms, Software, and Applications. Kluwer, Boston (2002)"},{"key":"128_CR8","first-page":"561","volume-title":"50 Years of Integer Programming 1958\u20132008: The Early Years and State-of-the-Art Surveys","author":"H Raymond","year":"2010","unstructured":"Raymond, H., Mathias, K., Jon, L., Robert, W.: Nonlinear integer programming. In: J\u00fcnger, M., Liebling, T., Naddef, D., Nemhauser, G., Pulleyblank, W., Reinelt, G., Rinaldi, G., Wolsey, L. (eds.) 50 Years of Integer Programming 1958\u20132008: The Early Years and State-of-the-Art Surveys, pp. 561\u2013618. Springer, Heidelberg (2010)"},{"key":"128_CR9","volume-title":"Mixed Integer Nonlinear Programming. The IMA Volumes in Mathematics and its Applications Vol. 154.","year":"2012","unstructured":"Lee, J., Leyffer, S. (eds.): Mixed Integer Nonlinear Programming. The IMA Volumes in Mathematics and its Applications Vol. 154., 1st edn. Springer, New York (2012)","edition":"1"},{"issue":"1\u20132","key":"128_CR10","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/s10107-010-0371-9","volume":"124","author":"A Saxena","year":"2010","unstructured":"Saxena, A., Bonami, P., Lee, J.: Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations. Math. Program. B 124(1\u20132), 383\u2013411 (2010)","journal-title":"Math. Program. B"},{"issue":"2","key":"128_CR11","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/s10107-010-0340-3","volume":"130","author":"A Saxena","year":"2011","unstructured":"Saxena, A., Bonami, P., Lee, J.: Convex relaxations of non-convex mixed integer quadratically constrained programs: Projected formulations. Math. Program. A 130(2), 359\u2013413 (2011)","journal-title":"Math. Program. A"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-013-0128-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-013-0128-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-013-0128-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:59:05Z","timestamp":1559264345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-013-0128-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,11]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["128"],"URL":"https:\/\/doi.org\/10.1007\/s10898-013-0128-0","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,11]]}}}