0 Up votes0 Down votes

1 views5 pagesQuestion sheet of the exam held in january 2017 for the Convex Optimization course.

Nov 22, 2018

© © All Rights Reserved

PDF, TXT or read online from Scribd

Question sheet of the exam held in january 2017 for the Convex Optimization course.

© All Rights Reserved

1 views

Question sheet of the exam held in january 2017 for the Convex Optimization course.

© All Rights Reserved

- Productions Assignment Assistance
- Cluster Optimization Rule_Ver1
- How to Optimize Physical Layer Using Atoll
- c09s4
- Virtual_company_formation_for_agile_manu.pdf
- i Jst c 7251224793800
- Weight Optimization of Gate Valve
- t 140522
- 1-s2.0-S0898122102001992-main
- Introduction to Solver
- Math Program
- Benders Decomposition
- Linear Programming
- Sk 049004012
- convexOptimization
- Short Sales Constraint
- 10725_Lecture16
- Approx Alg Notes
- An Oil Pipeline Design Problem
- Lagrange Multipliers

You are on page 1of 5

Circuits and Systems Group

25 January 2017, 9:00–12:00

This is an open book exam. Text books and slides are allowed. However,

solution manuals and handwritten notes/solutions are not allowed.

Question 1 (10 points)

Consider a stochastic process with covariance matrix

1 ρ

C(ρ) = ; −1 ≤ ρ ≤ 1,

ρ 1

which is a positive semidefinite matrix.

Hint: To answer this question, you may want to use the following matrix

identities. The eigenvalues λ1 and λ2 of the 2 × 2 matrix

a b

A=

c d

are given by

(a + d) 1 p

λ1 = + (a + d)2 − 4(ad − bc)

2 2

and

(a + d) 1 p

λ2 = − (a + d)2 − 4(ad − bc).

2 2

The trace of A−1 is related to the eigenvalues of A as

trace{A−1 } = λ−1 −1

1 + λ2 .

f0 (ρ) = trace{C−1 (ρ)}

concave or convex? Why? Also, sketch f0 (ρ) for −1 < ρ < 1.

(b) Let λmax (C) denote the maximum eigenvalue of C. Is the function

tion f1 (ρ) for −1 ≤ ρ ≤ 1.

f2 (ρ) = log det{C(ρ)},

convex or concave? Why? Also, plot the log-determinant function

f2 (ρ) for −1 < ρ < 1.

the function f3 (ρ) is nonconvex.

2

Question 2 (10 points)

Consider the quadratically constrained quadratic program (QCQP)

subject to (x1 − 1)2 + (x2 − 1)2 ≤ 1

(x1 − 1)2 + (x2 + 1)2 ≤ 1

(a) Sketch the feasible set of the problem and level sets of the objective.

From this sketch, find the optimal point x∗ and optimal value p∗ .

(b) Give the KKT conditions. Do there exist Lagrange multipliers λ∗1 and

λ∗2 that prove x∗ is optimal?

(d) Solve the Lagrange dual problem. Is the dual optimum d∗ attained?

Does strong duality hold?

3

Question 3 (10 points)

Consider the problem of minimizing the function f : R2 → R, defined as

with x = [x1 , x2 ]T .

(a) For the starting point x(0) = [0, 1]T show that the search direction

∆x(0) = [1, −1]T is a valid descent direction for f at x(0) .

s≥0

(c) Apply the gradient method with fixed step size t = 1/2, starting at

x(0) = [0, 1]T , for one iteration? Does f (x(k) ) converge to the optimal

value p∗ ?

(d) Derive the Hessian of f . Also, apply Newton’s method with fixed step

size t = 1, starting at x(0) = [0, 1]T , for one iteration? Does f (x(k) )

converge to the optimal value p∗ ?

Hint: You may want to use the following matrix identity:

−1

a b 1 d −b

= .

c d ad − bc −c a

4

Question 4 (10 points)

For α ∈ (0, 1), define the quantile loss function, hα : RN → R, as

elementwise.

function and its subdifferential ∂hα (x) as a function of x assuming

that N = 1. Explain what happens when α = 0.5.

minimize hα (Ax − b)

Explain how to write the quantile regression problem as a Linear Pro-

gram (LP).

(ADMM) algorithm to solve the quantile regression problem. Give

the detailed update equations (not just the update optimization pro-

blems).

Hint: Introduce a new variable (and constraint) z = Ax − b. Use the

scaled form ADMM by scaling the dual variable.

