bv_cvxbook_extra_exercises

Also report the maximum sinr value solving the

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: n k=1 Rk j ∈M(k) 2 idc ≤ Pmax , j (37) where Pmax is a given constant. These specifications must be satisfied for all possible ik (t) that satisfy (30). Formulate this as a convex optimization problem in the standard form minimize f0 (x) subject to fi (x) ≤ 0, Ax = b. i = 1, . . . , p You may introduce new variables, or use a change of variables, but you must say very clearly • what the optimization variable x is, and how it corresponds to the problem variables w (i.e., is x equal to w, does it include auxiliary variables, . . . ?) • what the objective f0 and the constraint functions fi are, and how they relate to the objectives and specifications of the problem description • why the objective and constraint functions are convex • what A and b are (if applicable). 11.3 Optimal amplifier gains. We consider a system of n amplifiers connected (for simplicity) in a chain, as shown below. The variables that we will optimize over are the gains a1 , . . . , an > 0 of the amplifiers. The first...
View Full Document

This note was uploaded on 09/10/2013 for the course C 231 taught by Professor F.borrelli during the Fall '13 term at Berkeley.

Ask a homework question - tutors are online