{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,18]],"date-time":"2026-09-18T09:18:20Z","timestamp":1789723100206,"version":"4.0.1"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,4,13]],"date-time":"2014-04-13T00:00:00Z","timestamp":1397347200000},"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":["Math. Program."],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1007\/s10107-014-0774-0","type":"journal-article","created":{"date-parts":[[2014,4,12]],"date-time":"2014-04-12T03:05:00Z","timestamp":1397271900000},"page":"423-457","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":42,"title":["Tensor principal component analysis via convex optimization"],"prefix":"10.1007","volume":"150","author":[{"given":"Bo","family":"Jiang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shiqian","family":"Ma","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":[[2014,4,13]]},"reference":[{"key":"774_CR1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"F Alizadeh","year":"1993","unstructured":"Alizadeh, F.: Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optim. 5, 13\u201351 (1993)","journal-title":"SIAM J. Optim."},{"key":"774_CR2","doi-asserted-by":"crossref","unstructured":"Bloy, L., Verma, R.: On computing the underlying fiber directions from the diffusion orientation distribution function. In: Metaxas, D., Axel, L., Fichtinger, G., Szekeley, G. (eds.) Medical Image Computing and Computer-Assisted Intervention, MICCAI (2008)","DOI":"10.1007\/978-3-540-85988-8_1"},{"key":"774_CR3","doi-asserted-by":"crossref","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1\u2013122 (2011)","DOI":"10.1561\/2200000016"},{"key":"774_CR4","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9, 717\u2013772 (2009)","journal-title":"Found. Comput. Math."},{"key":"774_CR5","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"EJ Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E.J., Romberg, J., Tao, T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52, 489\u2013509 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"774_CR6","doi-asserted-by":"crossref","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Tao, T.: The power of convex relaxation: near-optimal matrix completion. IEEE Trans. Inf. Theory 56(5), 2053\u20132080 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"774_CR7","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF02310791","volume":"35","author":"JD Carroll","year":"1970","unstructured":"Carroll, J.D., Chang, J.J.: Analysis of individual differences in multidimensional scaling via an n-way generalization of \u201ceckart-young\u201d decomposition. Psychometrika 35(3), 283\u2013319 (1970)","journal-title":"Psychometrika"},{"issue":"6","key":"774_CR8","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1007\/s10208-012-9135-7","volume":"12","author":"V Chandrasekaran","year":"2012","unstructured":"Chandrasekaran, V., Recht, P.A., Parrilo, B., Willsky, A.S.: The convex geometry of linear inverse problems. Found. Comput. Math. 12(6), 805\u2013849 (2012)","journal-title":"Found. Comput. Math."},{"key":"774_CR9","unstructured":"Chen, B.: Optimization with Block Variables: Theory and Applications. PhD thesis, The Chinese Univesrity of Hong Kong (2012)"},{"key":"774_CR10","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/110834524","volume":"22","author":"B Chen","year":"2012","unstructured":"Chen, B., He, S., Li, Z., Zhang, S.: Maximum block improvement and polynomial optimization. SIAM J. Optim. 22, 87\u2013107 (2012)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"774_CR11","doi-asserted-by":"crossref","first-page":"1254","DOI":"10.1137\/060661569","volume":"30","author":"P Comon","year":"2008","unstructured":"Comon, P., Golub, G., Lim, L.H., Mourrain, B.: Symmetric tensors and symmetric tensor rank. SIAM J. Matrix Anal. Appl. 30(3), 1254\u20131279 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"774_CR12","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, 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"774_CR13","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1090\/S0002-9947-1956-0084194-4","volume":"82","author":"J Douglas","year":"1956","unstructured":"Douglas, J., Rachford, H.H.: On the numerical solution of the heat conduction problem in 2 and 3 space variables. Trans. Am. Math. Soc. 82, 421\u2013439 (1956)","journal-title":"Trans. Am. Math. Soc."},{"key":"774_CR14","unstructured":"Eckstein, J.: Splitting Methods for Monotone Operators with Applications to Parallel Optimization. PhD thesis, Massachusetts Institute of Technology (1989)"},{"key":"774_CR15","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J Eckstein","year":"1992","unstructured":"Eckstein, J., Bertsekas, D.P.: On the Douglas\u2013Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55, 293\u2013318 (1992)","journal-title":"Math. Program."},{"key":"774_CR16","volume-title":"Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems","author":"M Fortin","year":"1983","unstructured":"Fortin, M., Glowinski, R.: Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems. North-Holland, Amsterdam (1983)"},{"key":"774_CR17","volume-title":"Augmented Lagrangian Methods: Applications to the Solution of Boundary Value Problems","author":"D Gabay","year":"1983","unstructured":"Gabay, D.: Applications of the method of multipliers to variational inequalities. In: Fortin, M., Glowinski, R. (eds.) Augmented Lagrangian Methods: Applications to the Solution of Boundary Value Problems. North-Holland, Amsterdam (1983)"},{"issue":"2","key":"774_CR18","doi-asserted-by":"crossref","first-page":"025010","DOI":"10.1088\/0266-5611\/27\/2\/025010","volume":"27","author":"S Gandy","year":"2011","unstructured":"Gandy, S., Recht, B., Yamada, I.: Tensor completion and low-n-rank tensor recovery via convex optimization. Inverse Probl. 27(2), 025010 (2011)","journal-title":"Inverse Probl."},{"key":"774_CR19","unstructured":"Ghosh, A., Tsigaridas, E., Descoteaux, M., Comon, P., Mourrain, B., Deriche, R.: A polynomial based approach to extract the maxima of an antipodally symmetric spherical function and its application to extract fiber directions from the orientation distribution function in diffusion MRI. In: Computational Diffusion MRI Workshop (CDMRI08), New York (2008)"},{"key":"774_CR20","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970838","volume-title":"Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics","author":"R Glowinski","year":"1989","unstructured":"Glowinski, R., Le Tallec, P.: Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics. SIAM, Philadelphia, PA (1989)"},{"issue":"6","key":"774_CR21","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM (JACM) 42(6), 1115\u20131145 (1995)","journal-title":"J. ACM (JACM)"},{"key":"774_CR22","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/080725891","volume":"2","author":"T Goldstein","year":"2009","unstructured":"Goldstein, T., Osher, S.: The split Bregman method for L1-regularized problems. SIAM J. Imaging Sci. 2, 323\u2013343 (2009)","journal-title":"SIAM J. Imaging Sci."},{"key":"774_CR23","unstructured":"Grant, M., Boyd, S.: CVX: Matlab Software for Disciplined Convex Programming, version 1.21. http:\/\/cvxr.com\/cvx , May 2010"},{"key":"774_CR24","unstructured":"Harshman, R.A.: Foundations of the parafac procedure: models and conditions for an \u201cexplanatory\u201d multimodal factor analysis. UCLA Working Papers in Phonetics, vol 16, pp. 1\u201384. http:\/\/publish.uwo.ca\/~harshman\/wppfac0.pdf (1970)"},{"key":"774_CR25","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1016\/0196-6774(90)90014-6","volume":"11","author":"J H\u00e5stad","year":"1990","unstructured":"H\u00e5stad, J.: Tensor rank is NP-complete. J. Algorithms 11, 644\u2013654 (1990)","journal-title":"J. Algorithms"},{"key":"774_CR26","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1080\/10556780802699201","volume":"24","author":"D Henrion","year":"2009","unstructured":"Henrion, D., Lasserre, J.B., Loefberg, J.: GloptiPoly 3: moments, optimization and semidefinite programming. Optim. Methods Softw. 24, 761\u2013779 (2009)","journal-title":"Optim. Methods Softw."},{"key":"774_CR27","doi-asserted-by":"crossref","first-page":"072102","DOI":"10.1063\/1.3451264","volume":"51","author":"JJ Hilling","year":"2010","unstructured":"Hilling, J.J., Sudbery, A.: The geometric measure of multipartite entanglement and the singular values of a hypermatrix. J. Math. Phys. 51, 072102 (2010)","journal-title":"J. Math. Phys."},{"key":"774_CR28","doi-asserted-by":"crossref","unstructured":"Hitchcock, F.L.: The Expression of a Tensor or a Polyadic as a Sum of Products. J. Math. Phys. 6, 164\u2013189 (1927)","DOI":"10.1002\/sapm192761164"},{"issue":"1","key":"774_CR29","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1002\/sapm19287139","volume":"7","author":"FL Hitchcock","year":"1927","unstructured":"Hitchcock, F.L.: Multiple invariants and generalized rank of a p-way matrix or tensor. J. Math. Phys. 7(1), 39\u201379 (1927)","journal-title":"J. Math. Phys."},{"issue":"4","key":"774_CR30","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1007\/s10878-011-9407-1","volume":"24","author":"S Hu","year":"2012","unstructured":"Hu, S., Qi, L.: Algebraic connectivity of an even uniform hypergraph. J. Comb. Optim. 24(4), 564\u2013579 (2012)","journal-title":"J. Comb. Optim."},{"key":"774_CR31","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1137\/S0895479801387413","volume":"23","author":"E Kofidis","year":"2002","unstructured":"Kofidis, E., Regalia, P.A.: On the best rank- $$1$$ 1 approximation of higher-order supersymmetric tensors. SIAM J. Matrix Anal. Appl. 23, 863\u2013884 (2002)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"774_CR32","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Rev. 51, 455\u2013500 (2009)","journal-title":"SIAM Rev."},{"key":"774_CR33","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1137\/100801482","volume":"32","author":"TG Kolda","year":"2011","unstructured":"Kolda, T.G., Mayo, J.R.: Shifted power method for computing tensor eigenpairs. SIAM J. Matrix Anal. 32, 1095\u20131124 (2011)","journal-title":"SIAM J. Matrix Anal."},{"key":"774_CR34","unstructured":"Kruskal, J.B.: Rank, Decomposition, and Uniqueness for 3-way and n-way arrays. In: Multiway Data Analysis, pp. 7\u201318 (1989)"},{"key":"774_CR35","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11, 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"key":"774_CR36","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1090\/S0002-9947-01-02898-7","volume":"354","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J.B.: Polynomials nonnegative on a grid and discrete representations. Trans. Am. Math. Soc. 354, 631\u2013649 (2001)","journal-title":"Trans. Am. Math. Soc."},{"key":"774_CR37","unstructured":"Li, W., Ng, M.: Existence and Uniqueness of Stationary Probability Vector of a Transition Probability Tensor. Technical Report. Department of Mathematics, The Hong Kong Baptist University (2011)"},{"key":"774_CR38","unstructured":"Lim, L.H.: Singular values and eigenvalues of tensors: a variational approach. In: Computational Advances in Multi-Sensor Adaptive Processing, 2005 1st IEEE International Workshop on, pp. 129\u2013132. IEEE (2005)"},{"key":"774_CR39","doi-asserted-by":"crossref","first-page":"1286","DOI":"10.1137\/080729104","volume":"20","author":"C Ling","year":"2009","unstructured":"Ling, C., Nie, J., Qi, L., Ye, Y.: Biquadratic optimization over unit spheres and semidefinite programming relaxations. SIAM J. Optim. 20, 1286\u20131310 (2009)","journal-title":"SIAM J. Optim."},{"key":"774_CR40","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"PL Lions","year":"1979","unstructured":"Lions, P.L., Mercier, B.: Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 16, 964\u2013979 (1979)","journal-title":"SIAM J. Numer. Anal."},{"key":"774_CR41","unstructured":"Liu, J., Musialski, P., Wonka, P., Ye, J.: Tensor completion for estimating missing values in visual data. In: The Twelfth IEEE International Conference on Computer Vision (2009)"},{"issue":"2","key":"774_CR42","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s40305-013-0016-9","volume":"1","author":"S Ma","year":"2013","unstructured":"Ma, S.: Alternating direction method of multipliers for sparse principal component analysis. J. Oper. Res. Soc. China 1(2), 253\u2013274 (2013)","journal-title":"J. Oper. Res. Soc. China"},{"key":"774_CR43","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10107-009-0306-5","volume":"128","author":"S Ma","year":"2011","unstructured":"Ma, S., Goldfarb, D., Chen, L.: Fixed point and Bregman iterative methods for matrix rank minimization. Math. Program. Ser. A 128, 321\u2013353 (2011)","journal-title":"Math. Program. Ser. A"},{"key":"774_CR44","unstructured":"Mackey, L.: Deflation methods for sparse PCA. In: Advances in Neural Information Processing Systems (NIPS) (2008)"},{"key":"774_CR45","unstructured":"Parrilo, P.A.: Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Optimization. PhD thesis, California Institute of Technology (2000)"},{"key":"774_CR46","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s10107-003-0387-5","volume":"96","author":"PA Parrilo","year":"2003","unstructured":"Parrilo, P.A.: Semidefinite programming relaxations for semialgebraic problems. Math. Program. Ser. B 96, 293\u2013320 (2003)","journal-title":"Math. Program. Ser. B"},{"key":"774_CR47","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0103003","volume":"3","author":"DH Peaceman","year":"1955","unstructured":"Peaceman, D.H., Rachford, H.H.: The numerical solution of parabolic elliptic differential equations. SIAM J. Appl. Math. 3, 28\u201341 (1955)","journal-title":"SIAM J. Appl. Math."},{"key":"774_CR48","doi-asserted-by":"crossref","first-page":"1302","DOI":"10.1016\/j.jsc.2005.05.007","volume":"40","author":"L Qi","year":"2005","unstructured":"Qi, L.: Eigenvalues of a real supersymmetric tensor. J. Symb. Comput. 40, 1302\u20131324 (2005)","journal-title":"J. Symb. Comput."},{"key":"774_CR49","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s10107-007-0193-6","volume":"118","author":"L Qi","year":"2009","unstructured":"Qi, L., Wang, F., Wang, Y.: Z-eigenvalue methods for a global polynomial optimization problem. Math. Program. Ser. A 118, 301\u2013316 (2009)","journal-title":"Math. Program. Ser. A"},{"key":"774_CR50","doi-asserted-by":"crossref","unstructured":"Qi, L., Yu, G., Wu, E.X.: Higher order positive semi-definite diffusion tensor imaging. SIAM J. Imaging Sci. 3(3), 416\u2013433 (2010)","DOI":"10.1137\/090755138"},{"issue":"3","key":"774_CR51","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.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52(3), 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"key":"774_CR52","doi-asserted-by":"crossref","unstructured":"Scheinberg, K., Ma, S., Goldfarb, D.: Sparse inverse covariance selection via alternating linearization methods. In: NIPS (2010)","DOI":"10.7551\/mitpress\/8996.003.0019"},{"key":"774_CR53","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1137\/100781894","volume":"21","author":"M Tao","year":"2011","unstructured":"Tao, M., Yuan, X.: Recovering low-rank and sparse components of matrices from incomplete and noisy observations. SIAM J. Optim. 21, 57\u201381 (2011)","journal-title":"SIAM J. Optim."},{"key":"774_CR54","unstructured":"Tomioka, R., Suzuki, T., Hayashi, K., Kashima, H.: Statistical performance of convex tensor decomposition. In: Advances in Neural Information Processing Systems (NIPS), p. 137 (2011)"},{"issue":"1","key":"774_CR55","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L Vandenberghe","year":"1996","unstructured":"Vandenberghe, L., Boyd, S.: Semidefinite programming. SIAM Rev. 38(1), 49\u201395 (1996)","journal-title":"SIAM Rev."},{"key":"774_CR56","unstructured":"Wang, H., Ahuja, N.: Compact representation of multidimensional data using tensor rank-one decomposition. In: Proceedings of the Pattern Recognition, 17th International Conference on ICPR (2004)"},{"issue":"3","key":"774_CR57","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1137\/080724265","volume":"1","author":"Y Wang","year":"2008","unstructured":"Wang, Y., Yang, J., Yin, W., Zhang, Y.: A new alternating minimization algorithm for total variation image reconstruction. SIAM J. Imaging Sci. 1(3), 248\u2013272 (2008)","journal-title":"SIAM J. Imaging Sci."},{"key":"774_CR58","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s12532-010-0017-1","volume":"2","author":"Z Wen","year":"2010","unstructured":"Wen, Z., Goldfarb, D., Yin, W.: Alternating direction augmented Lagrangian methods for semidefinite programming. Math. Program. Comput. 2, 203\u2013230 (2010)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"774_CR59","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1137\/090777761","volume":"33","author":"J Yang","year":"2011","unstructured":"Yang, J., Zhang, Y.: Alternating direction algorithms for $$\\ell _1$$ \u2113 1 problems in compressive sensing. SIAM J. Sci. Comput. 33(1), 250\u2013278 (2011)","journal-title":"SIAM J. Sci. Comput."},{"key":"774_CR60","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s10915-011-9507-1","volume":"51","author":"X Yuan","year":"2012","unstructured":"Yuan, X.: Alternating direction methods for sparse covariance selection. J. Sci. Comput. 51, 261\u2013273 (2012)","journal-title":"J. Sci. Comput."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0774-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-014-0774-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0774-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T22:24:22Z","timestamp":1689114262000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-014-0774-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,13]]},"references-count":60,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["774"],"URL":"https:\/\/doi.org\/10.1007\/s10107-014-0774-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,13]]}}}