scientific article; zbMATH DE number 1091399

From MaRDI portal
Publication:4367135





One considers the semidefinite programming problem \[ \min \text{Tr}(C^TX) \quad \text{s.t. \quad Tr}(A^T_iX) =b_i, \quad i=1, \dots, m,\;X\succeq 0, \] where \(X\), \(C\), \(A_1, \dots, A_m\) are symmetric matrices with order \(n; b_1, \dots, b_m\) are real numbers; \(A_1, \dots, A_m\) are linearly independent, where ``Tr means the trace of a matrix, ``\(\succeq\) denotes the Löwner partial order. A path-following method for the semidefinite programming problem above is presented which is an extension of the logarithmic barrier method developed by \textit{C. Roos} and \textit{J.-Ph. Vial} [Math. Program., Ser. A 54, No. 3, 295-305 (1992; Zbl 0771.90067)]. It is shown that the algorithm is polynomially convergent.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4367135)