ECE580 Exam 1 October 4, Please do not write on the back of the exam pages. Extra paper is available from the instructor.

Similar documents
ECE580 Fall 2015 Solution to Midterm Exam 1 October 23, Please leave fractions as fractions, but simplify them, etc.

ECE580 Exam 2 November 01, Name: Score: / (20 points) You are given a two data sets

ECE569 Exam 1 October 28, Name: Score: /100. Please leave fractions as fractions, but simplify them, etc.

ECE 680 Modern Automatic Control. Gradient and Newton s Methods A Review

ECE580 Partial Solution to Problem Set 3

ECE580 Final Exam December 14, Please leave fractions as fractions, I do not want the decimal equivalents.

MATH 4211/6211 Optimization Basics of Optimization Problems

MA/OR/ST 706: Nonlinear Programming Midterm Exam Instructor: Dr. Kartik Sivaramakrishnan INSTRUCTIONS

, b = 0. (2) 1 2 The eigenvectors of A corresponding to the eigenvalues λ 1 = 1, λ 2 = 3 are

Math 51 Second Exam May 18, 2017

MA 113 Calculus I Fall 2017 Exam 1 Tuesday, 19 September Multiple Choice Answers. Question

MTH 132 Solutions to Exam 2 Nov. 23rd 2015

Assignment #10: Diagonalization of Symmetric Matrices, Quadratic Forms, Optimization, Singular Value Decomposition. Name:

ECE580 Solution to Problem Set 3: Applications of the FONC, SONC, and SOSC

Chapter 8 Gradient Methods

Introduction to unconstrained optimization - direct search methods

MA 113 Calculus I Fall 2015 Exam 3 Tuesday, 17 November Multiple Choice Answers. Question

OPER 627: Nonlinear Optimization Lecture 14: Mid-term Review

Performance Surfaces and Optimum Points

Integration - Past Edexcel Exam Questions

Math 164-1: Optimization Instructor: Alpár R. Mészáros

FALL 2018 MATH 4211/6211 Optimization Homework 4

HW3 - Due 02/06. Each answer must be mathematically justified. Don t forget your name. 1 2, A = 2 2

MA 113 Calculus I Fall 2015 Exam 1 Tuesday, 22 September Multiple Choice Answers. Question

Math 241 Final Exam, Spring 2013

Math 164-1: Optimization Instructor: Alpár R. Mészáros

Constrained optimization: direct methods (cont.)

Math 164 (Lec 1): Optimization Instructor: Alpár R. Mészáros

6.252 NONLINEAR PROGRAMMING LECTURE 10 ALTERNATIVES TO GRADIENT PROJECTION LECTURE OUTLINE. Three Alternatives/Remedies for Gradient Projection

MTH 132 Solutions to Exam 2 Apr. 13th 2015

MTH132 Exam 1 Covers: Page Total. Max

Lecture 3: Basics of set-constrained and unconstrained optimization

MA 113 Calculus I Fall 2012 Exam 3 13 November Multiple Choice Answers. Question

MATH 251 Final Examination August 10, 2011 FORM A. Name: Student Number: Section:

Methods that avoid calculating the Hessian. Nonlinear Optimization; Steepest Descent, Quasi-Newton. Steepest Descent

MA 125 CALCULUS I FALL 2006 December 08, 2006 FINAL EXAM. Name (Print last name first):... Instructor:... Section:... PART I

Math 125 Final Examination Autumn 2015

Numerical Optimization

ORF 363/COS 323 Final Exam, Fall 2018

ECE302 Exam 2 Version A April 21, You must show ALL of your work for full credit. Please leave fractions as fractions, but simplify them, etc.

Week 4: Calculus and Optimization (Jehle and Reny, Chapter A2)

Math 273a: Optimization Basic concepts

8 Numerical methods for unconstrained problems

Lecture Notes: Geometric Considerations in Unconstrained Optimization

Math (P)refresher Lecture 8: Unconstrained Optimization

2.098/6.255/ Optimization Methods Practice True/False Questions

Without fully opening the exam, check that you have pages 1 through 11.

Problem Point Value Points

More First-Order Optimization Algorithms

Algorithms for constrained local optimization

Math 31A Differential and Integral Calculus. Final

1 Newton s Method. Suppose we want to solve: x R. At x = x, f (x) can be approximated by:

CS 323: Numerical Analysis and Computing

Written Examination

Final Exam Practice Problems Part II: Sequences and Series Math 1C: Calculus III

Optimization. Yuh-Jye Lee. March 21, Data Science and Machine Intelligence Lab National Chiao Tung University 1 / 29

MA 125 CALCULUS I SPRING 2007 April 27, 2007 FINAL EXAM. Name (Print last name first):... Student ID Number (last four digits):...

DO NOT OPEN THIS QUESTION BOOKLET UNTIL YOU ARE TOLD TO DO SO

1 Overview. 2 A Characterization of Convex Functions. 2.1 First-order Taylor approximation. AM 221: Advanced Optimization Spring 2016

Math 251 December 14, 2005 Final Exam. 1 18pt 2 16pt 3 12pt 4 14pt 5 12pt 6 14pt 7 14pt 8 16pt 9 20pt 10 14pt Total 150pt

Introduction to Unconstrained Optimization: Part 2

Math 2400, Midterm 2

MA 113 Calculus I Spring 2013 Exam 3 09 April Multiple Choice Answers VERSION 1. Question

Midterm exam CS 189/289, Fall 2015

ISM206 Lecture Optimization of Nonlinear Objective with Linear Constraints

Lecture 10: October 27, 2016

Page Points Score Total: 100

Optimization Methods

4 damped (modified) Newton methods

MA 113 Calculus I Fall 2013 Exam 3 Tuesday, 19 November Multiple Choice Answers. Question

Motivation: We have already seen an example of a system of nonlinear equations when we studied Gaussian integration (p.8 of integration notes)

Math 131 Exam 1 October 4, :00-9:00 p.m.

There are six more problems on the next two pages

Comprehensive Exam in Real Analysis Fall 2006 Thursday September 14, :00-11:30am INSTRUCTIONS

MTH 133 Final Exam Dec 8, 2014

University of Connecticut Department of Mathematics

Unconstrained optimization

University of Connecticut Department of Mathematics

Math 111 Exam 1. Instructions

Two hours. To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER. xx xxxx 2017 xx:xx xx.

Mark your answers ON THE EXAM ITSELF. If you are not sure of your answer you may wish to provide a brief explanation.

AM 205: lecture 18. Last time: optimization methods Today: conditions for optimality

Math 104 Section 2 Midterm 2 November 1, 2013

Methods for Unconstrained Optimization Numerical Optimization Lectures 1-2

5. Hand in the entire exam booklet and your computer score sheet.

A.P. Calculus BC Test Three Section Two Free-Response No Calculators Time 45 minutes Number of Questions 3

Page Problem Score Max Score a 8 12b a b 10 14c 6 6

Numerical solutions of nonlinear systems of equations

MATH 120 THIRD UNIT TEST

Examination paper for TMA4180 Optimization I

Q1 Q2 Q3 Q4 Tot Letr Xtra

Caculus 221. Possible questions for Exam II. March 19, 2002

LECTURE 22: SWARM INTELLIGENCE 3 / CLASSICAL OPTIMIZATION

5.) For each of the given sets of vectors, determine whether or not the set spans R 3. Give reasons for your answers.

Scientific Computing II

Gradient Descent. Dr. Xiaowei Huang

Sample questions for Fundamentals of Machine Learning 2018

PHYS 314 FIRST HOUR EXAM

1. Background: The SVD and the best basis (questions selected from Ch. 6- Can you fill in the exercises?)

STUDENT NAME: STUDENT SIGNATURE: STUDENT ID NUMBER: SECTION NUMBER RECITATION INSTRUCTOR:

Transcription:

ECE580 Exam 1 October 4, 2012 1 Name: Solution Score: /100 You must show ALL of your work for full credit. This exam is closed-book. Calculators may NOT be used. Please leave fractions as fractions, etc. I do not want the decimal equivalents. Cell phones and other electronic communication devices must be turned off and stowed under your desk. Please do not write on the back of the exam pages. Extra paper is available from the instructor. 1 2 3 4 5 6 7 8 9 10

ECE580 Exam 1 October 4, 2012 2 1. (8 points) Consider the following matrices. A 1 = 1 0 0 7 ], A 2 = 1 0 0 0 ], A 3 = 1 0 0 7 ], A 4 = 1 0 0 7 ]. (a) State the definition of positive definiteness of a quadratic form x T Ax. The quadratic form x T Ax is positive definite if for all x, x T Ax 0 and x T Ax = 0 iff x = 0. (b) Which (if any) of the matrices listed above are negative definite (and why)? A 4 is negative definite because it is symmetric and all of its eigenvalues are negative. (c) Which (if any) of the matrices are positive semidefinite (and why)? A 2 and A 3 are positive semidefinite because they are symmetric and all of its eigenvalues are nonnegative. (d) Which matrices (if any) are indefinite (and why)? A 1 is indefinite because it is symmetric and has both positive and negative eigenvalues.

ECE580 Exam 1 October 4, 2012 3 2. (12 points) Determine whether f(x) has one or more local minimizers x, and, if it does, determine the x. f(x 1, x 2 ) = x 3 1 + 2x 1 x 2 + 3x 2 2 + 3x 2 We are given no constraints on feasible values so Ω = R 2 and all points of Ω are interior points. Thus, in order to satisfy the first order necessary condition (FONC), we need f(x ) = 0. f(x ) = 12(x 1) 2 + 2x 2 + 1 2x 1 + 6x 2 requires (second row) x 2 = x 1/3, and (first row) Substituting for x 2, we have 12(x 1) 2 + 2x 2 + 1 = 0. 12(x 1) 2 2x 1/3 + 1 = 0. The roots of this quadratic equation are x 1 = 2/3 ± 4/9 48, 24 which are complex, so f(x) has no real minimizers.

ECE580 Exam 1 October 4, 2012 4 3. (8 points) Suppose we wish to use a fixed step gradient method to find the minimum of the function f(x) = x T Ax where (a) Give the formula for x (k+1). A = 2 1 0 0 2 0 0 0 1. x (k+1) = x (k) α f(x (k) ). (b) What is the upper bound on the step size α to guarantee convergence? The upper bound is given by α < 2 λ max (A) = 1.

ECE580 Exam 1 October 4, 2012 5 4. (12 points) Given the function f(x 1, x 2 ) = x 3 2 + x 2 1 x 2 + 1 (a) Find any points that satisfy the first order necessary condition. There are no restrictions on the set of feasible points Ω so Ω = R 2. Thus all points are interior points of Ω and the appropriate FONC requires that f(x ) = 0. The gradient, evaluated at x is f(x ) = 2x 1 3(x 2) 2 1 so we need x 1 = 0 and x 2 = ± 1/3., (b) Find any points that satisfy the second order sufficient condition. The second order necessary condition for interior points requires that in addition to satisfying the FONC, that the Hessian F (x ) be positive semidefinite. Here F (x ) = 2 0 0 6x 2 so we need x 2 0 which is satisfied only by the point x = (0, 1/3). (c) Identify any local minimizers. The second order sufficient condition requires the Hessian evaluated at x to be positive definite, which it is not, so the function has no minimizers.

ECE580 Exam 1 October 4, 2012 6 5. (12 points) If a constraint set Ω is bounded below by y = x 3 and above by y = x 2 + 2, determine whether each of the following points is an interior point, a boundary point, or is not in Ω. (Justify your answers.) (a) (1, 3) 1 3 = 2 < 3 and 1 2 + 2 = 1 < 3. This means that the point (1, 3) is above both curves, thus not in Ω. (b) (0, 3) 0 3 = 3 = 3 and 0 2 + 2 = 2 > 3. This means that the point (0, 2) is on the line y = x 3 and below y = x 2 +2, so the point is a boundary point of Ω. (c) ( 1, 3) 1 3 = 4 < 3 and 1 2 + 2 = 1 > 3. This means that the point ( 1, 3) is above the line and below y = x 2 + 2, so the point is an interior point of Ω.

ECE580 Exam 1 October 4, 2012 7 6. (12 points) Given a point x = 1 0 ] T and the function f(x 1, x 2 ) = x 3 2 + x 2 1 x 2 + 1. (a) Find the gradient at the given point. f 1 0 = 2(1) 3(0) 2 1 = 2 1 (b) Find the rate of increase of the function at the given point. The rate of increase of the function at the given point is f(x) T d d = 2d 1 d 2 d 2 1 + d 2 2 (c) Find the equation of the plane tangent to the surface at the given point. In the case that f(x) 0, equation of the tangent plane at a point x 0 = 1 0 ] T is f(x 0 ) T (x x 0 ) = 0. Thus the equation for the tangent plane at x 0 2 1 ] x 1 1 x 2 = 2(x 1 1) x 2 = 0. is

ECE580 Exam 1 October 4, 2012 8 7. (8 points) Given initial point x (0) = 2 and the function f(x) = x 3 x 2 x + 1, find x (1) using Newton s method for finding a minimizer of f. In order to apply Newton s method, we will need the first and second derivatives of f evaluated at x 0 : f (x 0 ) = 3x 2 0 2x 0 1 = 12 4 1 = 7, f (x 0 ) = 6x 0 2 = 12 2 = 10. Now applying Newton s method we obtain x (1) = x (0) f (x (0) ) f (x (0) ) = 2 7/10 = 13/10.

ECE580 Exam 1 October 4, 2012 9 8. (8 points) Given initial point x (0) = 2 and the equation f(x) = x 3 x 2 x + 1 = 0, find x (1) using Newton s method of tangents for finding a root of f. The formula for the update in the method of tangents is x (k+1) = x (k) f(x(k) ) f (x (k) ). The derivative is f (x) = 3x 2 2x 1. Thus x (1) = x (0) 23 2 2 2 + 1 3(2) 2 2(2) 1 = 2 3/7 = 11/7.

ECE580 Exam 1 October 4, 2012 10 9. (8 points) Given initial points x (0) = 2 and x ( 1) = 1 and the equation f(x) = x 3 x 2 x + 1, find x (1) using the secant method for finding a minimizer of f. The secant method update algorithm is The derivative is Thus x (1) x (k+1) = x (k) x (k) x (k 1) f (x (k) ) f (x (k 1) ) f (x (k) ). f (x) = 3x 2 2x 1. 2 1 = 2 (3(2) 2 2(2) 1) (3(1) 2 2(1) 1) (3(2)2 2(2) 1) = 2 1 7 0 7 = 2 1 = 1.

ECE580 Exam 1 October 4, 2012 11 10. (12 points) Given an initial point x (0) = 1 1 f(x 1, x 2 ) = x 3 2 + x 2 1 x 2 + 1, ] T and the equation find x (1) using the steepest descent method for finding a minimizer of f. Gradient descent methods have the form x (k+1) = x (k) α k f(x (k) ). The method of steepest descent uses α k = arg min α 0 f ( x (k) α f(x (k) ) ). The gradient evaluated at x (0) f x=x (0) = is 2x 1 3x 2 2 1 x=x (0) = 2 2. Evaluating the right-hand side of the expression for α k yields α k = arg min α 0 8α 2 8α 2 8α + 2. Taking the derivative and equating it to zero we find that the critical points occur at 1± 2 so the expression has no minimum. Thus we need to try a different x (0) or a different method.