{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T00:10:43Z","timestamp":1759191043826,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T00:00:00Z","timestamp":1454284800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T00:00:00Z","timestamp":1454284800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["1522629"],"award-info":[{"award-number":["1522629"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["1115568"],"award-info":[{"award-number":["1115568"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-11-1-0068"],"award-info":[{"award-number":["N00014-11-1-0068"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-15-1-2048"],"award-info":[{"award-number":["N00014-15-1-2048"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s10898-016-0402-z","type":"journal-article","created":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T09:07:11Z","timestamp":1454317631000},"page":"657-676","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Projection algorithms for nonconvex minimization with application to sparse principal component analysis"],"prefix":"10.1007","volume":"65","author":[{"given":"William W.","family":"Hager","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dzung T.","family":"Phan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiajie","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,1]]},"reference":[{"key":"402_CR1","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1038\/35000501","volume":"403","author":"AA Alizadeh","year":"2000","unstructured":"Alizadeh, A.A., et al.: Distinct types of diffuse large b-cell lymphoma identified by gene expression profiling. Nature 403, 503\u2013511 (2000)","journal-title":"Nature"},{"key":"402_CR2","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, J.M.: Two point step size gradient methods. IMA J. Numer. Anal. 8, 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"key":"402_CR3","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0167-6377(02)00231-6","volume":"31","author":"A Beck","year":"2003","unstructured":"Beck, A., Teboulle, M.: Mirror descent and nonlinear projected subgradient methods for convex optimization. Oper. Res. Lett. 31, 167\u2013175 (2003)","journal-title":"Oper. Res. Lett."},{"key":"402_CR4","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/0320018","volume":"20","author":"DP Bertsekas","year":"1982","unstructured":"Bertsekas, D.P.: Projected Newton methods for optimization problems with simple constraints. SIAM J. Control Optim. 20, 221\u2013246 (1982)","journal-title":"SIAM J. Control Optim."},{"doi-asserted-by":"crossref","unstructured":"Bhaskara, A., Charikar, M., Chlamtac, E., Feige, U., Vijayaraghavan, A.: Detecting high log-densities: an $$o (n 1\/4)$$ approximation for densest k-subgraph. In: Proceedings of the Forty-Second ACM Symposium on Theory of Computing, ACM, pp.\u00a0201\u2013210 (2010)","key":"402_CR5","DOI":"10.1145\/1806689.1806719"},{"doi-asserted-by":"crossref","unstructured":"Boldi, P., Rosa, M., Santini, M., Vigna, S.: Layered label propagation: A multiresolution coordinate-free ordering for compressing social networks. In: Proceedings of the 20th International Conference on World Wide Web, ACM Press (2011)","key":"402_CR6","DOI":"10.1145\/1963405.1963488"},{"doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: The WebGraph framework I: Compression techniques. In: Proceedings of the Thirteenth International World Wide Web Conference (WWW 2004), Manhattan, USA, ACM Press, pp.\u00a0595\u2013601 (2004)","key":"402_CR7","DOI":"10.1145\/988672.988752"},{"key":"402_CR8","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1080\/757584614","volume":"22","author":"J Cadima","year":"1995","unstructured":"Cadima, J., Jolliffe, I.T.: Loading and correlations in the interpretation of principle compenents. J. Appl. Stat. 22, 203\u2013214 (1995)","journal-title":"J. Appl. Stat."},{"key":"402_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/MSP.2007.914731","volume":"25","author":"E Candes","year":"2008","unstructured":"Candes, E., Wakin, M.: An introduction to compressive sampling. IEEE Signal Process. Mag. 25, 21\u201330 (2008)","journal-title":"IEEE Signal Process. Mag."},{"key":"402_CR10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"SS Chen","year":"1998","unstructured":"Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM J. Sci. Comput. 20, 33\u201361 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"402_CR11","first-page":"63","volume":"6","author":"KL Clarkson","year":"2010","unstructured":"Clarkson, K.L.: Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm. ACM Trans. Algorithms (TALG) 6, 63 (2010)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"402_CR12","first-page":"1269","volume":"9","author":"A d\u2019Aspremont","year":"2008","unstructured":"d\u2019Aspremont, A., Bach, F., Ghaoui, L.E.: Optimal solutions for sparse principal component analysis. J. Mach. Learn. Res. 9, 1269\u20131294 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"402_CR13","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inform. Theory 52, 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"402_CR14","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1214\/009053604000000067","volume":"32","author":"B Efron","year":"2004","unstructured":"Efron, B., Hastie, T., Johnstone, I., Tibshirani, R.: Least angle regression. Ann. Stat. 32, 407\u2013499 (2004)","journal-title":"Ann. Stat."},{"key":"402_CR15","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., Wolfe, P.: An algorithm for quadratic programming. Nav. Res. Logist. Q 3, 95\u2013110 (1956)","journal-title":"Nav. Res. Logist. Q"},{"key":"402_CR16","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"L Grippo","year":"1986","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A nonmonotone line search technique for Newton\u2019s method. SIAM J. Numer. Anal. 23, 707\u2013716 (1986)","journal-title":"SIAM J. Numer. Anal."},{"key":"402_CR17","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1137\/050635225","volume":"17","author":"WW Hager","year":"2006","unstructured":"Hager, W.W., Zhang, H.: A new active set algorithm for box constrained optimization. SIAM J. Optim. 17, 526\u2013557 (2006)","journal-title":"SIAM J. Optim."},{"unstructured":"Hazan, E., Kale, S.: Projection-free online learning, In: Langford, J., Pineau, J. (eds.) Proceedings of the 29th International Conference on Machine Learning, Omnipress, pp.\u00a0521\u2013528 (2012)","key":"402_CR18"},{"unstructured":"Jaggi, M.: Revisiting Frank-Wolfe: Projection-free sparse convex optimization. In: Dasgupta, S., McAllester, D. (eds.) Proceedings of the 30th International Conference on Machine Learning, vol. 28, pp.\u00a0427\u2013435 (2013)","key":"402_CR19"},{"key":"402_CR20","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. Stat. 16, 225\u2013236 (1967)","journal-title":"Appl. Stat."},{"unstructured":"Jenatton, R., Obozinski, G., Bach, F.: Structured sparse principal component analysis. In: International Conference on Artificial Intelligence and Statistics (AISTATS) (2010)","key":"402_CR21"},{"key":"402_CR22","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1198\/1061860032148","volume":"12","author":"IT Jolliffe","year":"2003","unstructured":"Jolliffe, I.T., Trendafilov, N.T., Uddin, M.: A modified principal component technique based on the LASSO. J. Comput. Graph. Stat. 12, 531\u2013547 (2003)","journal-title":"J. Comput. Graph. Stat."},{"key":"402_CR23","first-page":"517","volume":"11","author":"M Journ\u00e9e","year":"2010","unstructured":"Journ\u00e9e, M., Nesterov, Y., Richt\u00e1rik, P., Sepulchre, R.: Generalized power method for sparse principal component analysis. J. Mach. Learn. Res. 11, 517\u2013553 (2010)","journal-title":"J. Mach. Learn. Res."},{"doi-asserted-by":"crossref","unstructured":"Khuller, S., Saha, B.: On finding dense subgraphs, In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) Automata, Languages and Programming, pp. 597\u2013608. Springer, New York (2009)","key":"402_CR24","DOI":"10.1007\/978-3-642-02927-1_50"},{"unstructured":"Lacoste-Julien, S., Jaggi, M., Schmidt, M., Pletscher, P.: Block-coordinate Frank-Wolfe optimization for structural SVMs. In: Dasgupta, S., McAllester, D. (eds.) Proceedings of the 30th International Conference on Machine Learning, vol. 28, pp.\u00a053\u201361 (2013)","key":"402_CR25"},{"key":"402_CR26","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.orl.2010.11.005","volume":"39","author":"R Luss","year":"2011","unstructured":"Luss, R., Teboulle, M.: Convex approximations to sparse PCA via Lagrangian duality. Oper. Res. Lett. 39, 57\u201361 (2011)","journal-title":"Oper. Res. Lett."},{"key":"402_CR27","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/110839072","volume":"55","author":"R Luss","year":"2013","unstructured":"Luss, R., Teboulle, M.: Conditional gradient algorithms for rank-one matrix approximations with a sparsity constraint. SIAM Rev. 55, 65\u201398 (2013)","journal-title":"SIAM Rev."},{"key":"402_CR28","doi-asserted-by":"publisher","first-page":"15149","DOI":"10.1073\/pnas.211566398","volume":"98","author":"S Ramaswamy","year":"2001","unstructured":"Ramaswamy, S., Tamayo, P., Rifkin, R., Mukherjee, S., Yeang, C.-H., Angelo, M., Ladd, C., Reich, M., Latulippe, E., Mesirov, J.P., et al.: Multiclass cancer diagnosis using tumor gene expression signatures. Proc. Natl. Acad. Sci. USA 98, 15149\u201315154 (2001)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"402_CR29","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"402_CR30","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10994-010-5226-3","volume":"85","author":"BK Sriperumbudur","year":"2011","unstructured":"Sriperumbudur, B.K., Torres, D.A., Lanckriet, G.R.: A majorization-minimization approach to the sparse generalized eigenvalue problem. Mach. Learn. 85, 3\u201339 (2011)","journal-title":"Mach. Learn."},{"key":"402_CR31","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10287-012-0158-y","volume":"10","author":"A Takeda","year":"2013","unstructured":"Takeda, A., Niranjan, M., Gotoh, J.-Y., Kawahara, Y.: Simultaneous pursuit of out-of-sample performance and sparsity in index tracking portfolios. Comput. Manag. Sci. 10, 21\u201349 (2013)","journal-title":"Comput. Manag. Sci."},{"key":"402_CR32","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1137\/080714488","volume":"31","author":"E van den Berg","year":"2009","unstructured":"van den Berg, E., Friedlander, M.P.: Probing the pareto frontier for basis pursuit solutions. SIAM J. Sci. Comput. 31, 890\u2013912 (2009)","journal-title":"SIAM J. Sci. Comput."},{"key":"402_CR33","doi-asserted-by":"publisher","first-page":"2479","DOI":"10.1109\/TSP.2009.2016892","volume":"57","author":"SJ Wright","year":"2009","unstructured":"Wright, S.J., Nowak, R.D., Figueiredo, M.A.T.: Sparse reconstruction by separable approximation. IEEE Trans. Signal Process. 57, 2479\u20132493 (2009)","journal-title":"IEEE Trans. Signal Process."},{"key":"402_CR34","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1023\/A:1021390231133","volume":"25","author":"Y Ye","year":"2003","unstructured":"Ye, Y., Zhang, J.: Approximation of dense-n\/2-subgraph and the complement of min-bisection. J. Glob. Optim. 25, 55\u201373 (2003)","journal-title":"J. Glob. Optim."},{"key":"402_CR35","first-page":"899","volume":"14","author":"X-T Yuan","year":"2013","unstructured":"Yuan, X.-T., Zhang, T.: Truncated power method for sparse eigenvalue problems. J. Mach. Learn. Res. 14, 899\u2013925 (2013)","journal-title":"J. Mach. Learn. Res."},{"key":"402_CR36","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. Graph. Stat. 15, 265\u2013286 (2006)","journal-title":"J. Comput. Graph. Stat."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-016-0402-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-016-0402-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-016-0402-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-016-0402-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T07:22:15Z","timestamp":1589700135000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-016-0402-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,1]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["402"],"URL":"https:\/\/doi.org\/10.1007\/s10898-016-0402-z","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2016,2,1]]},"assertion":[{"value":"29 March 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}