AM 229

Convex Optimization

5credits
About this course

Focuses on recognizing, formulating, analyzing, and solving convex optimization problems encountered across science and engineering. Topics include: convex sets; convex functions; convex optimization problems; duality; subgradient calculus; algorithms for smooth and non-smooth convex optimization; applications to signal and image processing, machine learning, statistics, control, robotics and economics. Students are required to have knowledge of calculus and linear algebra, and exposure to probability. (Formerly AMS 229.)

All available terms

3 terms

Avg. GPA
3.90
Grades
80

Other grades

P1.3%S42.5%U3.8%W1.3%
More course details

University of California, Santa Cruz

AM 229 at UCSC: average GPA 3.90 across 80 students. Grade distribution by term. Focuses on recognizing, formulating, analyzing, and solving convex…

Average GPA: 3.90

Grade distribution records: 80 students across 3 terms.

Grade distribution

GradeStudentsPercent
A+2531.3%
A78.8%
A-67.5%
B+33.8%
P11.3%
S3442.5%
U33.8%
W11.3%

Based on 80 student grade records across 3 terms and 2 professors.

Instructors

The course page is taking longer to load. This summary is still available.

We could not load the full course details. This summary is still available.

Still loading. This can take a moment on a slow connection.

Loading My Class Grades