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.

Sign up for GitHub

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

Jump to bottom

13-04-01 Example lasso dual · 모두를 위한 컨벡스 최적화 #225

Open

utterances-bot opened this issue Jan 31, 2024 · 2 comments

utterances-bot commented Jan 31, 2024

13-04-01 Example lasso dual · 모두를 위한 컨벡스 최적화

https://convex-optimization-for-all.github.io/contents/chapter13/2021/04/05/13_04_01_Example_lasso_dual/

KHLee04 commented Jan 31, 2024

왜 z*=y-u인지 설명해 주실 수 있을까요?

Contributor

RektPunk commented Nov 10, 2024 •

edited

Loading

@KHLee04 늦었지만, Lagrange의 (1) term을 최소화 시키는 z*=y-u 이기 때문입니다. (1)식의 최소값은 미분을 통해 구할수 있는데, 0=-y+z+u => z*=y-u 가 됩니다

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment