Lecture 8: Maxima and Minima

Similar documents
MA102: Multivariable Calculus

Calculus 2502A - Advanced Calculus I Fall : Local minima and maxima

Lecture 2 - Unconstrained Optimization Definition[Global Minimum and Maximum]Let f : S R be defined on a set S R n. Then

Lecture 4: Partial and Directional derivatives, Differentiability

Math Maximum and Minimum Values, I

Optimization. Sherif Khalifa. Sherif Khalifa () Optimization 1 / 50

Chapter 2: Unconstrained Extrema

8 Extremal Values & Higher Derivatives

Maxima and Minima. Marius Ionescu. November 5, Marius Ionescu () Maxima and Minima November 5, / 7

SIMPLE MULTIVARIATE OPTIMIZATION

Functions of Several Variables

OR MSc Maths Revision Course

14.7: Maxima and Minima

2x (x 2 + y 2 + 1) 2 2y. (x 2 + y 2 + 1) 4. 4xy. (1, 1)(x 1) + (1, 1)(y + 1) (1, 1)(x 1)(y + 1) 81 x y y + 7.

Functions of Several Variables

Math 5BI: Problem Set 6 Gradient dynamical systems

REVIEW OF DIFFERENTIAL CALCULUS

Lecture 9: Implicit function theorem, constrained extrema and Lagrange multipliers

Math 2204 Multivariable Calculus Chapter 14: Partial Derivatives Sec. 14.7: Maximum and Minimum Values

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

x +3y 2t = 1 2x +y +z +t = 2 3x y +z t = 7 2x +6y +z +t = a

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

Solutions to Homework 7

Calculus - II Multivariable Calculus. M.Thamban Nair. Department of Mathematics Indian Institute of Technology Madras

Transpose & Dot Product

Math (P)refresher Lecture 8: Unconstrained Optimization

EC9A0: Pre-sessional Advanced Mathematics Course. Lecture Notes: Unconstrained Optimisation By Pablo F. Beker 1

x x implies that f x f x.

MATH 5720: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 2018

Transpose & Dot Product

1. Diagonalize the matrix A if possible, that is, find an invertible matrix P and a diagonal

Optimization: Problem Set Solutions

LESSON 23: EXTREMA OF FUNCTIONS OF 2 VARIABLES OCTOBER 25, 2017

Functions of Several Variables

MATH Max-min Theory Fall 2016

EC /11. Math for Microeconomics September Course, Part II Problem Set 1 with Solutions. a11 a 12. x 2

Multivariable Calculus Notes. Faraad Armwood. Fall: Chapter 1: Vectors, Dot Product, Cross Product, Planes, Cylindrical & Spherical Coordinates

Section 14.8 Maxima & minima of functions of two variables. Learning outcomes. After completing this section, you will inshaallah be able to

Final Exam Solutions June 10, 2004

Math 210, Final Exam, Fall 2010 Problem 1 Solution. v cosθ = u. v Since the magnitudes of the vectors are positive, the sign of the dot product will

Linear Algebra And Its Applications Chapter 6. Positive Definite Matrix

4.1 Analysis of functions I: Increase, decrease and concavity

Paul Schrimpf. October 18, UBC Economics 526. Unconstrained optimization. Paul Schrimpf. Notation and definitions. First order conditions

8. Diagonalization.

Basics of Calculus and Algebra

September Math Course: First Order Derivative

Maxima and Minima. (a, b) of R if

Variational Methods & Optimal Control

Partial Derivatives. w = f(x, y, z).

Half of Final Exam Name: Practice Problems October 28, 2014

Name: Instructor: Lecture time: TA: Section time:

Module Two: Differential Calculus(continued) synopsis of results and problems (student copy)

1 Vectors and the Scalar Product

ARE211, Fall 2005 CONTENTS. 5. Characteristics of Functions Surjective, Injective and Bijective functions. 5.2.

Properties of Linear Transformations from R n to R m

Review of Optimization Methods

2.10 Saddles, Nodes, Foci and Centers

z 2 = 1 4 (x 2) + 1 (y 6)

II. An Application of Derivatives: Optimization

FIRST-ORDER SYSTEMS OF ORDINARY DIFFERENTIAL EQUATIONS III: Autonomous Planar Systems David Levermore Department of Mathematics University of Maryland

Solutions to the Calculus and Linear Algebra problems on the Comprehensive Examination of January 28, 2011

Functions. A function is a rule that gives exactly one output number to each input number.

7a3 2. (c) πa 3 (d) πa 3 (e) πa3

x + ye z2 + ze y2, y + xe z2 + ze x2, z and where T is the

Monotone Function. Function f is called monotonically increasing, if. x 1 x 2 f (x 1 ) f (x 2 ) x 1 < x 2 f (x 1 ) < f (x 2 ) x 1 x 2

