Algebraic techniques and semidefinite optimization

Master

In Maynard (USA)

Price on request

Description

  • Type

    Master

  • Location

    Maynard (USA)

  • Start date

    Different dates available

This research-oriented course will focus on algebraic and computational techniques for optimization problems involving polynomial equations and inequalities with particular emphasis on the connections with semidefinite optimization. The course will develop in a parallel fashion several algebraic and numerical approaches to polynomial systems, with a view towards methods that simultaneously incorporate both elements. We will study both the complex and real cases, developing techniques of general applicability, and stressing convexity-based ideas, complexity results, and efficient implementations. Although we will use examples from several engineering areas, particular emphasis will be given to those arising from systems and control applications.

Facilities

Location

Start date

Maynard (USA)
See map
02139

Start date

Different dates availableEnrolment now open

Questions & Answers

Add your question

Our advisors and other users will be able to reply to you

Who would you like to address this question to?

Fill in your details to get a reply

We will only publish your name and question

Reviews

Subjects

  • Systems

Course programme

A list of topics covered in the course is presented in the calendar.


Lectures: 2 sessions / week, 1.5 hours / session


Besides general mathematical maturity, the minimal suggested requirements for the course are the following: Linear Algebra (e.g., 18.06 / 18.700), a background course on Linear Optimization or Convex Analysis (e.g., 6.251J or 6.255 / 15.093, 6.253), Basic Probability (e.g., 6.041 / 6.431). Familiarity with the basic elements of Modern Algebra (e.g., groups, rings, fields) is encouraged. Knowledge of the essentials of Dynamical Systems and Control (e.g., 6.241) is recommended, but not required.


We will use a variety of book chapters and current papers. Some of these are listed in the readings section.


The final grade will be calculated based on the following weights:


Problem sets will be handed out in an approximately biweekly basis and will be due one week later, at the beginning of the lecture on their respective due dates. We expect you to turn in all completed problem sets on time. Late homework will not be accepted, unless there is a prior arrangement with the instructor.


Each student will also be responsible for editing and/or writing lecture notes from two lectures.


We encourage working together whenever possible: in the tutorials, on the problem sets, and during general discussion of the material and assignments. Keep in mind, however, that the problem set solutions you hand in should reflect your own understanding of the class material. It is not acceptable to copy a solution that somebody else has written.


Don't show me this again


This is one of over 2,200 courses on OCW. Find materials for this course in the pages linked along the left.


MIT OpenCourseWare is a free & open publication of material from thousands of MIT courses, covering the entire MIT curriculum.


No enrollment or registration. Freely browse and use OCW materials at your own pace. There's no signup, and no start or end dates.


Knowledge is your reward. Use OCW to guide your own life-long learning, or to teach others. We don't offer credit or certification for using OCW.


Made for sharing. Download files for later. Send to friends and colleagues. Modify, remix, and reuse (just remember to cite OCW as the source.)


Learn more at Get Started with MIT OpenCourseWare


Algebraic techniques and semidefinite optimization

Price on request