1. Home
  2. Material Detail: 6.253 Convex Analysis and Optimization (MIT)

Material Detail

"6.253 Convex Analysis and Optimization (MIT)" icon

6.253 Convex Analysis and Optimization (MIT)

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.
Keywords:
convex optimization algorithms, geometric duality, Mathematical Analysis, hyperplanes, ocwc, convex analysis, oec, duality theory, Algorithms and Data Structures, conjugacy, subgradients, optimality conditions, convex optimization, polyhedral convexity
Disciplines:
Go to Material 
Bookmark / Add to Course ePortfolio
Create a Learning Exercise
Add Accessibility Information
Rate
Add a Comment

Quality

  • Editor Reviews
  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Material Type:
Online Course
Date Added to MERLOT:
August 6, 2014
Date Modified in MERLOT:
September 2, 2014
Author:
Submitter:
The Open Education Consortium
Primary Audience:
College General Ed
Technical Format:
Website
Mobile Compatibility:
Not specified at this time
Language:
English
Cost Involved:
No
Source Code Available:
No
Accessibility Information Available:
Unknown
Creative Commons:
Creative Commons License
This work is licensed under a Attribution-NonCommercial-ShareAlike 3.0 United States

Browse...

Disciplines with similar materials as 6.253 Convex Analysis and Optimization (MIT)
People who viewed this also viewed
Other materials like 6.253 Convex Analysis and Optimization (MIT)

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.