{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,2]],"date-time":"2024-04-02T21:40:49Z","timestamp":1712094049815},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T00:00:00Z","timestamp":1294444800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s10957-010-9777-z","type":"journal-article","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T17:06:11Z","timestamp":1294419971000},"page":"102-137","source":"Crossref","is-referenced-by-count":4,"title":["The Q Method for Symmetric Cone Programming"],"prefix":"10.1007","volume":"149","author":[{"given":"Farid","family":"Alizadeh","sequence":"first","affiliation":[]},{"given":"Yu","family":"Xia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"9777_CR1","volume-title":"Proc. 5th SIAM Conference on Appl. Linear Algebra","author":"F. Alizadeh","year":"1994","unstructured":"Alizadeh, F., Haeberly, J.P., Overton, M.L.: A new primal-dual interior point method for semidefinite programming. In: Proc. 5th SIAM Conference on Appl. Linear Algebra, Snowbird, Utah (1994)"},{"issue":"3","key":"9777_CR2","doi-asserted-by":"crossref","first-page":"746","DOI":"10.1137\/S1052623496304700","volume":"8","author":"F. Alizadeh","year":"1998","unstructured":"Alizadeh, F., Haeberly, J.-P.A., Overton, M.L.: Primal-dual interior-point methods for semidefinite programming: convergence rates, stability and numerical results. SIAM J. Optim. 8(3), 746\u2013768 (1998)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"9777_CR3","doi-asserted-by":"crossref","first-page":"1510","DOI":"10.1016\/j.cor.2006.08.009","volume":"35","author":"Y. Xia","year":"2008","unstructured":"Xia, Y., Alizadeh, F.: The q method for second order cone programming. Comput. Oper. Res. 35(5), 1510\u20131538 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"1\u20134","key":"9777_CR4","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11\/12","author":"J.F. Sturm","year":"1999","unstructured":"Sturm, J.F.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11\/12(1\u20134), 625\u2013653 (1999). Interior point methods","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"9777_CR5","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10589-007-9023-2","volume":"37","author":"Y. Xia","year":"2007","unstructured":"Xia, Y.: A Newton\u2019s method for perturbed second-order cone programs. Comput. Optim. Appl. 37(3), 371\u2013408 (2007)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"9777_CR6","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"F. Alizadeh","year":"1995","unstructured":"Alizadeh, F.: Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optim. 5(1), 13\u201351 (1995)","journal-title":"SIAM J. Optim."},{"key":"9777_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-9617-8","volume-title":"Progress in Mathematical Programming","author":"N. Megiddo","year":"1989","unstructured":"Megiddo, N.: Pathways to the optimal set in linear programming. In: Megiddo, N. (ed.) Progress in Mathematical Programming. Springer, Berlin (1989)"},{"key":"9777_CR8","volume-title":"Progress in Mathematical Programming","author":"M. Kojima","year":"1989","unstructured":"Kojima, M., Mizuno, S., Yoshise, A.: A primal-dual interior-point algorithm for linear programming. In: Megiddo, N. (ed.) Progress in Mathematical Programming, Berlin. Springer, Berlin (1989)"},{"key":"9777_CR9","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01587075","volume":"44","author":"R.D.C. Monteiro","year":"1989","unstructured":"Monteiro, R.D.C., Adler, I.: Interior path following primal-dual algorithms. Part I: Linear programming. Math. Program. 44, 27\u201341 (1989)","journal-title":"Math. Program."},{"key":"9777_CR10","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1137\/S1052623495293056","volume":"7","author":"R.D.C. Monteiro","year":"1997","unstructured":"Monteiro, R.D.C.: Primal-dual path-following algorithms for semidefinite programming. SIAM J. Optim. 7, 663\u2013678 (1997)","journal-title":"SIAM J. Optim."},{"key":"9777_CR11","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1137\/S1052623495296115","volume":"8","author":"Y. Zhang","year":"1998","unstructured":"Zhang, Y.: On extending primal-dual interior-point algorithms from linear programming to semidefinite programming. SIAM J. Optim. 8, 356\u2013386 (1998)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9777_CR12","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1137\/S105262349731950X","volume":"10","author":"M. Gu","year":"2000","unstructured":"Gu, M.: Primal-dual interior-point methods for semidefinite programming in finite precision. SIAM J. Optim. 10(2), 462\u2013502 (2000)","journal-title":"SIAM J. Optim."},{"key":"9777_CR13","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1287\/moor.21.4.860","volume":"21","author":"O. G\u00fcler","year":"1996","unstructured":"G\u00fcler, O.: Barrier functions in interior point methods. Math. Oper. Res. 21, 860\u2013885 (1996)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"9777_CR14","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1023\/A:1009701824047","volume":"1","author":"L. Faybusovich","year":"1997","unstructured":"Faybusovich, L.: Euclidean Jordan algebras and interior-point algorithms. Positivity 1(4), 331\u2013357 (1997)","journal-title":"Positivity"},{"issue":"1","key":"9777_CR15","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0377-0427(97)00153-2","volume":"86","author":"L. Faybusovich","year":"1997","unstructured":"Faybusovich, L.: Linear systems in Jordan algebras and primal-dual interior-point algorithms. J. Comput. Appl. Math. 86(1), 149\u2013175 (1997). Special issue dedicated to William B. Gragg (Monterey, CA, 1996)","journal-title":"J. Comput. Appl. Math."},{"issue":"3","key":"9777_CR16","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1287\/moor.26.3.543.10582","volume":"26","author":"S.H. Schmieta","year":"2001","unstructured":"Schmieta, S.H., Alizadeh, F.: Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones. Math. Oper. Res. 26(3), 543\u2013564 (2001)","journal-title":"Math. Oper. Res."},{"key":"9777_CR17","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s10107-003-0380-z","volume":"96","author":"S.H. Schmieta","year":"2003","unstructured":"Schmieta, S.H., Alizadeh, F.: Extension of commutative class of primal-dual interior point algorithms to symmetric cones. Math. Program. 96, 409\u2013438 (2003)","journal-title":"Math. Program."},{"key":"9777_CR18","unstructured":"Schmieta, S.H.: Application of Jordan algebras to the design and analysis of interior-point algorithms for linear, quadratically constrained quadratic, and semi-definite programming. PhD thesis, Rutgers Center for Operations Research, Rutgers University (1999)"},{"key":"9777_CR19","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198534778.001.0001","volume-title":"Analysis on Symmetric Cones","author":"J. Faraut","year":"1994","unstructured":"Faraut, J., Kor\u00e1nyi, A.: Analysis on Symmetric Cones. Clarendon\/Oxford University Press, New York (1994). Oxford Science Publications"},{"key":"9777_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0096285","volume-title":"The Minnesota Notes on Jordan Algebras and Their Applications","author":"M. Koecher","year":"1999","unstructured":"Koecher, M.: The Minnesota Notes on Jordan Algebras and Their Applications. Springer, Berlin (1999). Edited by Kreig, A. and Walcher, S. based on Lectures given in The University of Minnesota, 1960"},{"key":"9777_CR21","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/978-1-4615-4381-7_8","volume-title":"Handbook of Semidefinite Programming, Theory, Algorithms and Applications","author":"F. Alizadeh","year":"2000","unstructured":"Alizadeh, F., Schmieta, S.H.: Symmetric cones, potential reduction methods and word-by-word extensions. In: Saigal, R., Vandenberghe, L., Wolkowicz, H. (eds.) Handbook of Semidefinite Programming, Theory, Algorithms and Applications, pp. 195\u2013233. Kluwer Academic, Norwell (2000)"},{"key":"9777_CR22","author":"F. Alizadeh","year":"2002","unstructured":"Alizadeh, F., Goldfarb, D.: Second-order cone programming. Math. Program. Ser. B (2002). doi: 10.1007\/s10107-002-0339-5","journal-title":"Math. Program. Ser. B"},{"key":"9777_CR23","volume-title":"Topics in Matrix Analysis","author":"R. Horn","year":"1990","unstructured":"Horn, R., Johnson, C.: Topics in Matrix Analysis. Cambridge University Press, Cambridge (1990)"},{"key":"9777_CR24","series-title":"Colloqium Publications","doi-asserted-by":"crossref","DOI":"10.1090\/coll\/039","volume-title":"Structure and Representation of Jordan Algebras","author":"N. Jacobson","year":"1968","unstructured":"Jacobson, N.: Structure and Representation of Jordan Algebras. Colloqium Publications, vol.\u00a0XXXIX. American Mathematical Society, Providence (1968)"},{"issue":"3","key":"9777_CR25","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10589-007-9023-2","volume":"37","author":"Y. Xia","year":"2007","unstructured":"Xia, Y.: A Newton\u2019s method for perturbed second-order cone programs. Comput. Optim. Appl. 37(3), 371\u2013408 (2007)","journal-title":"Comput. Optim. Appl."},{"key":"9777_CR26","volume-title":"Optimization and Nonsmooth Analysis","author":"F.H. Clarke","year":"1983","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley, New York (1983). A Wiley-Interscience Publication"},{"key":"9777_CR27","volume-title":"Numerical Methods for Unconstrained Optimization and Nonlinear Equations","author":"J.E. Dennis Jr.","year":"1983","unstructured":"Dennis, J.E. Jr., Schnabel, R.B.: Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice-Hall, Englewood Cliffs (1983)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-010-9777-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-010-9777-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-010-9777-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,2]],"date-time":"2024-04-02T21:04:09Z","timestamp":1712091849000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-010-9777-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,8]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["9777"],"URL":"https:\/\/doi.org\/10.1007\/s10957-010-9777-z","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,8]]}}}