Logarithmic barrier method via minorant function for linear semidefinite programming

Assma Leulmi

Published: 2023-02-07

Vol. 37 No. 1 (2023)

Logarithmic barrier method via minorant function for linear semidefinite programming

Assma Leulmi

Abstract

We propose in this study, a new logarithmic barrier approach to solve linear semidefinite programming problem. We are interested in computation of the direction by Newton’s method and of the displacement step using minorant functions instead of line search methods in order to reduce the computation cost.
Our new approach is even more beneficial than classical line search methods. This purpose is confirmed by some numerical simulations showing the effectiveness of the algorithm developed in this work, which are presented in the last section of this paper.

Keywords:

linear semidefinite programming , barrier methods , line search

Download files

PDF

Citation rules

Leulmi, A. (2023). Logarithmic barrier method via minorant function for linear semidefinite programming. Annales Mathematicae Silesianae, 37(1), 95–116. Retrieved from https://journals.us.edu.pl/index.php/AMSIL/article/view/15207

Similar Articles

Andrzej Sładek, Linear dependence of powers of linear forms , Annales Mathematicae Silesianae: Vol. 29 (2015)
Władysław Kierat, On a certain extensions of linear spaces with an algebraic derivation , Annales Mathematicae Silesianae: Vol. 1 (1985)
Ali Khalouta, Abdelouahab Kadem, Numerical comparison of FNVIM and FNHPM for solving a certain type of nonlinear Caputo time-fractional partial differential equations , Annales Mathematicae Silesianae: Vol. 34 No. 2 (2020)
Andrzej Nowak, Random fixed points of multifunctions in games and dynamic programming , Annales Mathematicae Silesianae: Vol. 2 (1986)
José Paulo Lampreia, Ricardo José Mendes Severino, José Rodrigues Santos de Sousa Ramos, Renormalization on iterated cubic maps , Annales Mathematicae Silesianae: Vol. 13 (1999)
Jan Ligęza, On a two point boundary value problem for linear differential equations of the fourth order in the colombeau algebra , Annales Mathematicae Silesianae: Vol. 15 (2001)
Małgorzata Filipczak, Grażyna Horbaczewska, Some kinds of sparseness on the real line and ideals on ω , Annales Mathematicae Silesianae: Vol. 34 No. 1 (2020)
Anna Cichocka, The expansion of some distributions into the Wiener series , Annales Mathematicae Silesianae: Vol. 14 (2000)
Hoger Ghahramani, Saman Sattari, Left derivable maps at non-trivial idempotents on nest algebras , Annales Mathematicae Silesianae: Vol. 33 (2019)
Irena Rachůnková, Topological degree methods in BVPS with nonlinear conditions , Annales Mathematicae Silesianae: Vol. 10 (1996)

1 2 3 4 5 6 > >>

You may also start an advanced similarity search for this article.

References

F. Alizadeh, J.-P.A. Haeberly, and M.L. Overton, Primal-dual interior-point methods for semidefinite programming: convergence rates, stability and numerical results, SIAM J. Optim. 8 (1998), no. 3, 746–768.
Google Scholar

D. Benterki, J.-P. Crouzeix, and B. Merikhi, A numerical implementation of an interior point method for semidefinite programming, Pesqui. Oper. 23 (2003), no. 1, 49–59.
Google Scholar

D. Benterki, J.-P. Crouzeix, and B. Merikhi, A numerical feasible interior point method for linear semidefinite programs, RAIRO Oper. Res. 41 (2007), no. 1, 49–59.
Google Scholar

J.-P. Crouzeix and B. Merikhi, A logarithm barrier method for semi-definite programming, RAIRO Oper. Res. 42 (2008), no. 2, 123–139.
Google Scholar

J.-P. Crouzeix and A. Seeger, New bounds for the extreme values of a finite sample of real numbers, J. Math. Anal. Appl. 197 (1996), no. 2, 411–426.
Google Scholar

J. Ji, F.A. Potra, and R. Sheng, On the local convergence of a predictor-corrector method for semidefinite programming, SIAM J. Optim. 10 (1999), no. 1, 195–210.
Google Scholar

B. Merikhi, Extension de Quelques Méthodes de Points Intérieurs pour la Programmation Semi-Définie, Thèse de Doctorat, Département de Mathématiques, Université Ferhat Abbas, Sétif, 2006.
Google Scholar

R.D.C. Monteiro, Primal-dual path-following algorithms for semidefinite programming, SIAM J. Optim. 7 (1997), no. 3, 663–678.
Google Scholar

Y.E. Nesterov and A.S. Nemirovskii, Optimization Over Positive Semidefinite Matrices: Mathematical Background and User’s Manual, Technical report, Central Economic & Mathematical Institute, USSR Academy of Science, Moscow, 1990.
Google Scholar

R.T. Rockafellar, Convex Analysis, Princeton University Press, Princeton, N.J., 1970.
Google Scholar

K. Samia and D. Benterki, A relaxed logarithmic barrier method for semidefinite programming, RAIRO Oper. Res. 49 (2015), no. 3, 555–568.
Google Scholar

K.-C. Toh, Some new search directions for primal-dual interior point methods in semidefinite programming, SIAM J. Optim. 11 (2000), no. 1, 223–242.
Google Scholar

I. Touil, D. Benterki, and A. Yassine, A feasible primal-dual interior point method for linear semidefinite programming, J. Comput. Appl. Math. 312 (2017), 216–230.
Google Scholar

H. Wolkowicz and G.P.H. Styan, Bounds for eigenvalues using traces, Linear Algebra Appl. 29 (1980), 471–506.
Google Scholar

Vol. 37 No. 1 (2023)
Published: 2023-03-03

ISSN: 0860-2107

eISSN: 2391-4238

10.1515/amsil

Publisher

University of Silesia Press

Submit