1 |
J. F. Bonnans, J. C. Gilbert, C. Lemarechal, and C. Sagastizabal, Numerical optimization, theoritical and pratical aspects. Springer-Verlag, 2003.
|
2 |
J. P. Crouzeix, B. Merikhi, A logarithm barrier method for semidefinite programming, R.A.I.R.O-Oper. Res. 42 (2008), pp. 123-139.
|
3 |
J. P. Crouzeix, A. Seeger, New bounds for the extreme values of a finite sample of real numbers, Journal of Mathematical Analysis and Applications 197 (1996), pp. 411-426.
DOI
|
4 |
R.M. Freund, S. Mizuno, Interior point methods: Current status and future directions, Mathematical Programming 51, Optima (1996).
|
5 |
A. Leulmi, B. Merikhi, D. Benterki, Study of a Logarithmic Barrier Approach for Linear Semidefinite Programming, Journal of Siberian Federal University. Mathematics & Physics 2018, 11(3), 1-13.
|
6 |
Linda Menniche, Djamel Benterki, A logarithmic barrier approach for linear programming, Journal of Computational and Applied Mathematics 312 (2017) 267-275.
DOI
|
7 |
R. T. Rockafellar, Convex analysis, Princeton University Press, New Jerzy, (1970).
|
8 |
G. Savard, Introduction au methodes de point interieur, Extrait denotes, Departement de Mathematiques et Genie Industriel, Ecole Polytechnique de Montreal, Fevrier, 2001.
|
9 |
H. Wolkowicz, G. P. H. Styan, Bounds for eigenvalues using traces, Linear Algebra and Appl.29 (1980), pp. 471-506.
DOI
|