Study of a Logarithmic Barrier Approach for Linear Semidefinite Programming

DOI10.17516/1997-1397-2018-11-3-300-312OpenAlexW2809633558MaRDI QIDQ5853250

Djamel Benterki, Bachir Merikhi, Assma Leulmi

Publication date: 18 March 2021

Published in: Journal of Siberian Federal University. Mathematics & Physics (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/jsfu674

zbMATH Keywords

semidefinite programminginterior-point methodsline searchlogarithmic barrier methods

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX)

Related Items

ADAPTATION OF THE MINORANT FUNCTION FOR LINEAR PROGRAMMING, An efficient logarithmic barrier method without line search for convex quadratic programming, Unnamed Item, Unnamed Item, Logarithmic Barrier Method Via Minorant Function for Linear Programming

Cites Work

• Bounds for eigenvalues using traces
• New bounds for the extreme values of a finite sample of real numbers
• Some New Search Directions for Primal-Dual Interior Point Methods in Semidefinite Programming
• A logarithm barrier method for semi-definite programming
• Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
• A numerical feasible interior point method for linear semidefinite programs
• On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
• A relaxed logarithmic barrier method for semidefinite programming
• Convex Analysis
• Numerical optimization. Theoretical and practical aspects. Transl. from the French