Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Mohamed Achache"'
Autor:
Nassima Anane, Mohamed Achache
Publikováno v:
Journal of Numerical Analysis and Approximation Theory, Vol 49, Iss 1 (2020)
We investigate the NP-hard absolute value equations (AVE), \(Ax-B|x| =b\), where \(A,B\) are given symmetric matrices in \(\mathbb{R}^{n\times n}, \ b\in \mathbb{R}^{n}\). By reformulating the AVE as an equivalent unconstrained convex quadratic optim
Externí odkaz:
https://doaj.org/article/dceb5a350c42422983f52c2d7d869a56
Autor:
Mohamed Achache, Nersine Tabchouch
Publikováno v:
Croatian Operational Research Review, Vol 9, Iss 1, Pp 37-50 (2018)
In this paper, a feasible primal-dual path-following interior-point algorithm for monotone semidefinite linear complementarity problems is proposed. At each iteration, the algorithm uses only full Nesterov-Todd feasible steps for tracing approximatel
Externí odkaz:
https://doaj.org/article/c4cf022d4ca245df9a508350be7bdc55
Autor:
Rachid Zitouni, Mohamed Achache
Publikováno v:
Journal of Numerical Analysis and Approximation Theory, Vol 46, Iss 2 (2017)
In this paper, we deal with a numerical comparison between two exact simplicial methods for solving a capacitated four-index transportation problem. The first method was developed by R. Zitouni and A. Keraghel for solving this problem [Resolution of
Externí odkaz:
https://doaj.org/article/80d997d07cc748eebcf81c799085c5b9
Autor:
Mohamed Achache, Naima Boudiaf
Publikováno v:
Journal of Numerical Analysis and Approximation Theory, Vol 40, Iss 2 (2011)
In this paper a primal-dual path-following interior-point algorithm for the monotone semidefinite linear complementarity problem is presented. The algorithm is based on Nesterov-Todd search directions and on a suitable proximity for tracing approxima
Externí odkaz:
https://doaj.org/article/df9ea802905543579de72a2fc2c8bbd3
Publikováno v:
Journal of Numerical Analysis and Approximation Theory, Vol 38, Iss 2 (2009)
Dans cet article on présente une synthèse sur les principaux travaux liés au problème de complémentarité linéaire semi-défini. La présentation est donnée de façon à rendre le bagage utilisé pour ce problème comprehensible et permettant
Externí odkaz:
https://doaj.org/article/39097971f674426587759c8ca083d825
Autor:
Welid Grimes, Mohamed Achache
Publikováno v:
RAIRO - Operations Research. 57:1059-1073
In this paper, we propose a short-step feasible full-Newton step path-following interior-point algorithm (IPA) for monotone linear complementarity problems (LCPs). The proposed IPA uses the technique of algebraic equivalent transformation (AET) induc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d99fd04aab12be8243ca89a399816770
https://doi.org/10.1051/ro/2023054
https://doi.org/10.1051/ro/2023054
Autor:
Nouha Moussaoui, Mohamed Achache
Publikováno v:
Statistics, Optimization & Information Computing. 10:873-889
Getting a perfectly centered initial point for feasible path-following interior-point algorithms is a hard practical task. Therefore, it is worth to analyze other cases when the starting point is not necessarily centered. In this paper, we propose a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::45fa2aa73dcc79f68b2c0dafa9f3b9a4
https://doi.org/10.19139/soic-2310-5070-1385
https://doi.org/10.19139/soic-2310-5070-1385
Autor:
Mohamed Choukairi, Dounia Bouchta, Loubna Bounab, Elisa González‐Romero, Mohamed Achache, Khalid Draoui, Faiza Chaouket, Ihssane Raissouni, Mouad Gharous
Publikováno v:
ChemistryOpen. 12
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::969a84545fcf32ffdf9c792843d00ad7
https://doi.org/10.1002/open.202200201
https://doi.org/10.1002/open.202200201
Autor:
Chafia Daili, Mohamed Achache
Publikováno v:
Applications of Mathematics. 67:371-391
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9181933f006660756f9a24ca972baf9e
https://doi.org/10.21136/am.2021.0217-20
https://doi.org/10.21136/am.2021.0217-20
Autor:
Mohamed Achache, Nesrine Tabchouche
Publikováno v:
Optimization Letters. 13:1039-1057
In this paper, we present a full-Newton feasible step interior-point algorithm for solving monotone horizontal linear complementarity problems. In each iteration the algorithm performs only full-Newton step with the advantage that no line search is r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb0b8da458d3eabcbdf77ea2ab5df803
https://doi.org/10.1007/s11590-018-1328-9
https://doi.org/10.1007/s11590-018-1328-9