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

1

It depends on what algorithm is being used, and even on the specific implementation of the algorithm: the violation of the constraint might create a situation which should never happen when the constraints are satisfied, and so the algorithm itself might not specify what to do in such a case.

  • 0
    I think in "projected gradient descent", starting from an infeasible point should not matter, because projections will bring it inside anyway.2012-12-19