Student Study Session Topic: Interpreting Graphs

Math 1314 Lesson 23 Partial Derivatives

Math 10C - Fall Final Exam

446 CHAP. 8 NUMERICAL OPTIMIZATION. Newton's Search for a Minimum of f(x,y) Newton s Method

Solutions to the Multivariable Calculus and Linear Algebra problems on the Comprehensive Examination of January 31, 2014

Extrema of Functions of Several Variables

= c, we say that f ( c ) is a local

Exercises for Multivariable Differential Calculus XM521

Math 207 Honors Calculus III Final Exam Solutions

f(x, y) = 1 sin(2x) sin(2y) and determine whether each is a maximum, minimum, or saddle. Solution: Critical points occur when f(x, y) = 0.

Maximum and Minimum Values section 4.1

A Note on Two Different Types of Matrices and Their Applications

MAT 122 Homework 7 Solutions

ENGI Partial Differentiation Page y f x

Optimization and Calculus

Taylor Series and stationary points

Mathematics for Economics ECON MA/MSSc in Economics-2017/2018. Dr. W. M. Semasinghe Senior Lecturer Department of Economics

Tangent spaces, normals and extrema

Chapter 4 Differentiation

ARE202A, Fall 2005 CONTENTS. 1. Graphical Overview of Optimization Theory (cont) Separating Hyperplanes 1

1. For each function, find all of its critical points and then classify each point as a local extremum or saddle point.

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

Math 497C Mar 3, Curves and Surfaces Fall 2004, PSU

Performance Surfaces and Optimum Points

Math 222 Spring 2013 Exam 3 Review Problem Answers

Chapter 3: Constrained Extrema

Fundamentals of Unconstrained Optimization

Chapter 13. Convex and Concave. Josef Leydold Mathematical Methods WS 2018/19 13 Convex and Concave 1 / 44

Two Posts to Fill On School Board

Calculus III: Practice Final

This exam will be over material covered in class from Monday 14 February through Tuesday 8 March, corresponding to sections in the text.

Feature detection.

Higher order derivative

A DARK GREY P O N T, with a Switch Tail, and a small Star on the Forehead. Any

Nonlinear Optimization

Transcription:

Lecture 8: Maxima and Minima Rafikul Alam Department of Mathematics IIT Guwahati

Local extremum of f : R n R Let f : U R n R be continuous, where U is open. Then f has a local maximum at p if there exists r > 0 such that f (x) f (p) for x B(p, r). f has a local minimum at a if there exists ɛ > 0 such that f (x) f (p) for x B(p, ɛ). A local maximum or a local minimum is called a local extremum.

Figure: Local extremum of z = f (x, y)

Necessary condition for extremum of R n R Critical point: A point p U is a critical point of f if f (p) = 0. Thus, when f is differentiable, the tangent plane to z = f (x) at (p, f (p)) is horizontal. Theorem: Suppose that f has a local extremum at p and that f (p) exists. Then p is a critical point of f, i.e, f (p) = 0. Example: Consider f (x, y) = x 2 y 2. Then f x = 2x = 0 and f y = 2y = 0 show that (0, 0) is the only critical point of f. But (0, 0) is not a local extremum of f.

Saddle point Saddle point: A critical point of f that is not a local extremum is called a saddle point of f. Examples: The point (0, 0) is a saddle point of f (x, y) = x 2 y 2. Consider f (x, y) = x 2 y + y 2 x. Then f x = 2xy + y 2 = 0 and f y = 2xy + x 2 = 0 show that (0, 0) is the only critical point of f. But (0, 0) is a saddle point. Indeed, on y = x, f is both positive and negative near (0, 0).

Sufficient condition for extremum of f : R 2 R Theorem: Let f : U R 2 R be C 2 and p U be a critical point, i.e, f x (p) = 0 = f y (p). Let [ ] fxx (p) f D := det( xy (p) ) = f f yx (p) f yy (p) xx (p)f yy (p) fxy(p). 2 If f xx (p) > 0 and D > 0 then f has a local minimum at p. If f xx (p) < 0 and D > 0 then f has a local maximum at p. If D < 0 then p is a saddle point. If D = 0 then nothing can be said.

Example Find the minimum distance from the point (1, 2, 0) to the cone z 2 = x 2 + y 2. We minimize the square of distance d 2 = (x 1) 2 + (y 2) 2 + z 2 = (x 1) 2 + (y 2) 2 + x 2 + y 2 = 2x 2 + 2y 2 2x 4y + 5. Consider f (x, y) := 2x 2 + 2y 2 2x 4y + 5. Then f x = 4x 2 and f y = 4y 4 p := (1/2, 1) is the critical point. Now D = f xx (p)f yy (p) f 2 xy(p) = 16 > 0 and f xx (p) = 4 > 0 f (p) is the minimum d = f (p) = 5/2.

