I'm trying to solve a convex minimzation problem using the CVXPY module in Python. I want to solve for a complex matrix X of dimension d*d and add the Constraints, that trace (A * X) = 1 for a given matrix A and X is positive semdefinite, hermitean and all diagonal entries of X are equal to one another.
I added the first 3 Constraints into my Code by
X = cp.Variable((d,d), complex = True)
constraints = [X >>0, cp.trace(A @ X) == 1]
Does anyone have any idea how to add the last constraint, that all diagonal elements are equal?