KARMARKAR'S ALGORITHM IN LINEAR PROGRAMMING AND IT'S CONTRIBUTIONS TO COMPUTATIONAL OPTIMIZATION

Event information
Start:
End:
Venue:DM 409B

Abstract: In this talk we present various results related to the convergence of iterates, termination of the algorithm and the choice of the step-length parameter of Karmarkar’s polynomial-time algorithm in linear programming and indicate some of its recent contributions to computational optimization and computational complexity.