{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:57:21Z","timestamp":1743094641752,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540891963"},{"type":"electronic","value":"9783540891970"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89197-0_13","type":"book-chapter","created":{"date-parts":[[2008,12,3]],"date-time":"2008-12-03T12:23:50Z","timestamp":1228307030000},"page":"103-114","source":"Crossref","is-referenced-by-count":2,"title":["Non-negative Sparse Principal Component Analysis for Multidimensional Constrained Optimization"],"prefix":"10.1007","author":[{"given":"Thanh D. X.","family":"Duong","sequence":"first","affiliation":[]},{"given":"Vu N.","family":"Duong","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"F. Alizadeh","year":"1995","unstructured":"Alizadeh, F.: Interior point methods in semi-definite programming with applications to combinatorial optimization. SIAM J. Optim.\u00a05, 13\u201351 (1995)","journal-title":"SIAM J. Optim."},{"key":"13_CR2","unstructured":"Badea, L., Tilivea, D.: Sparse factorizations of gene expression guided by binding data. In: Pacific Symposium on Biocomputing (2005)"},{"key":"13_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S. Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex optimization. Cambridge University Press, Cambridge (2004)"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1080\/757584614","volume":"22","author":"J. Cadima","year":"1995","unstructured":"Cadima, J., Jolliffe, I.T.: Loadings and correlations in the interpretation of principal components. J. Appl. Statist.\u00a022, 203\u2013214 (1995)","journal-title":"J. Appl. Statist."},{"key":"13_CR5","unstructured":"Candes, E.J., Wakin, M.B., Boyd, S.: Enhancing sparsity by re-weighted l 1 minimization (preprint)"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1137\/050645506","volume":"49","author":"A. D\u2019Aspremont","year":"2007","unstructured":"D\u2019Aspremont, A., El Ghaoui, L., Jordan, M.I., Lanckriet, G.R.G.: A direct formulation for sparse PCA using semi-definite programming. SIAM Rev.\u00a049, 434\u2013448 (2007)","journal-title":"SIAM Rev."},{"key":"13_CR7","volume-title":"Dynamic models for airborne air traffic management capability: State-of-the-art analysis. (Internal report)","author":"V. Duong","year":"1996","unstructured":"Duong, V.: Dynamic models for airborne air traffic management capability: State-of-the-art analysis (Internal report). Eurocontrol Experimental Centre, Bretigny (1996)"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Fazel, M., Hindi, H., Boyd, S.: A rank minimization heuristic with application to minimum order system approximation. In: Proceedings of the American Control Conference, Arlington, VA., vol.\u00a06, pp. 4734\u20134739 (2001)","DOI":"10.1109\/ACC.2001.945730"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1037\/h0071325","volume":"24","author":"H. Hotelling","year":"1933","unstructured":"Hotelling, H.: Analysis of a complex of statistical variables into principal components. J. Educ. Psychol.\u00a024, 417\u2013441 (1933)","journal-title":"J. Educ. Psychol."},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"1651","DOI":"10.1111\/1540-6261.00580","volume":"58","author":"R. Jagannathan","year":"2003","unstructured":"Jagannathan, R., Ma, T.: Risk reduction in large portfolios: Why imposing the wrong constraints helps. Journal of Finance\u00a058, 1651\u20131684 (2003)","journal-title":"Journal of Finance"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"225","DOI":"10.2307\/2985919","volume":"16","author":"J. Jeffers","year":"1967","unstructured":"Jeffers, J.: Two case studies in the application of principal components. Appl. Statist.\u00a016, 225\u2013236 (1967)","journal-title":"Appl. Statist."},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1080\/757584395","volume":"22","author":"I.T. Jolliffe","year":"1995","unstructured":"Jolliffe, I.T.: Rotation of principal components: Choice of normalization constraints. J. Appl. Statist.\u00a022, 29\u201335 (1995)","journal-title":"J. Appl. Statist."},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1198\/1061860032148","volume":"12","author":"I.T. Jolliffe","year":"2003","unstructured":"Jolliffe, I.T., Trendafilov, N.T., Uddin, M.: A modified principal component technique based on the LASSO. J.Comput. Graphical Statist.\u00a012, 531\u2013547 (2003)","journal-title":"J.Comput. Graphical Statist."},{"key":"13_CR14","volume-title":"Principal component analysis","author":"I.T. Jolliffe","year":"2002","unstructured":"Jolliffe, I.T.: Principal component analysis. Springer, New York (2002)"},{"key":"13_CR15","unstructured":"Lemarechal, C., Oustry, F.: Semi-definite relaxations and lagrangian duality with application to combinatorial optimization. Rapport de recherche 3710, INRIA, France (1999)"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L. Lovasz","year":"1991","unstructured":"Lovasz, L., Schrijver, A.: Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim.\u00a01, 166\u2013190 (1991)","journal-title":"SIAM J. Optim."},{"key":"13_CR17","first-page":"915","volume-title":"Advances in Neural Information Processing Systems","author":"B. Moghaddam","year":"2006","unstructured":"Moghaddam, B., Weiss, Y., Avidan, S.: Spectral Bounds for Sparse PCA: Exact & Greedy Algorithms. In: Advances in Neural Information Processing Systems, vol.\u00a018, pp. 915\u2013922. MIT Press, Cambridge (2006)"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10107-006-0001-8","volume":"110","author":"Y. Nesterov","year":"2007","unstructured":"Nesterov, Y.: Smoothing technique and its application in semi-definite optimization. Math. Program.\u00a0110, 245\u2013259 (2007)","journal-title":"Math. Program."},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1080\/14786440109462720","volume":"2","author":"K. Pearson","year":"1901","unstructured":"Pearson, K.: On lines and planes of closest fit to systems of points in space. Phil. Mag.\u00a02, 559\u2013572 (1901)","journal-title":"Phil. Mag."},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"J. Sturm","year":"1999","unstructured":"Sturm, J.: Using SEDUMI 1.0x, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw.\u00a011, 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"K.C. Toh","year":"1999","unstructured":"Toh, K.C., Todd, M.J., Tutuncu, R.H.: SDPT3 - a MA TLAB software package for semi-definite programming. Optim. Methods Softw.\u00a011, 545\u2013581 (1999)","journal-title":"Optim. Methods Softw."},{"key":"13_CR22","first-page":"441","volume":"49","author":"S. Vines","year":"2000","unstructured":"Vines, S.: Simple principal components. Appl. Statist.\u00a049, 441\u2013451 (2000)","journal-title":"Appl. Statist."},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Zass, R., Shashua, A.: Non-negative Sparse PCA. In: Advances In Neural Information Processing Systems, vol.\u00a019, pp. 1561\u20131568 (2007)","DOI":"10.7551\/mitpress\/7503.003.0200"},{"key":"13_CR24","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1137\/S0895479899359631","volume":"23","author":"Z. Zhang","year":"2002","unstructured":"Zhang, Z., Zha, H., Simon, H.: Low-rank approximations with sparse factors I: Basic algorithms and error analysis. SIAM J. Matrix Anal. Appl.\u00a023, 706\u2013727 (2002)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"13_CR25","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1137\/S0895479801394477","volume":"25","author":"Z. Zhang","year":"2004","unstructured":"Zhang, Z., Zha, H., Simon, H.: Low-rank approximations with sparse factors II: Penalized methods with discrete Newton-like iterations. SIAM J. Matrix Anal. Appl.\u00a025, 901\u2013920 (2004)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1198\/106186006X113430","volume":"15","author":"H. Zou","year":"2006","unstructured":"Zou, H., Hastie, T., Tibshirani, R.: Sparse principal component analysis. J. Comput. Graphical Statist.\u00a015, 265\u2013286 (2006)","journal-title":"J. Comput. Graphical Statist."}],"container-title":["Lecture Notes in Computer Science","PRICAI 2008: Trends in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89197-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,4]],"date-time":"2024-03-04T02:55:58Z","timestamp":1709520958000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89197-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540891963","9783540891970"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89197-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}