A numerical feasible interior point method for linear semidefinite programs
RAIRO-Oper. Res., 41 1 (2007) 49-59
Published online: 2007-06-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
A Newton descent logarithmic barrier interior-point algorithm for monotone LCP
Welid Grimes, Mohamed Achache and Adnan YassineRAIRO - Operations Research 58 (6) 5537 (2024)
https://doi.org/10.1051/ro/2024216
Distance to a constitutive tensor isotropy stratum by the Lasserre polynomial optimization method
Perla Azzi, Rodrigue Desmorat, Boris Kolev and Fabien PriziacMathematics and Mechanics of Complex Systems 11 (3) 393 (2023)
https://doi.org/10.2140/memocs.2023.11.393
Logarithmic Barrier Method Via Minorant Function for Linear Semidefinite Programming
Assma LeulmiAnnales Mathematicae Silesianae 37 (1) 95 (2023)
https://doi.org/10.2478/amsil-2022-0021
An Efficient Logarithmic Barrier Method without Line Search for Convex Quadratic Programming
S. Chaghoub and D. BenterkiNumerical Analysis and Applications 15 (2) 156 (2022)
https://doi.org/10.1134/S1995423922020070
A logarithmic barrier interior-point method based on majorant functions for second-order cone programming
Baha AlzalgOptimization Letters 14 (3) 729 (2020)
https://doi.org/10.1007/s11590-019-01404-1
Comparative numerical study between line search methods and majorant functions in barrier logarithmic methods for linear programming
Soraya Chaghoub and Djamel BenterkiJournal of Numerical Analysis and Approximation Theory 49 (1) 15 (2020)
https://doi.org/10.33993/jnaat491-1199
A logarithmic barrier approach for linear programming
Linda Menniche and Djamel BenterkiJournal of Computational and Applied Mathematics 312 267 (2017)
https://doi.org/10.1016/j.cam.2016.05.025
A feasible primal–dual interior point method for linear semidefinite programming
Imene Touil, Djamel Benterki and Adnan YassineJournal of Computational and Applied Mathematics 312 216 (2017)
https://doi.org/10.1016/j.cam.2016.05.008
Finding a strict feasible solution of a linear semidefinite program
Djamel Benterki and Abdelkrim KeraghelApplied Mathematics and Computation 217 (13) 6437 (2011)
https://doi.org/10.1016/j.amc.2010.12.083