Penalty/Barrier Multiplier Algorithm for Semidefinite Programming

We present a generalization of the Penalty/Barrier Multiplier algorithm for the semidefinite programming, based on a matrix form of Lagrange multipliers. Our approach allows to use among others logarithmic, shifted logarithmic, exponential and a very eective quadratic-logarithmic penalty/barrier functions. We present dual analysis of the method, based on its correspondence to a proximal point algorithm with nonquadratic distance-like function. We give computationally tractable dual bounds, which are produced by the Legendre transformation of the penalty function. Numerical results for large-scale problems from robust control, stable truss topology design and free material design demonstrate high eciency of the algorithm. 1 The research was supported in part by the grant # 9636-1-96 of the Israeli Ministry of Sciences and The Center for Absorption in Science, Ministry of Immigrant Absorption State of Israel 2 The research was supported in part by the Optimization Laboratory in the ..