This preview shows page 1. Sign up to view the full content.
Unformatted text preview: up the optimization problem such that the function being minimized or maximized is convex. This is done because convex functions can be optimized very easily by using the theory of Convex Optimization. Furthermore, several fast and efficient Convex Optimization packages exist for languages such as MATLAB. All these benefits make Convex Optimization the tool of choice in the field of resource allocation. [22] defines the convex optimization problem as follows: Minimize the target function f ( x ) subject to the constraints f i ( x ) b i for i = 1,,N (E11) The target function f ( x ) and the constraint functions f i ( x ) are convex and have the following properties:...
View
Full
Document
This note was uploaded on 09/27/2009 for the course ECE 399 taught by Professor Prof during the Spring '09 term at University of Texas at Austin.
 Spring '09
 Prof

Click to edit the document details