Given a symmetric matrix, we in this work would like to approximate this symmetric matrix with two kinds of structure, i.e., a positive semi-definite matrix with fixed diagonal entries selected from the original symmetric matrix and a correlation matrix with fixed elements outside the diagonal entries. Our approach is to transform the original approximate problem into an unconstrained continuously differentiable convex optimization problem. Numerical experiments seem to suggest the efficiency and effectiveness of our method.