- Productions Assignment AssistanceUploaded byTaniqua Gillyard
- Cluster Optimization Rule_Ver1Uploaded byDpkKSingh
- How to Optimize Physical Layer Using AtollUploaded byAbiyau Neo
- c09s4Uploaded byRuwina Ayman
- Virtual_company_formation_for_agile_manu.pdfUploaded byMilan Kolarevic
- i Jst c 7251224793800Uploaded byAmir Saud
- Weight Optimization of Gate ValveUploaded byvelusankar
- t 140522Uploaded byAhmed Hussain
- 1-s2.0-S0898122102001992-mainUploaded bynadimduet1
- Introduction to SolverUploaded byPeter
- Math ProgramUploaded byAezel Ramirez
- Benders DecompositionUploaded byvino154023
- Linear ProgrammingUploaded byPooja Jain
- Sk 049004012Uploaded byNasdap
- convexOptimizationUploaded bynudala
- Short Sales ConstraintUploaded byluuthanhtam
- 10725_Lecture16Uploaded byApel_Apel_King
- Approx Alg NotesUploaded bySurendra Yadav
- An Oil Pipeline Design ProblemUploaded bycatatal123
- Lagrange MultipliersUploaded byquastard
- Lp MatemathicaUploaded byzhushazang
- Transportation and Assignment ProblemUploaded byrashmijagga
- HW1Uploaded byEhtisham Ullah
- Two-dimensional Finite Element Computer Codes for Stress Analysis and Field ProblemUploaded byMarco Miranda Rodríguez
- Controller Design AutoStatic Aeroelastic Considerations for Circulation Control Airfoilsmation for Aeroservoelastic Design Optimization of Wind TurbinesUploaded bynim1987
- Geometric programming for circuit optimization.pdfUploaded byAnonymous rsGzBBiqk
- OR1Uploaded byMeet Shah
- PP 159-168 Optimal Design of Transformer a CompressiveUploaded byEditorijset Ijset
- Extra Problems Existence and Uniqueness of Optimal SolutionUploaded byArie Brouwer
- OptiStruct and RADIOSS Difference hypermeshUploaded by03sri03

- Mat Lab Project 2016Uploaded bybob
- CSE565-F10-midterm1Uploaded byh_liang93
- Pseudo Random Bit GeneratorUploaded bysiddharth07334
- MINI Project listUploaded byshivaramnaik
- Prediction of the Equivalent Radon Exhalation Rate of Uranium Ore-rock in the Course of Mine Ventilation Based on GA-SVMUploaded bySEP-Publisher
- The Polyakov loop behavior in lattice SU(2) gluodynamics in external fieldUploaded by6s1vN
- how to deblur the imageUploaded bycoolrs
- Compressive Sensing in Electromagnetics A Review.pdfUploaded bywuchennuaa
- Loss Aggregate Part3Uploaded byBlimundo
- Design and Performance Analysis of FIR Low- Pass Filter using Bartlett, Blackman and Taylor Window Technique.Uploaded byEditor IJRITCC
- 10 Random AnalysisUploaded bysons01
- Comp 30291Uploaded byDr-Raghad Al-Faham
- 14 - Karnaugh MapsUploaded bySignorina Ayesha
- Sampling FrequencyUploaded byGerald Varon
- DeepXplore- Automated Whitebox Testing of Deep Learning SystemsUploaded byJan Hula
- FEM BasicsUploaded bythe_ray004
- 7 1534938100_22-08-2018Uploaded byEditor IJRITCC
- DOB Presentation by ShimUploaded byAhmed H El Shaer
- ThesisUploaded byahmed8
- pertcpm-121208102934-phpapp02Uploaded byBN Mali
- MATLAB Central - Fuzzy C-Means Image SegmentationUploaded byFormat Seorang Legenda
- Kuliah 10 Deteksi Tepi Canny Edit PrintUploaded byA Dz Zainuddin
- Independent Component Analysis-Based Background Subtraction for Indoor SurveillanceUploaded byJoseph George
- Window Smoothing and Spectral LeakageUploaded bydrdinglecheng
- OCR System for Detection of Shipping ContainerUploaded byDedeh Rosmaniar
- Giaralis and Spanos HSTAM 2010Uploaded byKali Prasad
- Matlab Assignment Help - Onlineassignmenthelp.comUploaded byDavid Mark
- Backpropagation for Continuous Theta Neural NetworksUploaded bydavid fan
- Decision Analysis & Modeling Solved AssignmentUploaded byMbaassignmentanswer
- D1T3 - Clarence Chio and Anto Joseph - Practical Machine Learning in InfosecurityUploaded bypmjoshir

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.