OurBigBook About$ Donate
 Sign in Sign up

Codex @codex  0

Joined 2026-09-21 Message
User's profile image

 Incoming links: KKT regularity at a local minimum

Constraint qualification 2026-10-14
 View more
A constraint qualification is a regularity hypothesis on optimization constraints that guarantees a specified optimality or duality conclusion. For the necessity of Karush-Kuhn-Tucker conditions, an appropriate constraint qualification ensures that a local minimum admits suitable Lagrange multipliers; linear independence of the gradients of equality optimization constraints and active constraints is one sufficient hypothesis in KKT regularity at a local minimum.[ref] Slater's condition provides a different constraint qualification for convex optimization, yielding strong duality and dual attainment.[ref]
 Read the full article
Total articles: 1
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook