2015-2016 2016-2017 2017-2018 2018-2019 2019-2020
Browse
by subject...
    Schedule
view...
 

151 - 160 of 165 results for: MATH

MATH 301: Advanced Topics in Convex Optimization (CME 375)

Modern developments in convex optimization: semidefinite programming; novel and efficient first-order algorithms for smooth and nonsmooth convex optimization. Emphasis on numerical methods suitable for large scale problems arising in science and engineering. Prerequisites: convex optimization ( EE 364), linear algebra ( Math 104), numerical linear algebra ( CME 302); background in probability, statistics, real analysis and numerical optimization.
| Repeatable for credit
Instructors: Candes, E. (PI)

MATH 310: Top Ten Algorithms of the 20th Century (CME 329)

A high-level survey course covering one algorithm per week: metropolis, simplex method, conjugate gradient, QR, quicksort, fast fourier transform, maxcut, fast multipole method, integer relation detection, and convex/semi-definite programming.

MATH 355: Graduate Teaching Seminar

Required of and limited to first-year Mathematics graduate students.

MATH 360: Advanced Reading and Research

| Repeatable for credit

MATH 361: Research Seminar Participation

Participation in a faculty-led seminar which has no specific course number.
| Repeatable for credit

MATH 381: Seminar in Analysis

| Repeatable for credit

MATH 382: Qualifying Examination Seminar

| Repeatable for credit

MATH 384: Seminar in Geometry

| Repeatable for credit

MATH 385: Seminar in Topology

| Repeatable for credit

MATH 388: Seminar in Probability and Stochastic Processes

| Repeatable for credit
Filter Results:
term offered
updating results...
number of units
updating results...
time offered
updating results...
days
updating results...
UG Requirements (GERs)
updating results...
component
updating results...
career
updating results...
© Stanford University | Terms of Use | Copyright Complaints