{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T20:18:31Z","timestamp":1648844311536},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,9,30]],"date-time":"2010-09-30T00:00:00Z","timestamp":1285804800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s11590-010-0233-7","type":"journal-article","created":{"date-parts":[[2010,9,29]],"date-time":"2010-09-29T11:56:50Z","timestamp":1285761410000},"page":"665-682","source":"Crossref","is-referenced-by-count":1,"title":["A regularized strong duality for nonsymmetric semidefinite least squares problem"],"prefix":"10.1007","volume":"5","author":[{"given":"Yingnan","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naihua","family":"Xiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziyan","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,9,30]]},"reference":[{"key":"233_CR1","volume-title":"Convex Analysis and Optimization","author":"D.P. Bertsekas","year":"2003","unstructured":"Bertsekas D.P., Nedi\u0107 A.N., Ozdaglar E.: Convex Analysis and Optimization. Athena Scientific, Belmont (2003)"},{"issue":"1","key":"233_CR2","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1093\/imanum\/drn085","volume":"30","author":"R. Borsdorf","year":"2010","unstructured":"Borsdorf R., Higham N.J.: A preconditioned Newton algorithm for the nearest correlation matrix. IMA J. Numer. Anal. 30(1), 94\u2013107 (2010)","journal-title":"IMA J. Numer. Anal."},{"key":"233_CR3","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/0022-247X(81)90138-4","volume":"83","author":"J. Borwein","year":"1981","unstructured":"Borwein J., Wolkowicz H.: Regularizing the abstract convex program. J. Math. Anal. Appl. 83, 495\u2013530 (1981)","journal-title":"J. Math. Anal. Appl."},{"issue":"2","key":"233_CR4","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1137\/040609902","volume":"27","author":"S. Boyd","year":"2005","unstructured":"Boyd S., Xiao L.: Least-squares covariance matrix adjustments. SIAM J. Matrix Anal. Appl. 27(2), 532\u2013546 (2005)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"233_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-9298-9","volume-title":"Best Approximation in Inner Product Spaces. CMS Books Math.\/Ouvrages Math. SMC 7","author":"F. Deutsch","year":"2001","unstructured":"Deutsch F.: Best Approximation in Inner Product Spaces. CMS Books Math.\/Ouvrages Math. SMC 7. Springer, New York (2001)"},{"issue":"3","key":"233_CR6","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1093\/imanum\/22.3.329","volume":"22","author":"N.J. Higham","year":"2002","unstructured":"Higham N.J.: Computing the nearest correlation matrix: a problem from finance. IMA J. Numer. Anal. 22(3), 329\u2013343 (2002)","journal-title":"IMA J. Numer. Anal."},{"key":"233_CR7","volume-title":"Matrix Analysis","author":"R.A. Horn","year":"1986","unstructured":"Horn R.A., Johnson C.A.: Matrix Analysis. Cambridge University Press, Cambridge (1986)"},{"key":"233_CR8","unstructured":"Krislock, N.: Numerical solution of semidefinite constrained least squares problems. Master\u2019s thesis, University of British Columbia, Institute of Applied Mathematics, Vancouver, BC, Canada. http:\/\/www.iam.ubc.ca\/theses\/Krislock\/NKrislock_MSc_Thesis.pdf (2003)"},{"key":"233_CR9","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1109\/TRO.2004.832794","volume":"20","author":"N. Krislock","year":"2004","unstructured":"Krislock N., Lang J., Varah J. et\u00a0al.: Local compliance estimation via positive semidefinite constrained least squares. IEEE Trans. Robot. Autom. 20, 1007\u20131011 (2004)","journal-title":"IEEE Trans. Robot. Autom."},{"issue":"1","key":"233_CR10","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1137\/S0895479802413856","volume":"26","author":"J. Malick","year":"2004","unstructured":"Malick J.: A dual approach to solve semidefinite least-squares problems. SIAM J. Matrix Anal. Appl. 26(1), 272\u2013284 (2004)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"233_CR11","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1287\/moor.28.1.39.14258","volume":"28","author":"J.S. Pang","year":"2003","unstructured":"Pang J.S., Sun D.F., Sun J.: Semismooth homeomorphisms and strong stability of semidefinite and Lorentz cone complementarity problems. Math. Oper. Res. 28, 39\u201363 (2003)","journal-title":"Math. Oper. Res."},{"key":"233_CR12","doi-asserted-by":"crossref","DOI":"10.1090\/fic\/018","volume-title":"Topics in Semidefinite and Interior-Point Methods, Fields Institute Communications Series, vol. 18","author":"P.M. Pardalos","year":"1998","unstructured":"Pardalos P.M., Wolkowicz H.: Topics in Semidefinite and Interior-Point Methods, Fields Institute Communications Series, vol. 18. American Mathematical Society, New Providence, Rhode Island (1998)"},{"key":"233_CR13","unstructured":"Pataki, G.: A Simple Derivation of a Facial Reduction Algorithm, and Extended Dual Systems. Technical report, Columbia University. http:\/\/www.unc.edu\/~pataki\/papers\/fr.pdf (1996)"},{"issue":"2","key":"233_CR14","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/moor.1060.0242","volume":"32","author":"G. Pataki","year":"2007","unstructured":"Pataki G.: On the closedness of the linear image of a closed convex cone. Math. Oper. Res. 32(2), 395\u2013412 (2007)","journal-title":"Math. Oper. Res."},{"key":"233_CR15","unstructured":"P\u00f3lik, I., Terlaky, T.: Exact duality for optimization over symmetric cones, Technical report, McMaster University. http:\/\/www.optimization-online.org\/DB_HTML\/2007\/08\/1754.html (2007)"},{"issue":"2","key":"233_CR16","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1137\/050624509","volume":"28","author":"H.D. Qi","year":"2006","unstructured":"Qi H.D., Sun D.F.: A quadratically convergent Newton method for computing the nearest correlation matrix. SIAM J. Matrix Anal. Appl. 28(2), 360\u2013385 (2006)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"233_CR17","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1287\/moor.1080.0315","volume":"34","author":"H.D. Qi","year":"2009","unstructured":"Qi H.D.: Local duality of nonlinear semidefinite programming. Math. Oper. Res. 34(1), 124\u2013141 (2009)","journal-title":"Math. Oper. Res."},{"key":"233_CR18","doi-asserted-by":"crossref","unstructured":"Qi, H.D., Sun, D.F.: An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem. IMA J. Numer. Anal. (2010, to appear)","DOI":"10.1093\/imanum\/drp031"},{"key":"233_CR19","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1137\/S1052623495288350","volume":"7","author":"M.V. Ramana","year":"1997","unstructured":"Ramana M.V., Tun\u00e7el L., Wolkowicz H.: Strong duality for semidefinite programming. SIAM J. Optim. 7, 641\u2013662 (1997)","journal-title":"SIAM J. Optim."},{"key":"233_CR20","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/978-1-4613-3449-1_9","volume-title":"Interior Point methods of Mathematical Programming.","author":"M.V. Ramana","year":"1996","unstructured":"Ramana M.V., Pardalos P.M.: Semidefinite programming. In: Terlaky, T. (eds) Interior Point methods of Mathematical Programming., pp. 369\u2013398. Kluwer Academic Publishers, Dordrecht (1996)"},{"key":"233_CR21","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"Rockafellar R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"233_CR22","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1287\/moor.1060.0195","volume":"31","author":"D.F. Sun","year":"2006","unstructured":"Sun D.F.: The strong second order sufficient condition and constraint nondegeneracy in nonlinear semidefinite programming and their implications. Math. Oper. Res. 31, 761\u2013776 (2006)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"233_CR23","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10107-006-0088-y","volume":"112","author":"K.C. Toh","year":"2002","unstructured":"Toh K.C.: An inexact primal-dual path-following algorithm for convex quadratic SDP. Math. Program. Ser. B. 112(1), 221\u2013254 (2002)","journal-title":"Math. Program. Ser. B."},{"key":"233_CR24","unstructured":"Tun\u00e7el, L., Wolkowicz, H.: Strong duality and minimal representations for cone optimization. Technical report, Waterloo University. http:\/\/www.optimization-online.org\/DB_HTML\/2008\/08\/2063.html (2008)"},{"key":"233_CR25","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1016\/j.laa.2010.03.042","volume":"433","author":"Y.N. Wang","year":"2010","unstructured":"Wang Y.N., Xiu N.H., Han J.Y.: On cone of nonsymmetric positive semidefinite matrices. Linear Algebra Appl. 433, 718\u2013736 (2010)","journal-title":"Linear Algebra Appl."},{"key":"233_CR26","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/978-1-4615-4381-7","volume-title":"Handbook of Semidefinite Programming: Theory, Algorithms, and Applications","author":"H. Wolkowicz","year":"2000","unstructured":"Wolkowicz H., Saigal R., Vandenberghe L.: Handbook of Semidefinite Programming: Theory, Algorithms, and Applications, pp. 34\u201336. Kluwer Academic Publishers, Boston (2000)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-010-0233-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-010-0233-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-010-0233-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T04:12:24Z","timestamp":1559707944000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-010-0233-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,30]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["233"],"URL":"https:\/\/doi.org\/10.1007\/s11590-010-0233-7","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,30]]}}}