{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,25]],"date-time":"2024-12-25T12:10:15Z","timestamp":1735128615303,"version":"3.32.0"},"reference-count":26,"publisher":"EDP Sciences","issue":"6","license":[{"start":{"date-parts":[[2024,12,24]],"date-time":"2024-12-24T00:00:00Z","timestamp":1734998400000},"content-version":"vor","delay-in-days":53,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2024,11,20]]},"published-print":{"date-parts":[[2024,11]]},"abstract":"<jats:p>The growing importance of the monotone linear complementarity problems (LCP) lies in the different applications it covers, both in mathematics and in practice. In this paper, based on the optimization techniques, we propose a descent logarithmic barrier interior-point method for solving the (LCP). The idea is to transform the LCP into an equivalent convex quadratic optimization problem, denoted by (CQO). Then, the associated barrier problem to CQO is formulated. The existence and the uniqueness of optimal solution of the barrier problem is showed. For its numerical aspects, the descent direction is computed by using the classical Newton\u2019s method. However, to determine the displacement step along this direction, guaranteeing the maintenance of the new iterates inside the domain during the algorithm process and the improvement of the value of the objective function, we apply a new approach using approximation functions known as \u201cminorant and majorant approximating functions\u201d. The numerical results obtained are very promising and show the effectiveness of this new strategy.<\/jats:p>","DOI":"10.1051\/ro\/2024216","type":"journal-article","created":{"date-parts":[[2024,11,25]],"date-time":"2024-11-25T19:53:22Z","timestamp":1732564402000},"page":"5537-5550","source":"Crossref","is-referenced-by-count":0,"title":["A Newton descent logarithmic barrier interior-point algorithm for monotone LCP"],"prefix":"10.1051","volume":"58","author":[{"given":"Welid","family":"Grimes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Achache","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adnan","family":"Yassine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2024,12,24]]},"reference":[{"key":"R1","first-page":"61","volume":"49","author":"Achache","year":"2004","journal-title":"Studia Univ. Babe\u00b8s-Bolyai. Ser. Inf."},{"key":"R2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1590\/S0101-82052006000100005","volume":"25","author":"Achache","year":"2006","journal-title":"Comput. Appl. Math."},{"key":"R3","first-page":"1889","volume":"216","author":"Achache","year":"2010","journal-title":"Appl. Math. Comput."},{"key":"R4","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1007\/s11590-018-1328-9","volume":"13","author":"Achache","year":"2018","journal-title":"Optim. Lett."},{"key":"R5","first-page":"1472","volume":"186","author":"Achache","year":"2007","journal-title":"Appl. Math Comput."},{"key":"R6","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1007\/s11590-019-01404-1","volume":"14","author":"Alzalg","year":"2020","journal-title":"Optim. Lett."},{"key":"R7","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1051\/ro:2007006","volume":"41","author":"Benterki","year":"2007","journal-title":"RAIRO-Oper. Res."},{"key":"R8","doi-asserted-by":"crossref","first-page":"1599","DOI":"10.1051\/ro\/2023094","volume":"57","author":"Bouafia","year":"2023","journal-title":"RAIRO-Oper. Res."},{"key":"R9","first-page":"29","volume":"51","author":"Chaghoub","year":"2021","journal-title":"Int. J. Appl. Math."},{"key":"R10","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1051\/ro\/2018061","volume":"53","author":"Cherif","year":"2019","journal-title":"RAIRO-Oper. Res."},{"key":"R11","unstructured":"Chouzenoux E., Moussaoui S. and Idier J., A majorize-minimize line search algorithm for barrier function optimization, in EURASIP European Signal and Image Processing Conference. IEEE, Glasgow, United Kingdom (2009) 1379\u20131383."},{"key":"R12","unstructured":"Cottle R.W., Pang J.S. and Stone R.E., The Linear Complementarity Problem. Academic, San Diego (1992)."},{"key":"R13","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1051\/ro:2008005","volume":"142","author":"Crouzeix","year":"2008","journal-title":"RAIRO-Oper. Res."},{"key":"R14","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1006\/jmaa.1996.0029","volume":"197","author":"Crouzeix","year":"1996","journal-title":"J. Math. Anal. Appl."},{"key":"R15","first-page":"51","volume":"5","author":"Darvay","year":"2003","journal-title":"Adv. Model. Optim."},{"key":"R16","doi-asserted-by":"crossref","first-page":"2250170","DOI":"10.1142\/S1793557122501704","volume":"15","author":"Grimes","year":"2022","journal-title":"Asian-Eur. J. Math."},{"key":"R17","first-page":"53","volume":"4","author":"Grimes","year":"2021","journal-title":"Int. J. Inf. Appl. Math."},{"key":"R18","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1051\/ro\/2023054","volume":"57","author":"Grimes","year":"2023","journal-title":"RAIRO-Oper. Res."},{"key":"R19","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s11590-018-1241-2","volume":"13","author":"Haddou","year":"2019","journal-title":"Optim. Lett."},{"key":"R20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01587074","volume":"44","author":"Kojima","year":"1989","journal-title":"Math. Program."},{"key":"R21","doi-asserted-by":"crossref","unstructured":"Kojima M., Megiddo N., Mizuno S. and Yoshise A., A unified approach to interior point algorithms for linear complementarity problems, in: Lecture Notes in Computer Science. Vol. 538. Springe-Verlag, Berlin, Germany (1991).","DOI":"10.1007\/3-540-54509-3"},{"key":"R22","doi-asserted-by":"crossref","first-page":"300","DOI":"10.17516\/1997-1397-2018-11-3-300-312","volume":"11","author":"Leulmi","year":"2018","journal-title":"J. Siberian Federal Univ. Math. Phys."},{"key":"R23","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/j.cam.2016.05.025","volume":"312","author":"Menniche","year":"2017","journal-title":"J. Comput. Appl. Math."},{"key":"R24","doi-asserted-by":"crossref","unstructured":"Peypouquet J., Convex Optimization in Normed Spaces, Theory, Methods and Examples. Springer, (2015).","DOI":"10.1007\/978-3-319-13710-0"},{"key":"R25","doi-asserted-by":"crossref","unstructured":"Wright S.J., Primal-Dual Interior Point Methods. SIAM, University City (1997).","DOI":"10.1137\/1.9781611971453"},{"key":"R26","first-page":"119","volume":"3","author":"Yassine","year":"2008","journal-title":"Studia Univ. Babe\u00b8s-Bolyai. Ser. Inf."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2024216\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,24]],"date-time":"2024-12-24T09:00:34Z","timestamp":1735030834000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2024216"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11]]},"references-count":26,"journal-issue":{"issue":"6"},"alternative-id":["ro230777"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2024216","relation":{},"ISSN":["0399-0559","2804-7303"],"issn-type":[{"type":"print","value":"0399-0559"},{"type":"electronic","value":"2804-7303"}],"subject":[],"published":{"date-parts":[[2024,11]]}}}