Presents the elementary exposition of the main ideas of complexity theory for convex optimization. This book covers optimal methods and lower complexity bounds ... » 

Presents the elementary exposition of the main ideas of complexity theory for convex optimization. This book covers optimal methods and lower complexity bounds for smooth and non-smooth convex optimization. It devotes a separate chapter to polynomial-time interior-point methods. It is suitable for industrial engineers and economists. «