Is constrained optimization equivalent to unconstrained optimization followed by a projection step?

69 Views Asked by At

Suppose we have a constrained convex optimization problem $min_{x \in \mathcal{C}}f(x)$. Is it correct to first solve the unconstrained problem ($\tilde{x}=argmin_{x}f(x)$) and then project the solution to the feasible set ($\hat{x}=\Pi_\mathcal{C}(\tilde{x})$) in order to find an optimal solution to the original problem?