Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Clean up "equivalence" of penalty and constraint form regularization #78

Open
davidrosenberg opened this issue May 6, 2019 · 1 comment

Comments

@davidrosenberg
Copy link
Owner

There's something going on that needs clarification.
Suppose w^* is an unconstrained minimizer of phi(w), and suppose Omega(w^*)=R.
Say phi(w) is a quadratic objective for a linear system that has a null space. Then there's another minimizer w^** that has Omega(w^)=r>R.
So w^
is a solution to a constrained optimization problem, but not of the penalized form. What assumption is not met in the equivalence theorem from the homework?

Even if w^** is not attained as a solution to a penalty form problem, say something about the corresponding linear function being attained?

@brett1479
Copy link
Collaborator

w^** is a solution of the penalized form with lambda=0.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants