Loading [MathJax]/jax/output/SVG/config.js
Journal of Siberian Federal University. Mathematics & Physics
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



J. Sib. Fed. Univ. Math. Phys.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Journal of Siberian Federal University. Mathematics & Physics, 2018, Volume 11, Issue 3, Pages 300–312
DOI: https://doi.org/10.17516/1997-1397-2018-11-3-300-312
(Mi jsfu674)
 

This article is cited in 8 scientific papers (total in 8 papers)

Study of a logarithmic barrier approach for linear semidefinite programming

Assma Leulmia, Bachir Merikhib, Djamel Benterkib

a Department of Mathematics, University of Skikda, Algeria
b Department of Mathematics, Ferhat Abbas Setif University, Algeria
Full-text PDF (137 kB) Citations (8)
References:
Abstract: In this paper, we present a logarithmic barrier interior-point method for solving a semidefinite programming problem. Newton's method is used to compute the descent direction, and minorant function are used as an efficient alternative to line search methods to determine the displacement step along the direction in order to reduce the computation cost.
Keywords: semidefinite programming, interior-point methods, logarithmic barrier methods, line search.
Received: 16.04.2017
Received in revised form: 06.12.2017
Accepted: 07.03.2018
Bibliographic databases:
Document Type: Article
UDC: 519.21
Language: English
Citation: Assma Leulmi, Bachir Merikhi, Djamel Benterki, “Study of a logarithmic barrier approach for linear semidefinite programming”, J. Sib. Fed. Univ. Math. Phys., 11:3 (2018), 300–312
Citation in format AMSBIB
\Bibitem{LeuMerBen18}
\by Assma~Leulmi, Bachir~Merikhi, Djamel~Benterki
\paper Study of a logarithmic barrier approach for linear semidefinite programming
\jour J. Sib. Fed. Univ. Math. Phys.
\yr 2018
\vol 11
\issue 3
\pages 300--312
\mathnet{http://mi.mathnet.ru/jsfu674}
\crossref{https://doi.org/10.17516/1997-1397-2018-11-3-300-312}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000435861500005}
Linking options:
  • https://www.mathnet.ru/eng/jsfu674
  • https://www.mathnet.ru/eng/jsfu/v11/i3/p300
  • This publication is cited in the following 8 articles:
    1. Assma Leulmi, “An Efficient Penalty Method without a Line Search for Nonlinear Optimization”, Axioms, 13:3 (2024), 176  crossref
    2. Welid Grimes, Mohamed Achache, Adnan Yassine, “A Newton descent logarithmic barrier interior-point algorithm for monotone LCP”, RAIRO-Oper. Res., 58:6 (2024), 5537  crossref
    3. Mohamed Ali Zdiri, Bilel Dhouib, Zuhair Alaas, Fatma Ben Salem, Hsan Hadj Abdallah, “Load Flow Analysis and the Impact of a Solar PV Generator in a Radial Distribution Network”, Eng. Technol. Appl. Sci. Res., 13:1 (2023), 10078  crossref
    4. Assma Leulmi, “A Comparative Numerical Study between Minorant Functions and Line Search Methods in Penalty Methods for Linear Optimization”, Eng. Technol. Appl. Sci. Res., 13:1 (2023), 10073  crossref
    5. S. Chagub, D. Benterki, “Effektivnyi metod logarifmicheskikh barerov bez lineinogo poiska dlya vypuklogo kvadratichnogo programmirovaniya”, Sib. zhurn. vychisl. matem., 25:2 (2022), 193–207  mathnet  crossref
    6. S. Chaghoub, D. Benterki, “An Efficient Logarithmic Barrier Method without Line Search for Convex Quadratic Programming”, Numer. Analys. Appl., 15:2 (2022), 156  crossref
    7. Soraya Chaghoub, Djamel Benterki, “Comparative numerical study between line search methods and majorant functions in barrier logarithmic methods for linear programming”, J. Numer. Anal. Approx. Theory, 49:1 (2020), 15  crossref
    8. Assma Leulmi, Soumia Leulmi, “Logarithmic barrier method via minorant function for linear programming”, Zhurn. SFU. Ser. Matem. i fiz., 12:2 (2019), 191–201  mathnet  crossref
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Журнал Сибирского федерального университета. Серия "Математика и физика"
    Statistics & downloads:
    Abstract page:252
    Full-text PDF :142
    References:48
     
      Contact us:
    math-net2025_05@mi-ras.ru
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025