Proof of sufficient condition for extremum Write H f (p) > 0 to denote f xx (p) > 0 and D(p) > 0, where [ ] fxx (p) f H f (p) := xy (p) and D(p) := f f yx (p) f yy (p) xx (p)f yy (p) fxy(p). 2 Then 1. H f (p) > 0 H f (p + h) > 0 for h < ɛ. 2. H f (p) > 0 H f (p)h, h > 0 for all h 0. Indeed, H f (p)h, h = h 2 f xx (p) + 2f xy (p)hk + f yy (p)k 2 = [(f xx (p)h + f xy (p)k) 2 + k 2 D(p)]/f xx (p). 3. By EMVT there exists 0 < θ < 1 such that f (p + h) f (p) = 1 2 H f (p + θh)h, h > 0.

Sufficient condition for extremum of f : R n R Theorem: Let f : U R n R be C 2 and p U be a critical point, i.e, f (p) = 0. Consider the Hessian 1 1 f (p) n 1 f (p) H f (p) :=... 1 n f (p) n n f (p) If H f (p) > 0 (positive definite) then f has a local minimum at p. If H f (p) < 0 (negative definite) then f has a local maximum at p. If H f (p) indefinite then p is a saddle point. If det H f (p) = 0 then nothing can be said.

Positive definite matrix Let A be a symmetric matrix of size n. Then A is said to be positive definite (A > 0) if x Ax > 0 for nonzero x R n, negative definite (A < 0) if x Ax < 0 for nonzero x R n, indefinite if det(a) 0 and there exits x, y R n such that x Ax > 0 and y Ay < 0. Fact: If A > 0 then there exists α > 0 such that x Ax α x 2 for all x R n. Proof: S := {x R n : x = 1} compact and f (x) := x Ax continuous α := f (x min ) = min u S f (u) > 0.

Characterization of positive definite matrices Fact: Let A j denote the leading j-by-j principal sub-matrix of A for j = 1, 2,..., n. Thus det(a j ) is the j-th principal minor. Then A > 0 det(a j ) > 0 for j = 1, 2,..., n, eigenvalues of A are positive. A < 0 det(a j ) < 0 for j = 1, 2,..., n, eigenvalues of A are negative. A is indefinite det(a) 0 and A has positive and negative eigenvalues.

Proof of sufficient condition for extremum of f : R n R Since f is C 2, we have f (p + h) = f (p) + f (p) h + 1 2 h (H f (p)h) + e(h) h 2, where e(h) 0 as h 0. 1. H f (p) > 0 h (H f (p)h) α h 2 for some α > 0. 2. There exists δ > 0 such that h < δ e(h) < α/4. 3. f (p + h) f (p) = 1 2 h (H f (p)h) + e(h) h 2 α 4 h 2 when h < δ.

Proof for saddle point of f : R n R If H f (p) is indefinite then there exists nonzero vectors u and v such that u (H f (p)u) > 0 and v (H f (p)v) < 0. Then φ(t) := f (p + tu) has minimum at t = 0 whereas ψ(t) := f (p + tv) has a maximum at t = 0. Indeed, and φ (0) = d2 f (p + tu) dt 2 t=0 = u (H f (p)u) > 0 ψ (0) = d2 f (p + tv) dt 2 t=0 = v (H f (p)v) < 0.

Example Find the maxima, minima and saddle points of f (x, y) := (x 2 y 2 )e (x2 +y 2 )/2. We have f x = [2x x(x 2 y 2 )]e (x2 +y 2 )/2 = 0, f y = [ 2y y(x 2 y 2 )]e (x2 +y 2 )/2 = 0, so the critical points are (0, 0), (± 2, 0) and (0, ± 2). Point f xx f xy f yy D Type (0, 0) 2 0 2 4 saddle ( 2, 0) 4/e 0 4/e 16/e 2 maximum ( 2, 0) 4/e 0 4/e 16/e 2 maximum (0, 2) 4/e 0 4/e 16/e 2 minimum (0, 2) 4/e 0 4/e 16/e 2 minimum

Example: global extrema Find global maximum and global minimum of the function f : [ 2, 2] [ 2, 2] R given by f (x, y) := 4xy 2x 2 y 4. To find global extrema, find extrema of f in the interior and then on the boundary. Solving f x = 4y 4x = 0 and f y = 4x 4y 3 = 0 we obtain the critical points (0, 0), (1, 1) and ( 1, 1). We have f (1, 1) = f ( 1, 1) = 1. (0, 0) is a saddle point. For the boundary, consider f (x, 2), f (x, 2), f (2, y), f ( 2, y) and find their extrema on [ 2, 2]. The global minimum is attained at (2, 2) and ( 2, 2) with f (2, 2) = 40. The global maximum is attained at (1, 1) and ( 1, 1). *** End ***