Skip to content
nonconvexcard

Complementary slackness and active constraints

ProofIntermediate⏱ 30 minAdvanced Optimizationkktcomplementary slacknessactive set

Problem

Prove that under strong duality with both optima attained, αi⋆fi(x⋆)=0\alpha_i^\star f_i(x^\star) = 0 for every ii. Deduce that removing any constraint with αi⋆=0\alpha_i^\star = 0 leaves the optimum unchanged, and explain the consequence for support vectors.

Write a complete argument. Every inequality you use should be one you could state precisely.

Solution

Opening this before you have a real attempt on paper is the fastest way to feel like you understand something you cannot reproduce.

Related problems

All problems
SolvedProblemFieldTypeDifficultyTime
Weak duality holds without convexityAdvanced OptimizationProofBeginner15 min
Derive the dual of a quadratic programAdvanced OptimizationProofIntermediate30 min
A convex problem with a duality gapAdvanced OptimizationProofAdvanced30 min
Derive the optimal weight update abyssQuantizationProofAdvanced1 hour
Projection onto the probability simplexAdvanced OptimizationProofAdvanced1 hour