{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:26:17Z","timestamp":1762507577073},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,11,8]],"date-time":"2018-11-08T00:00:00Z","timestamp":1541635200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Scientific Research at the University of Jordan."}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s10589-018-0045-8","type":"journal-article","created":{"date-parts":[[2018,11,8]],"date-time":"2018-11-08T11:45:40Z","timestamp":1541677540000},"page":"363-390","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A primal-dual interior-point method based on various selections of displacement step for symmetric optimization"],"prefix":"10.1007","volume":"72","author":[{"given":"Baha","family":"Alzalg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,8]]},"reference":[{"key":"45_CR1","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 methods to symmetric cones. Math. Program. Ser. A 96, 409\u2013438 (2003)","journal-title":"Math. Program. Ser. A"},{"issue":"3","key":"45_CR2","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1287\/moor.26.3.543.10582","volume":"26","author":"SH 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":"45_CR3","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. Ser. B 95, 3\u201351 (2003)","journal-title":"Math. Program. Ser. B"},{"key":"45_CR4","doi-asserted-by":"publisher","first-page":"5122","DOI":"10.1016\/j.apm.2011.12.053","volume":"36","author":"B Alzalg","year":"2012","unstructured":"Alzalg, B.: Stochastic second-order cone programming: application models. Appl. Math. Model. 36, 5122\u20135134 (2012)","journal-title":"Appl. Math. Model."},{"key":"45_CR5","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1017\/S0962492901000071","volume":"10","author":"MJ Todd","year":"2001","unstructured":"Todd, M.J.: Semidefinite optimization. ACTA Numer. 10, 515\u2013560 (2001)","journal-title":"ACTA Numer."},{"key":"45_CR6","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L Vandenberghe","year":"1996","unstructured":"Vandenberghe, L., Boyd, S.: Semidefinite programming. SIAM Rev. 38, 49\u201395 (1996)","journal-title":"SIAM Rev."},{"issue":"2","key":"45_CR7","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1137\/S1052623495290209","volume":"8","author":"YE Nesterov","year":"1998","unstructured":"Nesterov, Y.E., Todd, M.J.: Primal-dual interior-point methods for self-scaled cones. SIAM J. Optim. 8(2), 324\u2013364 (1998)","journal-title":"SIAM J. Optim."},{"key":"45_CR8","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1016\/j.jmaa.2013.07.075","volume":"409","author":"B Alzalg","year":"2014","unstructured":"Alzalg, B., Ariyawansa, K.A.: Logarithmic barrier decomposition-based interior point methods for stochastic symmetric programming. J. Math. Anal. Appl. 409, 973\u2013995 (2014)","journal-title":"J. Math. Anal. Appl."},{"issue":"11","key":"45_CR9","first-page":"1603","volume":"99","author":"B Alzalg","year":"2016","unstructured":"Alzalg, B., Maggiono, F., Vitali, S.: Homogeneous self-dual methods for symmetric cones under uncertainty. Far East J. Math. Sci. 99(11), 1603\u20131778 (2016)","journal-title":"Far East J. Math. Sci."},{"key":"45_CR10","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1016\/j.amc.2007.10.014","volume":"199","author":"D Benterki","year":"2008","unstructured":"Benterki, D., Leulmi, A.: An improving procedure of the interior projective method for linear programming. Appl. Math. Comput. 199, 811\u2013819 (2008)","journal-title":"Appl. Math. Comput."},{"key":"45_CR11","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0360-8352(89)90021-1","volume":"16","author":"M Dodani","year":"1989","unstructured":"Dodani, M., Babu, A.: Karmarkar\u2019s projective method for linear programming: a computational appraisal. Comput. Ind. Eng. 16, 189\u2013206 (1989)","journal-title":"Comput. Ind. Eng."},{"key":"45_CR12","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/BF01185339","volume":"9","author":"M Todd","year":"1993","unstructured":"Todd, M., Wang, Y.: On combined phase 1-phase 2 projective methods for linear programming. Algorithmica 9, 64\u201383 (1993)","journal-title":"Algorithmica"},{"key":"45_CR13","doi-asserted-by":"publisher","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."},{"key":"45_CR14","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1023\/B:COAP.0000033964.95511.23","volume":"28","author":"Y-J Hans","year":"2004","unstructured":"Hans, Y.-J., Mittelmann, D.: Interior point methods for second-order cone programming and OR applications. Comput. Optim. Appl. 28, 255\u2013285 (2004)","journal-title":"Comput. Optim. Appl."},{"key":"45_CR15","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10492-012-0019-6","volume":"57","author":"J Tang","year":"2012","unstructured":"Tang, J., He, G., Dong, L., Fang, L.: A new one-step smoothing newton method for second-order cone programming. Appl. Math. 57, 311\u2013331 (2012)","journal-title":"Appl. Math."},{"issue":"1","key":"45_CR16","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/s10957-013-0428-z","volume":"163","author":"B Alzalg","year":"2014","unstructured":"Alzalg, B.: Homogeneous self-dual algorithms for stochastic second-order cone programming. J. Optim. Theory Appl. 163(1), 148\u2013164 (2014)","journal-title":"J. Optim. Theory Appl."},{"key":"45_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.amc.2014.10.015","volume":"249","author":"B Alzalg","year":"2014","unstructured":"Alzalg, B.: Decomposition-based interior point methods for stochastic quadratic second-order cone programming. Appl. Math. Comput. 249, 1\u201318 (2014)","journal-title":"Appl. Math. Comput."},{"key":"45_CR18","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1016\/j.amc.2015.05.014","volume":"256","author":"B Alzalg","year":"2015","unstructured":"Alzalg, B.: Volumetric barrier decomposition algorithms for stochastic quadratic second-order cone programming. Appl. Math. Comput. 256, 494\u2013508 (2015)","journal-title":"Appl. Math. Comput."},{"key":"45_CR19","first-page":"555","volume":"42","author":"S Kettab","year":"2015","unstructured":"Kettab, S., Benterki, D.: A relaxed logarithmic barrier method for semidefinite programming. RAIRO Oper. Res. 42, 555\u2013568 (2015)","journal-title":"RAIRO Oper. Res."},{"key":"45_CR20","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1051\/ro:2008005","volume":"42","author":"JP Crouzeix","year":"2008","unstructured":"Crouzeix, J.P., Merikhi, B.: A logarithm barrier method for semidefinite programming. RAIRO Oper. Res. 42, 123\u2013139 (2008)","journal-title":"RAIRO Oper. Res."},{"key":"45_CR21","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1137\/S1052623495293056","volume":"7","author":"RD Monteiro","year":"1997","unstructured":"Monteiro, R.D.: Primal-dual path-following algorithms for semidefinite programming. SIAM J. Optim. 7, 663\u2013678 (1997)","journal-title":"SIAM J. Optim."},{"key":"45_CR22","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 methods for stochastic semidefinite programming. SIAM J. Optim. 6, 342\u2013361 (1996)","journal-title":"SIAM J. Optim."},{"key":"45_CR23","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.cam.2016.05.008","volume":"312","author":"I Touil","year":"2017","unstructured":"Touil, I., Benterki, D., Yassine, A.: A feasible primal-dual interior point method for linear semidefinite programming. J. Comput. Appl. Math. 312, 216\u2013230 (2017)","journal-title":"J. Comput. Appl. Math."},{"key":"45_CR24","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/j.amc.2007.03.066","volume":"193","author":"Z Kebbiche","year":"2007","unstructured":"Kebbiche, Z., Keraghel, A., Yassine, A.: Extension of a projective interior point method for linearly constrained convex programming. Appl. Math. Comput. 193, 553\u2013559 (2007)","journal-title":"Appl. Math. Comput."},{"key":"45_CR25","first-page":"163","volume":"77","author":"P Gahinet","year":"1997","unstructured":"Gahinet, P., Nemirovski, A.: The projective method for solving linear matrix inequalities. Math. Prog. 77, 163\u2013190 (1997)","journal-title":"Math. Prog."},{"key":"45_CR26","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1007\/s10957-013-0492-4","volume":"162","author":"R Behling","year":"2014","unstructured":"Behling, R., Gonzaga, C., Haeser, G.: Primal-dual relationship between Levenberg\u2013Marquardt and central trajectories for linearly constrained convex optimization. J. Optim. Theory Appl. 162, 705\u2013717 (2014)","journal-title":"J. Optim. Theory Appl."},{"key":"45_CR27","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s12532-012-0050-3","volume":"5","author":"N Gould","year":"2013","unstructured":"Gould, N., Orban, D., Robinson, D.: Trajectory-following methods for large-scale degenerate convex quadratic programming. Math. Prog. Comput. 5, 113\u2013142 (2013)","journal-title":"Math. Prog. Comput."},{"key":"45_CR28","unstructured":"MOSEK is an optimization software designed to solve large-scale mathematical optimization problems. http:\/\/www.mosek.com\/ . Accessed 5 Oct 2017"},{"key":"45_CR29","unstructured":"Toh, K.C., Todd, M.J., Tutuncu, R.H.: SDPT3 version 4.0\u2013a MATLAB software for semidefinite-quadratic-linear programming, (2009). Available online at: http:\/\/www.math.nus.edu.sg\/~mattohkc\/sdpt3.html"},{"key":"45_CR30","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/0024-3795(80)90258-X","volume":"29","author":"H Wolkowicz","year":"1980","unstructured":"Wolkowicz, H., Styan, G.-P.-H.: Bounds for eigenvalues using traces. Linear Algebra Appl. 29, 471\u2013506 (1980)","journal-title":"Linear Algebra Appl."},{"key":"45_CR31","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. Oxford University Press, Oxford (1994)"},{"issue":"9","key":"45_CR32","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1137\/S1052623494269035","volume":"7","author":"M Kojima","year":"1997","unstructured":"Kojima, M., Shindoh, S., Hara, S.: Interior-point methods for the monotone linear complementarity problem in symmetric matrices. SIAM J. Optim. 7(9), 86\u2013125 (1997)","journal-title":"SIAM J. Optim."},{"key":"45_CR33","volume-title":"Handbook of Matrices","author":"H L\u00fctkepohl","year":"1996","unstructured":"L\u00fctkepohl, H.: Handbook of Matrices. Humboldt-Universit\u00e4t zu Berlin, Germany (1996)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-018-0045-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0045-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0045-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T05:31:07Z","timestamp":1720762267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-018-0045-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,8]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["45"],"URL":"https:\/\/doi.org\/10.1007\/s10589-018-0045-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,8]]},"assertion":[{"value":"12 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}