{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:46:22Z","timestamp":1740123982722,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T00:00:00Z","timestamp":1551052800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11501100"],"award-info":[{"award-number":["11501100"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11571178","11671082"],"award-info":[{"award-number":["11571178","11671082"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"STIP of Higher Education Institutions in Shanxi","award":["201802103"],"award-info":[{"award-number":["201802103"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871149"],"award-info":[{"award-number":["11871149"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s10957-019-01493-z","type":"journal-article","created":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T14:09:39Z","timestamp":1551103779000},"page":"946-971","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On a Box-Constrained Linear Symmetric Cone Optimization Problem"],"prefix":"10.1007","volume":"181","author":[{"given":"Yi","family":"Xu","sequence":"first","affiliation":[]},{"given":"Xihong","family":"Yan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,25]]},"reference":[{"key":"1493_CR1","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1137\/0806020","volume":"6","author":"C Helmberg","year":"1996","unstructured":"Helmberg, C., Rendl, F., Vanderbei, R.J., Wolkowicz, H.: An interior-point method for semidefinite programming. SIAM J. Optim. 6, 342\u2013361 (1996)","journal-title":"SIAM J. Optim."},{"key":"1493_CR2","doi-asserted-by":"publisher","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. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"1493_CR3","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032701","volume-title":"Interior Point Algorithm: Theory and Analysis, Wiley-Interscience Series in Discrete Mathematics and Optimization","author":"YY Ye","year":"1997","unstructured":"Ye, Y.Y.: Interior Point Algorithm: Theory and Analysis, Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley and Sons, New York (1997)"},{"key":"1493_CR4","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1137\/070687128","volume":"19","author":"F Jarre","year":"2008","unstructured":"Jarre, F., Rendl, F.: An augmented primal-dual method for linear conic programs. SIAM J. Optim. 19, 808\u2013823 (2008)","journal-title":"SIAM J. Optim."},{"key":"1493_CR5","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1137\/070704575","volume":"20","author":"J Malick","year":"2009","unstructured":"Malick, J., Povh, J., Rendl, F., Wiegele, A.: Regularization methods for semidefinite programming. SIAM J. Optim. 20, 336\u2013356 (2009)","journal-title":"SIAM J. Optim."},{"key":"1493_CR6","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10107-006-0088-y","volume":"112","author":"KC Toh","year":"2007","unstructured":"Toh, K.C.: An inexact primal-dual path-following algorithm for convex quadratic SDP. Math. Program. 112, 221\u2013254 (2007)","journal-title":"Math. Program."},{"key":"1493_CR7","doi-asserted-by":"publisher","first-page":"1737","DOI":"10.1137\/080718206","volume":"20","author":"X Zhao","year":"2010","unstructured":"Zhao, X., Sun, D., Toh, K.: A Newton-CG augmented Lagrangian method for semidefinite programming. SIAM J. Optim. 20, 1737\u20131765 (2010)","journal-title":"SIAM J. Optim."},{"key":"1493_CR8","doi-asserted-by":"publisher","first-page":"1874","DOI":"10.1016\/j.aml.2011.05.010","volume":"24","author":"Y Xu","year":"2011","unstructured":"Xu, Y., Sun, W., Qi, L.: A feasible direction method for the semidefinite program with box constraints. Appl. Math. Lett. 24, 1874\u20131881 (2011)","journal-title":"Appl. Math. Lett."},{"key":"1493_CR9","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/A:1019928808826","volume":"23","author":"EG Birgin","year":"2002","unstructured":"Birgin, E.G., Martinez, J.M.: Large-scale active-set box-constrained optimization method with spectral projected gradients. Comput. Optim. Appl. 23, 101\u2013125 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"1493_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-99789-1_7","volume-title":"Applied Mathematics and Parallel Computing. Festschrift for Klaus Ritter","author":"JE Dennis","year":"1996","unstructured":"Dennis, J.E., Vicente, L.N.: Trust region interior point algorithms for minimization problems with simple bounds. In: Fisher, H., Riedm\u00fcler, B., Sch\u00e4fler, S. (eds.) Applied Mathematics and Parallel Computing. Festschrift for Klaus Ritter, pp. 97\u2013107. Springer, Berlin (1996)"},{"key":"1493_CR11","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1137\/S1052623493253991","volume":"8","author":"F Facchinei","year":"1998","unstructured":"Facchinei, F., J\u00faice, J., Soares, J.: An active set Newton\u2019s algorithm for large-scale nonlinear programs with box constraints. SIAM J. Optim. 8, 158\u2013186 (1998)","journal-title":"SIAM J. Optim."},{"key":"1493_CR12","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/BF01183013","volume":"30","author":"A Friedlander","year":"1994","unstructured":"Friedlander, A., Martinez, J.M., Santos, S.A.: A new trust region algorithm for bound constrained minimization. Appl. Math. Optim. 30, 235\u2013266 (1994)","journal-title":"Appl. Math. Optim."},{"key":"1493_CR13","first-page":"67","volume":"199","author":"WW Hager","year":"2006","unstructured":"Hager, W.W., Zhang, H.: Recent advances in bound constrained optimization. IFIP Int. Fed. Inf. Process. 199, 67\u201382 (2006)","journal-title":"IFIP Int. Fed. Inf. Process."},{"key":"1493_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-002-0339-5","volume":"95","author":"F Alizadeh","year":"2003","unstructured":"Alizadeh, F., Goldfarb, D.: Second-order cone programming. Math. Program. 95, 3\u201351 (2003)","journal-title":"Math. Program."},{"key":"1493_CR15","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198534778.001.0001","volume-title":"Analysis on Symmetric Cones. Oxford Mathematical Monographs","author":"J Faraut","year":"1994","unstructured":"Faraut, J., Kor\u00e1nyi, A.: Analysis on Symmetric Cones. Oxford Mathematical Monographs. Oxford University Press, New York (1994)"},{"key":"1493_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.22.1.1","volume":"22","author":"YE Nesterov","year":"1997","unstructured":"Nesterov, Y.E., Todd, M.J.: Self-scaled barriers and interior-point methods for convex programming. Math. Oper. Res. 22, 1\u201342 (1997)","journal-title":"Math. Oper. Res."},{"key":"1493_CR17","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s10107-003-0380-z","volume":"96","author":"SH Schmieta","year":"2003","unstructured":"Schmieta, S.H., Alizadeh, F.: Extension of primal-dual interior point algorithms to symmetric cones. Math. Program. 96, 409\u2013438 (2003)","journal-title":"Math. Program."},{"key":"1493_CR18","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0024-3795(00)00096-3","volume":"312","author":"JF Sturm","year":"2000","unstructured":"Sturm, J.F.: Similarity and other spectral relations for symmetric cones. Linear. Algebra. Appl. 312, 135\u2013154 (2000)","journal-title":"Linear. Algebra. Appl."},{"key":"1493_CR19","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1093\/imamat\/6.1.76","volume":"6","author":"CG Broyden","year":"1970","unstructured":"Broyden, C.G.: The convergence of a class of double-rank minimization algorithms. J. Inst. Math. Appl. 6, 76\u201390 (1970)","journal-title":"J. Inst. Math. Appl."},{"key":"1493_CR20","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1093\/comjnl\/13.3.317","volume":"13","author":"R Fletcher","year":"1970","unstructured":"Fletcher, R.: A new approach to variable metric algorithms. Comput. J. 13, 317\u2013322 (1970)","journal-title":"Comput. J."},{"key":"1493_CR21","unstructured":"L\u00f6fberg, J.: YALMIP: A toolbox for modeling and optimization in MATLAB. In: Proceedings of the CACSD Conference, Taipei, Taiwan (2004)"},{"key":"1493_CR22","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","volume":"95","author":"RH Tutuncu","year":"2003","unstructured":"Tutuncu, R.H., Toh, K.C., Todd, M.J.: Solving semidefinite-quadratic-linear programs using SDPT3. Math. Program. 95, 189\u2013217 (2003)","journal-title":"Math. Program."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-019-01493-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-019-01493-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-019-01493-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T03:02:00Z","timestamp":1721012520000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-019-01493-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,25]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["1493"],"URL":"https:\/\/doi.org\/10.1007\/s10957-019-01493-z","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2019,2,25]]},"assertion":[{"value":"24 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}