2
$\begingroup$

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?

Thanks.

  • 0
    One technique is to 'minimize' the maximum constraint violation until the current solution becomes feasible. This is still a convex problem.2012-12-19

1 Answers 1