DMCA
Lagrangian Relaxation Based Algorithms for Convex Programming Problems (2004)
by
Rohit Khandekar
| Citations: | 21 - 2 self |
BibTeX
@MISC{Khandekar04lagrangianrelaxation,
author = {Rohit Khandekar},
title = {Lagrangian Relaxation Based Algorithms for Convex Programming Problems},
year = {2004}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This thesis deals with a class of Lagrangian relaxation based algorithms developed in the computer science community in last couple of decades. We present a unified framework for designing such algorithms for a large family of convex programming problems. Our algorithms are based on exponential potential functions and given any 2 (0; 1), compute (1 + )-approximate solutions in number of iterations proportional to .
