Karmarkar’s Method

Date and Time

2020-07-24 10:00 오전

Place

24205 (off-line)

Speaker(s)

Jin-jae Shin

Overview

Karmarkar’s Method is possible to create an algorithm for linear programming characterized by polynomial complexity and, moreover, that was competitive with the simplex method.

YouTube

Reference(s)

Convex Optimization (Cambridge University Press 2004)

Next Speaker(s)

Meseret

File Station > Seminar Materials > Lab Seminar Materials

Go to Top