I am aware that in a convex optimization problem, the initial solution does not matter as the algorithm guarantees convergence to the global minimum/maximum. But what if the initial solution does not satisfy one of the constraints? I.e. it is technically not a "solution" as it violates a constraint. Will using this as the initial guess still lead to the global solution?