{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:35:03Z","timestamp":1759847703065,"version":"3.37.3"},"reference-count":51,"publisher":"Informa UK Limited","issue":"1","funder":[{"DOI":"10.13039\/501100003967","name":"Iran's National Elites Foundation","doi-asserted-by":"publisher","award":["15\/2080"],"award-info":[{"award-number":["15\/2080"]}],"id":[{"id":"10.13039\/501100003967","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002398","name":"Sharif University of Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002398","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010743","name":"University of Applied Sciences and Arts, Northwestern Switzerland","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100010743","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006595","name":"Romanian Ministry of Research and Innovation, CNCS - UEFISCDI","doi-asserted-by":"publisher","award":["PN-III-P4-ID-PCE-2016-0190"],"award-info":[{"award-number":["PN-III-P4-ID-PCE-2016-0190"]}],"id":[{"id":"10.13039\/501100006595","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003549","name":"Hungarian Research Fund, OTKA","doi-asserted-by":"publisher","award":["NKFIH 125700"],"award-info":[{"award-number":["NKFIH 125700"]}],"id":[{"id":"10.13039\/501100003549","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2022,1,2]]},"DOI":"10.1080\/10556788.2020.1734803","type":"journal-article","created":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T11:02:17Z","timestamp":1583751737000},"page":"192-213","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":4,"title":["Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function"],"prefix":"10.1080","volume":"37","author":[{"given":"S.","family":"Asadi","sequence":"first","affiliation":[{"name":"Faculty of Mathematical Sciences, Sharif University of Technology, Tehran, Iran"},{"name":"Institute for Data Science, School of Engineering, University of Applied Sciences and Arts Northwestern Switzerland, Windisch, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Mahdavi-Amiri","sequence":"additional","affiliation":[{"name":"Faculty of Mathematical Sciences, Sharif University of Technology, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1094-9837","authenticated-orcid":false,"given":"Zs.","family":"Darvay","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics and Computer Science, Babes-Bolyai University, Cluj-Napoca, Romania"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. R.","family":"Rig\u00f3","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics and Computer Science, Babes-Bolyai University, Cluj-Napoca, Romania"},{"name":"Department of Differential Equations, Budapest University of Technology and Economics, Budapest, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2020,3,9]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1590\/S0101-82052006000100005"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-012-9628-0"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2015.1058795"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-015-0113-z"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1007\/s12190-014-0856-4"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2016.1267732"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1080\/01630563.2016.1232731"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2018.1512604"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-018-1402-6"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623403423114"},{"key":"CIT0011","first-page":"51","volume":"5","author":"Darvay Zs.","year":"2003","journal-title":"Adv. Model Optim."},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1080\/01630563.2018.1492938"},{"key":"CIT0013","unstructured":"Zs. Darvay, \u00c1. Felm\u00e9ri, N. Forr\u00f3, I.M. Papp and P.R. Tak\u00e1cs,A new interior-point algorithm for solving linear optimization problems, inXVII. FMTU, E. Bitay, ed., Transylvanian Museum Society, Cluj-Napoca, 2012, pp. 87\u201390 (In Hungarian)."},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1007\/s10998-016-0119-2"},{"key":"CIT0015","unstructured":"Zs. Darvay, T. Ill\u00e9s and Cs. Majoros,Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation, Operations Research Report, ORR 2018-02, E\u00f6tv\u00f6s Lor\u00e1nd University of Sciences, Budapest, Hungary, 2018."},{"key":"CIT0016","unstructured":"Zs. Darvay, T. Ill\u00e9s, J. Povh and P.R. Rig\u00f3,Predictor-corrector interior-point algorithm for sufficient linear complementarity problems based on a new search direction, Operations Research Report, ORR 2018-03, E\u00f6tv\u00f6s Lor\u00e1nd University of Sciences, Budapest, Hungary, 2018."},{"key":"CIT0017","doi-asserted-by":"crossref","unstructured":"J. Faraut and A. Kor\u00e1nyi,Analysis on symmetric cones, Oxford Mathematical Monographs. The Clarendon Press Oxford University Press, New York, Oxford Science Publications, 1994.","DOI":"10.1093\/oso\/9780198534778.003.0001"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-0427(97)00153-2"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1007\/s002090100286"},{"key":"CIT0020","unstructured":"G. Gu,Full-step interior-point methods for symmetric optimization, Ph.D. thesis, The Netherlands, Delf University of Technology, 2009."},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1287\/moor.21.4.860"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00061-9"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-008-9348-0"},{"key":"CIT0024","doi-asserted-by":"publisher","DOI":"10.1080\/02331939408843952"},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579150"},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.1007\/BF01587074"},{"key":"CIT0027","doi-asserted-by":"crossref","unstructured":"M. Kojima, N. Megiddo, T. Noma and A. Yoshise,A unified approach to interior point algorithms for linear complementarity problems, Lecture Notes in Comput. Sci. 538, Springer-Verlag, New York, 1991.","DOI":"10.1007\/3-540-54509-3"},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-011-9848-9"},{"key":"CIT0029","first-page":"2994","volume":"21","author":"Lesaja G.","year":"2011","journal-title":"SIAM J. Optim."},{"key":"CIT0030","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2012.670858"},{"key":"CIT0031","doi-asserted-by":"publisher","DOI":"10.1137\/050623723"},{"key":"CIT0032","doi-asserted-by":"publisher","DOI":"10.1080\/10556780008805800"},{"key":"CIT0033","doi-asserted-by":"publisher","DOI":"10.1137\/0802022"},{"key":"CIT0034","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-012-0195-2"},{"key":"CIT0035","doi-asserted-by":"publisher","DOI":"10.1137\/0802028"},{"key":"CIT0036","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2015.1062011"},{"key":"CIT0037","doi-asserted-by":"publisher","DOI":"10.1287\/moor.22.1.1"},{"key":"CIT0038","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623495290209"},{"key":"CIT0039","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmaa.2005.04.028"},{"volume-title":"Self-Regularity, A New Paradigm for Primal-Dual Interior-Point Algorithms","year":"2002","author":"Peng J.","key":"CIT0040"},{"key":"CIT0041","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-018-0012-4"},{"key":"CIT0042","doi-asserted-by":"publisher","DOI":"10.1137\/050623917"},{"volume-title":"Theory and Algorithms for Linear Optimization","year":"2005","author":"Roos C.","key":"CIT0043"},{"key":"CIT0044","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0380-z"},{"key":"CIT0045","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(00)00096-3"},{"key":"CIT0046","unstructured":"M.V.C. Vieira,Jordan algebraic approach to symmetric optimization, Ph.D. thesis, The Netherlands, Delf University of Technology, 2007."},{"key":"CIT0047","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-012-0013-x"},{"key":"CIT0048","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2013.06.064"},{"key":"CIT0049","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971453"},{"key":"CIT0050","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032701"},{"key":"CIT0051","doi-asserted-by":"publisher","DOI":"10.1287\/moor.19.1.53"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2020.1734803","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T21:07:00Z","timestamp":1722546420000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2020.1734803"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,9]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1,2]]}},"alternative-id":["10.1080\/10556788.2020.1734803"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2020.1734803","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"type":"print","value":"1055-6788"},{"type":"electronic","value":"1029-4937"}],"subject":[],"published":{"date-parts":[[2020,3,9]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2019-04-22","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-02-12","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-03-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}