A numerical feasible interior point method for linear semidefinite programs

DOI10.1051/ro:2007006zbMath1377.90110OpenAlexW2152386286MaRDI QIDQ4600612

Djamel Benterki, Jean-Pierre Crouzeix, Bachir Merikhi

Publication date: 12 January 2018

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2007__41_1_49_0/

zbMATH Keywords

linear programmingsemidefinite programminginterior point methods

Mathematics Subject Classification ID

Semidefinite programming (90C22) Linear programming (90C05) Interior-point methods (90C51)

Related Items (11)

An efficient logarithmic barrier method without line search for convex quadratic programming ⋮ A feasible primal-dual interior point method for linear semidefinite programming ⋮ A logarithmic barrier approach for linear programming ⋮ A logarithmic barrier interior-point method based on majorant functions for second-order cone programming ⋮ Distance to a constitutive tensor isotropy stratum by the Lasserre polynomial optimization method ⋮ Finding a strict feasible solution of a linear semidefinite program ⋮ Logarithmic barrier method via minorant function for linear semidefinite programming ⋮ Unnamed Item ⋮ A logarithm barrier method for semi-definite programming ⋮ A relaxed logarithmic barrier method for semidefinite programming ⋮ Study of a Logarithmic Barrier Approach for Linear Semidefinite Programming

This page was built for publication: A numerical feasible interior point method for linear semidefinite programs