You are viewing the early release of NevadaPath.Provide Feedback
NevadaPath
CatalogSchedulerGradesEnrollment

Filters

Course catalog

Search scope

Search prioritizes course titles, then descriptions. Exact course codes still appear first.

Searching...

CS 486

Introduction to Convex Optimization

Catalog2026-2027
Credits3 units
LevelUpper Division
Standard

Overview

Description

This course will introduce basic concepts of convex optimization and algorithms for convex optimization (e.g., Newton’s method, gradient descent methods). We will concentrate on recognizing and solving convex optimization problems that arise in engineering applications. This course would benefit anyone who uses or will use scientific computing or optimization in engineering or related work (e.g., machine learning, robotics, computer graphics, algorithms & complexity, computational geometry).

Requirements

Prerequisites

  • with a “C” or better
CS 202MATH 330
Original catalog text

Prerequisites

CS 202 with a “C” or better; MATH 330.

Units

Lecture3

Catalog Details

Offering

Offered: Every Spring

Terms

spring

Attributes

Standard

Learning Outcomes

  • identify, formulate, analyze, and solve complex computing or engineering problems by applying principles of computing, engineering, science, and mathematics.
  • apply computer science theory and software development fundamentals to produce computing-based solutions.