ORF 523 Final Exam, Spring 2016
|
|
- Claude Evan Baldwin
- 6 years ago
- Views:
Transcription
1 Name: Princeton University ORF 523 Final Exam, Spring 2016 Thursday, May 5, 9am, to Tuesday, May 10, 11am Instructor: A.A. Ahmadi AI: G. Hall 1. Please write out and sign the following pledge on top of the first page of your exam: I pledge my honor that I have not violated the Honor Code or the rules specified by the instructor during this assignment. 2. Don t forget to write your name. Make a copy of your solutions and keep it. 3. The assignment is not to be discussed with anyone except possibly the professor and the TA. You can only ask clarification questions as public questions on Piazza. 4. You are allowed to consult the lecture notes, your own notes, the recommended textbooks of the course, the problem sets and their solutions (yours and ours), the midterm exams and their solutions (yours and ours), but nothing else. You can only use the Internet in case you run into problems related to MATLAB, CVX or YALMIP. (There should be no need for that either hopefully.) 5. For all problems involving MATLAB, CVX, or YALMIP, show your code. The MATLAB output that you present should come from your code. 6. The assignment is to be turned in before Tuesday, May 10, at 11 AM in the box for ORF 523 in Sherrerd 123. Please time stamp your exam (just write the time of drop off and sign it). If you are away, you can a single PDF file to the instructor and the AI. 7. Good luck!
2 Grading Problem 1 20 pts Problem 2 20 pts Problem 3 20 pts Problem 4 20 pts Problem 5 20 pts TOTAL 100 1
3 Problem 1: To cheat or not to cheat? A professor gives out a 5-day take-home final exam to the students in his graduate course. 1 Though they have signed an honor pledge not to cheat, some students (unlike the ones at Princeton) are tempted to search on Google for answers to the exam questions. To discourage them from doing this, the professor has collected a set of aggregate data points (x i, y i ) from students of past years, where x i is the fraction of time spent on Google throughout the exam and y i is the average grade (out of 100) received as a result. These data points are as follows: {(0, 85), (0.15, 50), (0.30, 43), (0.45, 42), (0.6, 39), (0.75, 35), (0.9, 25)}. The statistician colleagues of this professor have performed some model selection hackery and learned that the relationship between x and y is best described by a degree-3 polynomial p(x) = c 0 + c 1 x + c 2 x 2 + c 3 x 3. They have also argued, very convincingly, that the exam grade is a nonincreasing function of the fraction of time spent on the Internet. 1. Fit a cubic polynomial to the data such that least squares error, i.e., 7 (p(x i ) y i ) 2 (1) i=1 is minimized. Report the optimal value as well as the optimal polynomial and plot both the data points and your polynomial on the same graph. Notice that the data that was given to you is nonincreasing. Is the optimal function you found nonincreasing? 2. Show that a quadratic univariate polynomial p is nonnegative on an interval [a, b], a < b, if and only if p(x) = s(x) + λ(x a) (b x) for some λ 0 and some sum of squares polynomial s(x) of degree Solve a new optimization problem with objective (1) but with the additional constraint that your polynomial should be nonincreasing over [0, 1]. Report the optimal value as well as the optimal polynomial and plot both the data points and your polynomial on the same graph. 2 1 All characters appearing in this question are fictitious. Any resemblance to real persons, living or dead, is purely coincidental. 2 We wonder what reverse engineering we ll be able to do with your polynomial? ;) 2
4 Problem 2: Complexity of SDP feasibility Consider the following decision problem: Given A i S n n, b i R, i = 1,..., m, all with rational entries, decide if there exists a matrix X S n n such that Tr(A i X) = b i, X 0. Determining the complexity of this question is one of the main outstanding open problem in semidefinite programming. At the moment, the problem is not even known to be in NP One may be tempted to conclude that the problem is in NP because if the SDP is feasible, then we can just write down a solution and check its validity (testing positive semidefiniteness of a given n n matrix can be done in O(n 3 )). Produce a family of SDP feasibility problems where any feasible solution takes an exponential number of bits to write down with respect to the input size. (You don t need to put your SDP family in the standard form given above.) 2. Produce a family of SOCP feasibility problems where any feasible solution takes an exponential number of bits to write down with respect to the input size. Hint: See if you can make your SDP problems involve only 2 2 matrices. 3. Here is another shockingly simple problem whose complexity is unknown: Given positive integers a 1,..., a r, k, decide if a1 + + a r k. Show that if SDP feasibility is in NP (resp. P), then this problem is in NP (resp. P). Problem 3: Convex optimization on Princeton s campus In the file princetoncampus.png, you can see a bird s eye view of campus with the 6 undergraduate residential colleges, and Dillon gym, marked by crosses. Open this image in Matlab using the following code once you have added the image to your Matlab path: 1 c o l l e g e s = imread ( princetoncampus. png ) ; 2 imshow ( c o l l e g e s, I n i t i a l M a g n i f i c a t i o n,50) 3 hold on 3 Contrast this with testing LP feasibility, which is in P, and with the fact that we can solve SDPs to arbitrary accuracy in polynomial time. 3
5 We have placed a grid (a coordinate system) on the image with (0, 0) in the lower left corner. On this grid, the colleges have the following coordinates: z1 = (11, 10) for Forbes z2 = (22, 15) for Whitman z3 = (30, 20) for the regroupment Butler-Wilson z4 = (10, 34) for the regroupment Rockfeller-Mathey Dillon gym has coordinates z5 = (18.5, 21.5). The Matlab file Circledraw.m attached will enable you to plot a circle on this map of campus by using the command Circledraw(x,y,r, color ) where (x, y) are the coordinates of the center of the circle in this new coordinate system, r is its radius, and color its color. The goal in this problem is to find the optimal location of a new gym that minimizes the sum of the squares of distances to the colleges under the following constraints: Case 1: The distance from the new gym to a fire hose located at (30, 30) must be no more than 8. 4
6 Case 2: The distance from the new gym to Dillon gym must be no less than 8. Case 3: The new gym must simultaneously be at a distance no greater than 8 from the fire hose but no less than 8 from Dillon gym. In each case, answer the following questions: 1. Is the original problem formulation convex? 2. Report the optimal location using CVX. Plot the optimal solution and the boundary of the feasible set on the map. Hint: When appropriate, try and apply an SDP formulaion or an SDP relaxation. Problem 4: Nonnegativity on the simplex Consider the following parametric quadratic function in 4 variables f c (x) := x T Q c x + b T x + r, where x = (x 1, x 2, x 3, x 4 ) T, 9 3/ /2 8 5/2 c 1/2 ( T Q c = 3 5/2 1 9, b = ), r = 2. 2 c 1/2 9 4 Find the smallest value of c (up to 2 digits after the decimal point) for which f c (x) 0 for any x on the simplex (i.e., the set {x R 4 4 i=1 x i = 1, x i 0, i = 1,..., 4}). Problem 5: Unconstrained minimization of a polynomial Consider the unconstrained optimization problem where p is a polynomial function. min. p(x), (2) x Rn 1. Show that if p has degree 4, testing if problem (2) is unbounded below is NP-hard. 2. Suppose the optimal value p of (2) is finite. Is the optimal value always achieved? (In other words, does there exist x R n such that p(x ) = p?) Why or why not? 3. In class, we showed that if a (not necessarily polynomial) objective function is radially unbounded (i.e., if p(x) + when x + ), then its unconstrained minimum is achieved. unbounded is NP-hard. Show that testing if a multivariate polynomial of degree 4 is radially 5
ORF 363/COS 323 Final Exam, Fall 2018
Name: Princeton University ORF 363/COS 323 Final Exam, Fall 2018 January 16, 2018 Instructor: A.A. Ahmadi AIs: Dibek, Duan, Gong, Khadir, Mirabelli, Pumir, Tang, Yu, Zhang 1. Please write out and sign
More informationORF 363/COS 323 Final Exam, Fall 2016
Name: Princeton University Instructor: A.A. Ahmadi ORF 363/COS 323 Final Exam, Fall 2016 January 18, 2017 AIs: B. El Khadir, G. Hall, Z. Li, K. Wang, J. Ye, J. Zhang 1. Please write out and sign the following
More informationORF 363/COS 323 Final Exam, Fall 2015
Name: Princeton University ORF 363/COS 323 Final Exam, Fall 2015 January 13, 2016 Instructor: AIs: A.A. Ahmadi G. Hall, H. Hao, J. Ye, Z. Zhu 1. Please write out and sign the following pledge on top of
More informationORF 363/COS 323 Final Exam, Fall 2017
Name: Princeton University Instructor: A.A. Ahmadi ORF 363/COS 323 Final Exam, Fall 2017 January 17, 2018 AIs: B. El Khadir, C. Dibek, G. Hall, J. Zhang, J. Ye, S. Uysal 1. Please write out and sign the
More information1 Strict local optimality in unconstrained optimization
ORF 53 Lecture 14 Spring 016, Princeton University Instructor: A.A. Ahmadi Scribe: G. Hall Thursday, April 14, 016 When in doubt on the accuracy of these notes, please cross check with the instructor s
More informationToday s class. Constrained optimization Linear programming. Prof. Jinbo Bi CSE, UConn. Numerical Methods, Fall 2011 Lecture 12
Today s class Constrained optimization Linear programming 1 Midterm Exam 1 Count: 26 Average: 73.2 Median: 72.5 Maximum: 100.0 Minimum: 45.0 Standard Deviation: 17.13 Numerical Methods Fall 2011 2 Optimization
More informationLimits of Computation + Course Recap
Limits of Computation + Course Recap ORF 363/COS 323 Instructor: Amir Ali Ahmadi TAs: Y. Chen, G. Hall, J. Ye Fall 2014 1 Reminder: NP-hard and NP-complete problems Definition. A decision problem is said
More informationORF 523. Finish approximation algorithms + Limits of computation & undecidability + Concluding remarks
Finish approximation algorithms + Limits of computation & undecidability + Concluding remarks ORF 523 Lecture 19 Instructor: Amir Ali Ahmadi, TA: G. Hall, Spring 2016 1 Convex relaxations with worst-case
More informationLimits of Computation + Course Recap
Limits of Computation + Course Recap ORF 363/COS 323 Instructor: Amir Ali Ahmadi TAs: G. Hall, H. Hao, J. Ye, Z. Zhu Fall 2015 1 Reminder: NP-hard and NP-complete problems Definition. A decision problem
More information1 The independent set problem
ORF 523 Lecture 11 Spring 2016, Princeton University Instructor: A.A. Ahmadi Scribe: G. Hall Tuesday, March 29, 2016 When in doubt on the accuracy of these notes, please cross chec with the instructor
More informationCS173 Lecture B, November 3, 2015
CS173 Lecture B, November 3, 2015 Tandy Warnow November 3, 2015 CS 173, Lecture B November 3, 2015 Tandy Warnow Announcements Examlet 7 is a take-home exam, and is due November 10, 11:05 AM, in class.
More informationEXAM # 3 PLEASE SHOW ALL WORK!
Stat 311, Summer 2018 Name EXAM # 3 PLEASE SHOW ALL WORK! Problem Points Grade 1 30 2 20 3 20 4 30 Total 100 1. A socioeconomic study analyzes two discrete random variables in a certain population of households
More informationMath 110 (Fall 2018) Midterm II (Monday October 29, 12:10-1:00)
Math 110 (Fall 2018) Midterm II (Monday October 29, 12:10-1:00) Name: SID: Please write clearly and legibly. Justify your answers. Partial credits may be given to Problems 2, 3, 4, and 5. The last sheet
More informationMath 1: Calculus with Algebra Midterm 2 Thursday, October 29. Circle your section number: 1 Freund 2 DeFord
Math 1: Calculus with Algebra Midterm 2 Thursday, October 29 Name: Circle your section number: 1 Freund 2 DeFord Please read the following instructions before starting the exam: This exam is closed book,
More informationCOS 341: Discrete Mathematics
COS 341: Discrete Mathematics Final Exam Fall 2006 Print your name General directions: This exam is due on Monday, January 22 at 4:30pm. Late exams will not be accepted. Exams must be submitted in hard
More informationEE364a: Convex Optimization I March or March 12 13, Final Exam
EE364a: Convex Optimization I March 11 12 or March 12 13, 2016 S. Boyd Final Exam This is a 24-hour take-home final. Please turn it in at Bytes Cafe in the Packard building, 24 hours after you pick it
More informationLynch, October 2016 Page 1 of 5. Math 150, Fall 2016 Exam 2 Form A Multiple Choice Sections 3A-5A
Lynch, October 2016 Page 1 of 5 Math 150, Fall 2016 Exam 2 Form A Multiple Choice Sections 3A-5A Last Name: First Name: Section Number: Student ID number: Directions: 1. No calculators, cell phones, or
More informationUse the Rational Zero Theorem to list all the possible rational zeros of the following polynomials. (1-2) 4 3 2
Name: Math 114 Activity 1(Due by EOC Apr. 17) Dear Instructor or Tutor, These problems are designed to let my students show me what they have learned and what they are capable of doing on their own. Please
More information10725/36725 Optimization Homework 4
10725/36725 Optimization Homework 4 Due November 27, 2012 at beginning of class Instructions: There are four questions in this assignment. Please submit your homework as (up to) 4 separate sets of pages
More informationLynch 2017 Page 1 of 5. Math 150, Fall 2017 Exam 1 Form A Multiple Choice
Lynch 017 Page 1 of 5 Math 150, Fall 017 Exam 1 Form A Multiple Choice Last Name: First Name: Section Number: Student ID number: Directions: 1. No calculators, cell phones, or other electronic devices
More informationMidterm. Introduction to Machine Learning. CS 189 Spring Please do not open the exam before you are instructed to do so.
CS 89 Spring 07 Introduction to Machine Learning Midterm Please do not open the exam before you are instructed to do so. The exam is closed book, closed notes except your one-page cheat sheet. Electronic
More informationSpring 2017 CO 250 Course Notes TABLE OF CONTENTS. richardwu.ca. CO 250 Course Notes. Introduction to Optimization
Spring 2017 CO 250 Course Notes TABLE OF CONTENTS richardwu.ca CO 250 Course Notes Introduction to Optimization Kanstantsin Pashkovich Spring 2017 University of Waterloo Last Revision: March 4, 2018 Table
More information1 Robust optimization
ORF 523 Lecture 16 Princeton University Instructor: A.A. Ahmadi Scribe: G. Hall Any typos should be emailed to a a a@princeton.edu. In this lecture, we give a brief introduction to robust optimization
More informationClass Note #20. In today s class, the following four concepts were introduced: decision
Class Note #20 Date: 03/29/2006 [Overall Information] In today s class, the following four concepts were introduced: decision version of a problem, formal language, P and NP. We also discussed the relationship
More informationMATH COURSE TITLE: College Algebra
MATH 1314 INSTRUCTOR: Alan Roemer Email Address: droemer@wc.edu; aroemer@weatherfordisd.com Cell phone: 817-988-7987 Office Hours: Mornings - Everyday: 7:40 8:10 Megalunch - Friday B Block 11:11 11:42
More informationConvex envelopes, cardinality constrained optimization and LASSO. An application in supervised learning: support vector machines (SVMs)
ORF 523 Lecture 8 Princeton University Instructor: A.A. Ahmadi Scribe: G. Hall Any typos should be emailed to a a a@princeton.edu. 1 Outline Convexity-preserving operations Convex envelopes, cardinality
More information1.1 Administrative Stuff
601.433 / 601.633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Introduction, Karatsuba/Strassen Date: 9/4/18 1.1 Administrative Stuff Welcome to Algorithms! In this class you will learn the
More informationThe PRIMES 2014 problem set
Dear PRIMES applicant! The PRIMES 24 problem set This is the PRIMES 24 problem set. Please send us your solutions as part of your PRIMES application by December, 24. For complete rules, see http://web.mit.edu/primes/apply.shtml
More informationJEFFERSON COLLEGE COURSE SYLLABUS MTH 110 INTRODUCTORY ALGEBRA. 3 Credit Hours. Prepared by: Skyler Ross & Connie Kuchar September 2014
JEFFERSON COLLEGE COURSE SYLLABUS MTH 110 INTRODUCTORY ALGEBRA 3 Credit Hours Prepared by: Skyler Ross & Connie Kuchar September 2014 Ms. Linda Abernathy, Math, Science, & Business Division Chair Ms. Shirley
More informationEE263 Midterm Exam. This is a 24 hour take-home midterm. Please turn it in at Bytes Cafe in the Packard building, 24 hours after you pick it up.
EE263 Midterm Exam This is a 24 hour take-home midterm. Please turn it in at Bytes Cafe in the Packard building, 24 hours after you pick it up. You may use any books, notes, or computer programs (e.g.,
More informationMultiple Choice. (c) 1 (d)
Multiple Choice.(5 pts.) Find the sum of the geometric series n=0 ( ) n. (c) (d).(5 pts.) Find the 5 th Maclaurin polynomial for the function f(x) = sin x. (Recall that Maclaurin polynomial is another
More informationLynch 2017 Page 1 of 5. Math 150, Fall 2017 Exam 2 Form A Multiple Choice
Lynch 2017 Page 1 of 5 Math 150, Fall 2017 Exam 2 Form A Multiple Choice Last Name: First Name: Section Number: Student ID number: Directions: 1. No calculators, cell phones, or other electronic devices
More informationMathematics 1 Lecture Notes Chapter 1 Algebra Review
Mathematics 1 Lecture Notes Chapter 1 Algebra Review c Trinity College 1 A note to the students from the lecturer: This course will be moving rather quickly, and it will be in your own best interests to
More informationQuinsigamond Community College School of Math and Science
Instructor's Information: Instructor: Office: Email: Telephone: 508-854-2400 Quinsigamond Community College School of Math and Science Course Information:
More informationLast/Family Name First/Given Name Seat # Exam # Failure to follow the instructions below will constitute a breach of the Honor Code:
Math 21, Winter 2018 Schaeffer/Solis Midterm Exam 2 (February 28th, 2018) Last/Family Name First/Given Name Seat # Exam # Failure to follow the instructions below will constitute a breach of the Honor
More informationCO 250 Final Exam Guide
Spring 2017 CO 250 Final Exam Guide TABLE OF CONTENTS richardwu.ca CO 250 Final Exam Guide Introduction to Optimization Kanstantsin Pashkovich Spring 2017 University of Waterloo Last Revision: March 4,
More informationPHYSICS 103 FINAL EXAM
19 Jan 08 Printed Name: Please Circle your Section! 9 am Jau 10 am Marino 9 am Garcia-Garcia 10 am Garcia-Garcia 9 am Ianni 10 am Ianni 9 am Rothman 10 am Rothman 9 am Yazdani 10 am Yazdani 9 am Yost 10
More information6.079/6.975 S. Boyd & P. Parrilo December 10 11, Final exam
6.079/6.975 S. Boyd & P. Parrilo December 10 11, 2009. Final exam This is a 24 hour take-home final exam. Please turn it in to Professor Stephen Boyd, (Stata Center), on Friday December 11, at 5PM (or
More informationUniversity of Illinois at Chicago Department of Computer Science. Final Examination. CS 151 Mathematical Foundations of Computer Science Fall 2012
University of Illinois at Chicago Department of Computer Science Final Examination CS 151 Mathematical Foundations of Computer Science Fall 01 Thursday, October 18, 01 Name: Email: Print your name and
More informationMATH 5524 MATRIX THEORY Pledged Problem Set 2
MATH 5524 MATRIX THEORY Pledged Problem Set 2 Posted Tuesday 25 April 207 Due by 5pm on Wednesday 3 May 207 Complete any four problems, 25 points each You are welcome to complete more problems if you like,
More informationLimits of Computation + Course Recap
Limits of Computation + Course Recap ORF 363/COS 323 Instructor: Amir Ali Ahmadi 1 Reminder: NP-hard and NP-complete problems Definition. A decision problem is said to be NP-hard if every problem in NP
More informationORF 245 Fundamentals of Engineering Statistics. Final Exam
Princeton University Department of Operations Research and Financial Engineering ORF 45 Fundamentals of Engineering Statistics Final Exam May 15, 009 1:30pm-4:30pm PLEASE DO NOT TURN THIS PAGE AND START
More informationInteger-Valued Polynomials
Integer-Valued Polynomials LA Math Circle High School II Dillon Zhi October 11, 2015 1 Introduction Some polynomials take integer values p(x) for all integers x. The obvious examples are the ones where
More informationHONORS LINEAR ALGEBRA (MATH V 2020) SPRING 2013
HONORS LINEAR ALGEBRA (MATH V 2020) SPRING 2013 PROFESSOR HENRY C. PINKHAM 1. Prerequisites The only prerequisite is Calculus III (Math 1201) or the equivalent: the first semester of multivariable calculus.
More informationLast/Family Name First/Given Name Seat # Exam # Failure to follow the instructions below will constitute a breach of the Honor Code:
Math 21, Winter 2018 Schaeffer/Solis Midterm Exam 2 (February 28th, 2018) Last/Family Name First/Given Name Seat # Exam # Failure to follow the instructions below will constitute a breach of the Honor
More informationCSCI 5654 (Linear Programming, Fall 2013) CSCI 5654: Linear Programming. Notes. Lecture-1. August 29, Notes
CSCI 5654 (Linear Programming, Fall 2013) Lecture-1 August 29, 2013 Lecture 1 Slide# 1 CSCI 5654: Linear Programming Instructor: Sriram Sankaranarayanan. Meeting times: Tuesday-Thursday, 12:30-1:45 p.m.
More informationPart I 5. Part II 2. Part III 8. Part IV 10. Part V 5 TOTAL 30
Page 1 of 10 Name/SID SOLUTION UNIVERSITY OF CALIFORNIA, COLLEGE OF ENGINEERING E77: INTRODUCTION TO COMPUTER PROGRAMMINGFOR SCIENTISTS AND ENGINEERS Professor Raja Sengupta Spring 2007 2nd Midterm Exam
More informationMath 54 First Midterm Exam, Prof. Srivastava September 23, 2016, 4:10pm 5:00pm, 155 Dwinelle Hall.
Math 54 First Midterm Exam, Prof Srivastava September 23, 26, 4:pm 5:pm, 55 Dwinelle Hall Name: SID: Instructions: Write all answers in the provided space This exam includes two pages of scratch paper,
More informationCS1800 Discrete Structures Spring 2018 February CS1800 Discrete Structures Midterm Version A
CS1800 Discrete Structures Spring 2018 February 2018 CS1800 Discrete Structures Midterm Version A Instructions: 1. The exam is closed book and closed notes. You may not use a calculator or any other electronic
More informationPHYSICS 206, Spring 2019
PHYSICS 206, Spring 2019 Instructor: Gregory Christian Lecture times: TR 9:35 10:50, room MPHY 203 Office: MIST M320 Phone: 979-845-1411 Email: gchristian@tamu.edu Homepage: http://faculty.physics.tamu.edu/christian/teaching.html
More informationMath , Fall 2014 TuTh 12:30pm - 1:45pm MTH 0303 Dr. M. Machedon. Office: Math Office Hour: Tuesdays and
Math 411 0201, Fall 2014 TuTh 12:30pm - 1:45pm MTH 0303 Dr. M. Machedon. Office: Math 3311. Email mxm@math.umd.edu Office Hour: Tuesdays and Thursdays 2-3 Textbook: Advanced Calculus, Second Edition, by
More informationUC Berkeley, CS 174: Combinatorics and Discrete Probability (Fall 2008) Midterm 1. October 7, 2008
UC Berkeley, CS 74: Combinatorics and Discrete Probability (Fall 2008) Midterm Instructor: Prof. Yun S. Song October 7, 2008 Your Name : Student ID# : Read these instructions carefully:. This is a closed-book
More informationUniversity of New Mexico Department of Computer Science. Midterm Examination. CS 361 Data Structures and Algorithms Spring, 2003
University of New Mexico Department of Computer Science Midterm Examination CS 361 Data Structures and Algorithms Spring, 2003 Name: Email: Print your name and email, neatly in the space provided above;
More informationHKUST. MATH1013 Calculus IB. Directions:
HKUST MATH101 Calculus IB Midterm Eamination (Sample Version) Name: Student ID: Lecture Section: Directions: This is a closed book eamination. No Calculator is allowed in this eamination. DO NOT open the
More informationMath 164-1: Optimization Instructor: Alpár R. Mészáros
Math 164-1: Optimization Instructor: Alpár R. Mészáros First Midterm, April 20, 2016 Name (use a pen): Student ID (use a pen): Signature (use a pen): Rules: Duration of the exam: 50 minutes. By writing
More informationModule 04 Optimization Problems KKT Conditions & Solvers
Module 04 Optimization Problems KKT Conditions & Solvers Ahmad F. Taha EE 5243: Introduction to Cyber-Physical Systems Email: ahmad.taha@utsa.edu Webpage: http://engineering.utsa.edu/ taha/index.html September
More informationLec3p1, ORF363/COS323
Lec3 Page 1 Lec3p1, ORF363/COS323 This lecture: Optimization problems - basic notation and terminology Unconstrained optimization The Fermat-Weber problem Least squares First and second order necessary
More informationEcon 1123: Section 2. Review. Binary Regressors. Bivariate. Regression. Omitted Variable Bias
Contact Information Elena Llaudet Sections are voluntary. My office hours are Thursdays 5pm-7pm in Littauer Mezzanine 34-36 (Note room change) You can email me administrative questions to ellaudet@gmail.com.
More informationMA/OR/ST 706: Nonlinear Programming Midterm Exam Instructor: Dr. Kartik Sivaramakrishnan INSTRUCTIONS
MA/OR/ST 706: Nonlinear Programming Midterm Exam Instructor: Dr. Kartik Sivaramakrishnan INSTRUCTIONS 1. Please write your name and student number clearly on the front page of the exam. 2. The exam is
More informationA Working Knowledge of Computational Complexity for an Optimizer
A Working Knowledge of Computational Complexity for an Optimizer ORF 363/COS 323 Instructor: Amir Ali Ahmadi 1 Why computational complexity? What is computational complexity theory? It s a branch of mathematics
More informationSemidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5
Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5 Instructor: Farid Alizadeh Scribe: Anton Riabov 10/08/2001 1 Overview We continue studying the maximum eigenvalue SDP, and generalize
More informationMath 200D - Linear Algebra Fall Term 2017 Course Description
Math 200D - Linear Algebra Fall Term 2017 Course Description September 6, 2017 Instructor: John Schmitt Office: Warner 311, Tel: Ext. 5952 E-mail: jschmitt@middlebury.edu Office Hours: Monday 1:30pm-2:30pm,
More informationORF 523 Lecture 9 Spring 2016, Princeton University Instructor: A.A. Ahmadi Scribe: G. Hall Thursday, March 10, 2016
ORF 523 Lecture 9 Spring 2016, Princeton University Instructor: A.A. Ahmadi Scribe: G. Hall Thursday, March 10, 2016 When in doubt on the accuracy of these notes, please cross check with the instructor
More informationSpring /11/2009
MA 123 Elementary Calculus SECOND MIDTERM Spring 2009 03/11/2009 Name: Sec.: Do not remove this answer page you will return the whole exam. You will be allowed two hours to complete this test. No books
More informationChemistry Physical Chemistry I Fall 2017
Chemistry 309 - Physical Chemistry I Fall 2017 Instructor: Office Hours: Dr. Samuel A. Abrash C208 Gottwald Science Center Work: 289-8248 Home: 323-7363 Cell: 363-2597 sabrash@richmond.edu www.richmond.edu/~sabrash
More informationDSOS/SDOS Programming: New Tools for Optimization over Nonnegative Polynomials
DSOS/SDOS Programming: New Tools for Optimization over Nonnegative Polynomials Amir Ali Ahmadi Princeton University Dept. of Operations Research and Financial Engineering (ORFE) Joint work with: Anirudha
More informationCS 6820 Fall 2014 Lectures, October 3-20, 2014
Analysis of Algorithms Linear Programming Notes CS 6820 Fall 2014 Lectures, October 3-20, 2014 1 Linear programming The linear programming (LP) problem is the following optimization problem. We are given
More informationMAT01A1: Functions and Mathematical Models
MAT01A1: Functions and Mathematical Models Dr Craig 21 February 2017 Introduction Who: Dr Craig What: Lecturer & course coordinator for MAT01A1 Where: C-Ring 508 acraig@uj.ac.za Web: http://andrewcraigmaths.wordpress.com
More informationMTH 163, Sections 40 & 41 Precalculus I FALL 2015
MTH 163, Sections 40 & 41 Precalculus I FALL 2015 Instructor Name : Mrs. Donna M. Ratliff Office Number: Room 217 Office Phone Number: (434) 946-2898 Email: dmratliff@amherst.k12.va.us Office Hours: Before
More informationTake-Home Exam 1: pick up on Thursday, June 8, return Monday,
SYLLABUS FOR 18.089 1. Overview This course is a review of calculus. We will start with a week-long review of single variable calculus, and move on for the remaining five weeks to multivariable calculus.
More informationC if U can. Algebra. Name
C if U can Algebra Name.. How will this booklet help you to move from a D to a C grade? The topic of algebra is split into six units substitution, expressions, factorising, equations, trial and improvement
More informationMath 70 and 95 Master Syllabus Beginning and Intermediate Algebra, 5th ed., Miller, O Neill, Hyde with ALEKS.
Math 70 and 95 Master Syllabus 2017-2018 Course Coordinator: Tammy Nezol (tnezol@uoregon.edu) Textbook and ALEKS: Beginning and Intermediate Algebra, 5th ed., Miller, O Neill, Hyde with ALEKS. We have
More informationLec7p1, ORF363/COS323
Lec7 Page 1 Lec7p1, ORF363/COS323 This lecture: One-dimensional line search (root finding and minimization) Bisection Newton's method Secant method Introduction to rates of convergence Instructor: Amir
More informationDecember 2014 MATH 340 Name Page 2 of 10 pages
December 2014 MATH 340 Name Page 2 of 10 pages Marks [8] 1. Find the value of Alice announces a pure strategy and Betty announces a pure strategy for the matrix game [ ] 1 4 A =. 5 2 Find the value of
More informationMA EXAM 3 INSTRUCTIONS VERSION 01 April 14, Section # and recitation time
MA 16600 EXAM 3 INSTRUCTIONS VERSION 01 April 14, 2015 Your name Student ID # Your TA s name Section # and recitation time 1. You must use a #2 pencil on the scantron sheet (answer sheet). 2. Check that
More informationMachine Learning, Fall 2009: Midterm
10-601 Machine Learning, Fall 009: Midterm Monday, November nd hours 1. Personal info: Name: Andrew account: E-mail address:. You are permitted two pages of notes and a calculator. Please turn off all
More informationData Structure and Algorithm Homework #1 Due: 2:20pm, Tuesday, March 12, 2013 TA === Homework submission instructions ===
Data Structure and Algorithm Homework #1 Due: 2:20pm, Tuesday, March 12, 2013 TA email: dsa1@csie.ntu.edu.tw === Homework submission instructions === For Problem 1, submit your source code, a Makefile
More informationCDS Final Exam
CDS 22 - Final Exam Instructor: Danielle C. Tarraf December 4, 2007 INSTRUCTIONS : Please read carefully! () Description & duration of the exam: The exam consists of 6 problems. You have a total of 24
More informationGOOD LUCK! 2. a b c d e 12. a b c d e. 3. a b c d e 13. a b c d e. 4. a b c d e 14. a b c d e. 5. a b c d e 15. a b c d e. 6. a b c d e 16.
MA109 College Algebra Spring 017 Exam1 017-0-08 Name: Sec.: Do not remove this answer page you will turn in the entire exam. You have two hours to do this exam. No books or notes may be used. You may use
More informationMidterm II. Introduction to Artificial Intelligence. CS 188 Spring ˆ You have approximately 1 hour and 50 minutes.
CS 188 Spring 2013 Introduction to Artificial Intelligence Midterm II ˆ You have approximately 1 hour and 50 minutes. ˆ The exam is closed book, closed notes except a one-page crib sheet. ˆ Please use
More informationOptimization Methods in Management Science
Optimization Methods in Management Science MIT 15.05 Recitation 8 TAs: Giacomo Nannicini, Ebrahim Nasrabadi At the end of this recitation, students should be able to: 1. Derive Gomory cut from fractional
More informationJune If you want, you may scan your assignment and convert it to a.pdf file and it to me.
Summer Assignment Pre-Calculus Honors June 2016 Dear Student: This assignment is a mandatory part of the Pre-Calculus Honors course. Students who do not complete the assignment will be placed in the regular
More informationMath 060/070 PAL: Elementary and Intermediate Algebra Spring 2016
Math 060/070 PAL: Elementary and Intermediate Algebra Spring 016 Instructor Dr. Ruzanna Baytaryan Office HSLH 341 Phone 661-36-5916 Office Hours Email MW :30PM-4:30PM or by appointment Ruzanna.baytaryan@canyons.edu
More informationProblem Point Value Points
Math 70 TUFTS UNIVERSITY October 12, 2015 Linear Algebra Department of Mathematics Sections 1 and 2 Exam I Instructions: No notes or books are allowed. All calculators, cell phones, or other electronic
More informationCS483 Design and Analysis of Algorithms
CS483 Design and Analysis of Algorithms Lecture 1 Introduction and Prologue Instructor: Fei Li lifei@cs.gmu.edu with subject: CS483 Office hours: Room 5326, Engineering Building, Thursday 4:30pm - 6:30pm
More informationCOS 341: Discrete Mathematics
COS 341: Discrete Mathematics Midterm Exam Fall 2006 Print your name General directions: This exam is due on Monday, November 13 at 4:30pm. Late exams will not be accepted. Exams must be submitted in hard
More information6.079/6.975 S. Boyd & P. Parrilo October 29 30, Midterm exam
6.079/6.975 S. Boyd & P. Parrilo October 29 30, 2009. Midterm exam This is a 24 hour take-home midterm exam. Please turn it in to Professor Pablo Parrilo, (Stata Center), on Friday October 30, at 5PM (or
More informationModesto Junior College Course Outline of Record MATH 122
Modesto Junior College Course Outline of Record MATH 122 I. OVERVIEW The following information will appear in the 2009-2010 catalog MATH 122 Pre-Calculus 2 5 Units Together with MATH 121, a two-semester
More informationTest 3 - Answer Key Version B
Student s Printed Name: Instructor: CUID: Section: Instructions: You are not permitted to use a calculator on any portion of this test. You are not allowed to use any textbook, notes, cell phone, laptop,
More informationCS 170 Algorithms Fall 2014 David Wagner MT2
CS 170 Algorithms Fall 2014 David Wagner MT2 PRINT your name:, (last) SIGN your name: (first) Your Student ID number: Your Unix account login: cs170- The room you are sitting in right now: Name of the
More informationHonors Advanced Algebra Unit 3: Polynomial Functions October 28, 2016 Task 10: Factors, Zeros, and Roots: Oh My!
Honors Advanced Algebra Name Unit 3: Polynomial Functions October 8, 016 Task 10: Factors, Zeros, and Roots: Oh My! MGSE9 1.A.APR. Know and apply the Remainder Theorem: For a polynomial p(x) and a number
More informationSecondary Math 3 Honors - Polynomial and Polynomial Functions Test Review
Name: Class: Date: Secondary Math 3 Honors - Polynomial and Polynomial Functions Test Review 1 Write 3x 2 ( 2x 2 5x 3 ) in standard form State whether the function is even, odd, or neither Show your work
More informationTest 3 Version A. On my honor, I have neither given nor received inappropriate or unauthorized information at any time before or during this test.
Student s Printed Name: Instructor: CUID: Section: Instructions: You are not permitted to use a calculator on any portion of this test. You are not allowed to use any textbook, notes, cell phone, laptop,
More informationMCE/EEC 647/747: Robot Dynamics and Control. Lecture 8: Basic Lyapunov Stability Theory
MCE/EEC 647/747: Robot Dynamics and Control Lecture 8: Basic Lyapunov Stability Theory Reading: SHV Appendix Mechanical Engineering Hanz Richter, PhD MCE503 p.1/17 Stability in the sense of Lyapunov A
More informationLinear Algebra. Instructor: Justin Ryan
Linear Algebra Instructor: Justin Ryan ryan@math.wichita.edu Department of Mathematics, Statistics, and Physics Wichita State University Wichita, Kansas Summer 2014 DRAFT 3 June 2014 Preface These lecture
More informationMATH 445/545 Test 1 Spring 2016
MATH 445/545 Test Spring 06 Note the problems are separated into two sections a set for all students and an additional set for those taking the course at the 545 level. Please read and follow all of these
More informationMath 410 Linear Algebra Summer Session American River College
Course Information Instructor: Kristin Lui Email: luik@arc.losrios.edu Office Hours: By appointment Location: Liberal Arts 163 ARC Main Campus Meet Times: Tuesday/Thursday 6:30 pm 9:40 pm Dates: June 16,
More informationJEFFERSON COLLEGE COURSE SYLLABUS MTH 110 INTRODUCTORY ALGEBRA. 3 Credit Hours. Prepared by: Skyler Ross & Connie Kuchar September 2014
JEFFERSON COLLEGE COURSE SYLLABUS MTH 110 INTRODUCTORY ALGEBRA 3 Credit Hours Prepared by: Skyler Ross & Connie Kuchar September 2014 Dr. Robert Brieler, Division Chair, Math & Science Ms. Shirley Davenport,
More informationConvex Optimization. (EE227A: UC Berkeley) Lecture 28. Suvrit Sra. (Algebra + Optimization) 02 May, 2013
Convex Optimization (EE227A: UC Berkeley) Lecture 28 (Algebra + Optimization) 02 May, 2013 Suvrit Sra Admin Poster presentation on 10th May mandatory HW, Midterm, Quiz to be reweighted Project final report
More informationAlgebraic Simplex Active Learning Module 4
Algebraic Simplex Active Learning Module 4 J. René Villalobos and Gary L. Hogg Arizona State University Paul M. Griffin Georgia Institute of Technology Time required for the module: 50 Min. Reading Most
More information