Main Profile

At A Glance

Convex Analysis and Optimization

This course will focus on fundamental subjects in convexity, duality, and convex optimization algorithms. The aim is to develop the core analytical and algorithmic issues of continuous optimization, duality, and saddle point theory using a handful of unifying principles that can be easily visualized and readily understood.

Start Date: Feb 01, 2012
Cost: Free

Contact

Convex Analysis and Optimization's Full Profile

Overview

Description

This course will focus on fundamental subjects in convexity, duality, and convex optimization algorithms. The aim is to develop the core analytical and algorithmic issues of continuous optimization, duality, and saddle point theory using a handful of unifying principles that can be easily visualized and readily understood.

Details

  • Dates: Feb 01, 2012 to May 25, 2012
  • Days of the Week: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday
  • Level of Difficulty: Beginner
  • Size: Massive Open Online Course
  • Instructor: Prof. Dimitri Bertsekas
  • Cost: Free
  • Institution: MIT OCW

Provider Overview

About MIT OCW: MIT OpenCourseWare (OCW) is a web-based publication of virtually all MIT course content. OCW is open and available to the world and is a permanent MIT activity.

Latest Tweet

Questions about Convex Analysis and Optimization

Want more info about Convex Analysis and Optimization? Get free advice from education experts and Noodle community members.

  • Answer