Discretization method for semi-definite programming

Abstract: Semi-definite programs are convex optimization problems arising in a wide variety of applications and the extension of linear programming. Most methods for linear programming have been generalized to semi-definite programs. This paper discusses the discretization method in semi-definite programming. The convergence and the convergent rate of error between the optimal value of the semi-definite programming problems and the optimal value of the discretized problems are obtained. An approximately optimal division is given under certain assumptions. With the significance of the convergence property, the duality result in semi-definite programs is proved in a simple way which is different from the other common proofs. [Copyright &y& Elsevier]