in the last ppt slide(last table), sir you've made mistake in typing(it's mu which is entered & not lamda1 as well as in calculating the Zj-Cj(it's 9 & not 35)

what are the necessary and sufficient conditions of optimality for convex optimization?

Cê é loko, muito bom essas aulas

quite helpful

sir we want more lecture from you on cone

time stamp 12:25 , but convex functions are defined over convex set only, isn't it??

I did not understand the proof of 3rd property , rest explanation was awesome.

Excellent

Thank you sir

why beta fuction will tend ro 0 when lamda tends to zero

This helped me a lot. Thank you for sharing the lectures with the world :)

According to the Wikipedia page on Sylvester's criterion, the nonnegativity of leading principal minors is not a sufficient criterion for positive semidefiniteness.

❤❤❤❤❤

❤❤❤❤

Thank you sir

Awesome 😎

Very helpful thanks sir

This video isn't even supposed to teach simplex, but this explanation of simplex makes more sense than all the sources I've referred so far. It's literally a godsend.

The only issue is the cameraman the way the person was always focusing out in super disturbing. exactly why would the cameraman do that unnecessarily 😫😫

THESE VIDEOS ARE SOOOO HELPFUL!!! Not just for school/college problems but also in understanding the internal working of optimizers being used in large scale libraries in real world applications like robotics and machine learning! Thank you so much Sir!!!

shouldn't lamda 2= 4 at 13:33?, somebody explain

Damn the zoom in and out, not needed at all!!

आपने एकदम शुरुआत से पढ़ाया, सब समझ में आ गया, अब ये आसान लग रहा है। धन्यवाद महोदय🙏👍💥

Videos bilkul clear nhi h...

Excellent sir

Brilliant explanation, my regards professor.

Great explanation Sir...Can you suggest a textbook or reference book for convex programming problems?

Min f=4x1x22x33+x12 x32 Subject to 6x1 x2 x3 + 4x2-3x3 <5. xi>0. Solve the Question sir

Minimize f(x) = x/2+0.25 x22x3 Subject to 3/4 x12x22 + 3/8 x2x32 <1 x 0, i=1,2,3. Solve the Question sir

THANK YOU DR. YOUR LECTURE HELPS ME FOR MY THESIS WORK

Sir I have a confusion in NLPP we take L=f-lemda g and in this problem why we r taking L= f+lemda g

sir you really help me thank you.

Professor your style of explaining is both accessible and diligent. Would like to connect with you on LinkedIn...

My man, you saved my life all the way back in 2018.

How to solve if one of the constraint is a non convex function ?

Very good way of teaching Sir. Thank you so much.

What an outstanding lecture! Not at all shying away from the details. Great job prof!

Perfect.

Thank you sir it has helped a lot with my examination

Very nice 👍👍👍👍👍👍....sir lot of thanks 👍

How to use this model in analysis by using any software. Please make video on this

If I have a study case problem how I know is quadratic or linear ?

u made this convex thing very easy . May God bless you.

Thank you so much sir.

Very informative! Thank you.

Very impressive lecture! 🙌

Thanks for the video proff, it was very clear

this good lecture i want to for lecture for interval qpp and how to solve

This is the most online lecture I ever come across. Kudos to the sponsors.

This whole series is so amazing the way you teach it's the best. The only issue is the cameraman the way the person was always focusing out in super disturbing. But the video and your teaching is just the best