The term is strictly convex, while the remaining terms are convex, so the elastic net objective is strictly convex and its minimizer is unique. If two columns of are identical, swapping their coefficients leaves the objective unchanged. Uniqueness then forces those coefficients to be equal.
The Karush-Kuhn-Tucker conditions arewhereAssume and . The active equations giveThe inactive KKT inequalities becomeConversely, define andIf the displayed inequality holds and , the active equations and inactive inequalities together satisfy every KKT condition. Convexity and uniqueness imply , proving sign recovery.
Articles by others on the same topic
There are currently no matching articles.