I am studying the Duality Chapter of Convex Optimization by Boyd. Is it possible that strong duality holds for non-convex optimization? If yes, is there any specific condition? And, what is the relationship between Slater condition and strong duality? Based on the definition in the book, the Slater condition is vague to me. I would be thankful if you can explain it. In general, what are the relationship between KKT, strong duality, Slater condition, convex and non-convex optimization?

  • $\begingroup$ Read en.wikipedia.org/wiki/Slater%27s_condition . That lays it out fairly clearly. And yes, strong duality can hold in non-convex optimization - for material on that, google strong duality non-convex $\endgroup$ Mar 23, 2020 at 1:26
  • $\begingroup$ Thanks Mark. I am confused about the relationship between "KKT, strong duality, Slater condition, convex and non-convex optimization" and when KKT is sufficient and when it is necessary. Is there any reference which classifies them clearly? $\endgroup$
    – Amin
    Mar 23, 2020 at 4:42


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.