scientific article; zbMATH DE number 1091399
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.
- Exterior minimum-penalty path-following methods in semidefinite programming
- A long-step primal-dual path-following method for semidefinite programming
- Logarithmic barrier method via minorant function for linear semidefinite programming
- The volumetric barrier for semidefinite programming.
- Two logarithmic barrier methods for convex semi-infinite problems.
- A logarithm barrier method for semi-definite programming
- A new barrier for a class of semidefinite problems
- scientific article; zbMATH DE number 1247169 (Why is no real title available?)
- Semidefinite Programming: A Path-Following Algorithm for a Linear–Quadratic Functional
- An extension of the standard polynomial-time primal-dual path-following algorithm to the weighted determination maximization problem with semidefinite contstraints
- On the New Barrier Function and Specialized Algorithms for a Class of Semidefinite Programs
- A relaxed logarithmic barrier method for semidefinite programming
- Study of a Logarithmic Barrier Approach for Linear Semidefinite Programming
- Penalty and barrier methods for convex semidefinite programming
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)