Logarithmic Barrier Method Via Minorant Function for Linear Semidefinite Programming
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...
Main Author: | Leulmi Assma |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2023-03-01
|
Series: | Annales Mathematicae Silesianae |
Subjects: | |
Online Access: | https://doi.org/10.2478/amsil-2022-0021 |
Similar Items
-
Conic optimization: A survey with special focus on copositive optimization and binary quadratic problems
by: Mirjam Dür, et al.
Published: (2021-01-01) -
A bounded degree SOS hierarchy for polynomial optimization
by: JeanB. Lasserre, et al.
Published: (2017-03-01) -
Alternative SDP and SOCP approximations for polynomial optimization
by: Xiaolong Kuang, et al.
Published: (2019-06-01) -
Presolving linear bilevel optimization problems
by: Thomas Kleinert, et al.
Published: (2021-01-01) -
Complementarity-based nonlinear programming techniques for optimal mixing in gas networks
by: FalkM. Hante, et al.
Published: (2019-09-01)