10725-f12

Geoff is offering us a second chance... On Fri, Sep 27, 2013 at 12:01 AM, Carl Doersch <cdoersch@

Hi all, One last email from us: we are pleased to announce that "Finding Representative Objects

Hi all, One last reminder to fill out your course evaluations -- the deadline is tomorrow (Tuesday)

All homeworks have been graded, including yours. I'll email your grades separately. On Dec 14,

Solutions should be available online "soon".

Yes. Don't expect us to look at the appendix, just as if we are the average reviewer though ;) On

Hi all, I'm looking for the last 4 scribed notes, for the classes after thanksgiving. We would

Hi all, Some information on what is expected regarding your project's poster and final report

Yes, that's right, Delta s should be A Delta x. Thanks for catching this! -Geoff. On Wednesday,

(email address auto completion argh)

Tomorrow's lecture is about minimizing polynomials subject to polynomial inequality constraints -

Thanks to Lu Xie for pointing this out: "A polynomial-time algorithm for a class of linear

Yes, feel free to use ANY IP solver - in matlab or R or anything else. I don't care which IP

(a) In lecture yesterday I miswrote the divergent step size rule. My condition was sufficient, but

Thanks, Aniruddha On Dec 5, 2012, at 12:08 PM, Wooyoung Lee <wyoun...@gmail.com> wrote: Hi

Hi all, Since I am out of town (at NIPS), I won't be able to hold office hours today. As always,

Hi all, Tomorrow I will be giving the advanced topic lecture on Dual Averaging. It can be thought of

We will discuss Markov chain Monte Carlo methods. Hope to see you there, Wooyoung

Please download the latest version of pdf from the course website if you are working on pr4. The old

I've received 19,21,23 but not 20,22,24 yet (are we not fond of even numbers?). Can you send them

A typo is fixed in Question 4(a). The inequality constraint should be Ax<=b bot Ax>=b. The pdf

In case you missed it. Do any 3 of the 4 problems. Next week in lecture, I'll cover dual

Hi all, In case you didn't receive it, here's the link for the course evaluations: http://cmu

Indeed, there will be a recitation. We will discuss the potential reduction algorithm from lecture 24

Will there be a recitation today? What will be the topic?

Yes, thanks for catching this -- these are intended to be averages over the T data points. Best, -

Sweet. Thanks, Lu! Pumbaa On Tuesday, November 20, 2012 1:17:38 AM UTC-5, Lu wrote: It's x not x-

Hi all, Recitation tomorrow will cover formulating convex optimization problems as cone programs. I

Midterm solutions are now available. They are linked from the main page.

http://aefmedia.biz/wp-content/plugins/akismet/google235.html