1. What is an inflection point and how do you identify it? 2. How do you test a function to be convex or concave?

MATLAB: An Introduction with Applications
6th Edition
ISBN:9781119256830
Author:Amos Gilat
Publisher:Amos Gilat
Chapter1: Starting With Matlab
Section: Chapter Questions
Problem 1P
icon
Related questions
Question
100%
methods? Why or why not?
EXERCISES
1. What is an inflection point and how do you identify it?
2. How do you test a function to be convex or concave?
3. What is the unimodal property and what is its significance in single-variable
optimization?
4. Suppose a point satisfies sufficiency conditions for a local minimum. How do
you establish that it is a global minimum?
5. Cite a condition under which a search method based on polynomial
interpolation may fail.
6. Are region elimination methods as a class more efficient than point estimation
may fail
Or why
7. In terminating search methods, it is recommended that both the difference in
variable values and the difference in the function values be tested. Is it
possible for one test alone to indicate convergence to a minimum while the
point reached is really not a minimum? Illustrate graphically.
8. Given the following functions of one variable:
(a) fx) - x +x* -+2
(b) fix) = (2x + lyx - 4)
Determine, for each of the above functions, the following:
(i) Region(s) where the function is increasing; decreasing
(ii) Inflexion points, if any
(iii) Region(s) where the function is concave; convex
(iv) Local and global maxima, if any
(v) Local and global minima, if any
9. State whether each of the following functions is convex, concave, or neither.
(a) f)-e
(b) f) -e
(c) fix)
(d) f(x) - x+ log x
(e) fix)- lel
for x>0
(D f(x) - x log x
(g) fx) - x
(h) fix)
for x>0
where k is an integer
where k is an integer
10. Consider the function
f(x) = x' - 12r + 3
over the region -4 x<4
Determine the local minima, local maxima, global minimum, and global maximum of f over the
given region.
11. Carry out a single-variable search to minimize the function
- 5
fx) - 3x +
on the interval <x<
using (a) golden section, (b) interval halving,
Each search method is to use four functional evaluations only. Compare the final search intervals
obtained by the above methods
12. Determine the minimum of
f(x) = (10x + 3x +x + 5)
starting at x = 3 and using a step size A= 5.0.
Using region elimination: expanding pattem bounding plus six steps of golden section.
II
Transcribed Image Text:methods? Why or why not? EXERCISES 1. What is an inflection point and how do you identify it? 2. How do you test a function to be convex or concave? 3. What is the unimodal property and what is its significance in single-variable optimization? 4. Suppose a point satisfies sufficiency conditions for a local minimum. How do you establish that it is a global minimum? 5. Cite a condition under which a search method based on polynomial interpolation may fail. 6. Are region elimination methods as a class more efficient than point estimation may fail Or why 7. In terminating search methods, it is recommended that both the difference in variable values and the difference in the function values be tested. Is it possible for one test alone to indicate convergence to a minimum while the point reached is really not a minimum? Illustrate graphically. 8. Given the following functions of one variable: (a) fx) - x +x* -+2 (b) fix) = (2x + lyx - 4) Determine, for each of the above functions, the following: (i) Region(s) where the function is increasing; decreasing (ii) Inflexion points, if any (iii) Region(s) where the function is concave; convex (iv) Local and global maxima, if any (v) Local and global minima, if any 9. State whether each of the following functions is convex, concave, or neither. (a) f)-e (b) f) -e (c) fix) (d) f(x) - x+ log x (e) fix)- lel for x>0 (D f(x) - x log x (g) fx) - x (h) fix) for x>0 where k is an integer where k is an integer 10. Consider the function f(x) = x' - 12r + 3 over the region -4 x<4 Determine the local minima, local maxima, global minimum, and global maximum of f over the given region. 11. Carry out a single-variable search to minimize the function - 5 fx) - 3x + on the interval <x< using (a) golden section, (b) interval halving, Each search method is to use four functional evaluations only. Compare the final search intervals obtained by the above methods 12. Determine the minimum of f(x) = (10x + 3x +x + 5) starting at x = 3 and using a step size A= 5.0. Using region elimination: expanding pattem bounding plus six steps of golden section. II
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Similar questions
Recommended textbooks for you
MATLAB: An Introduction with Applications
MATLAB: An Introduction with Applications
Statistics
ISBN:
9781119256830
Author:
Amos Gilat
Publisher:
John Wiley & Sons Inc
Probability and Statistics for Engineering and th…
Probability and Statistics for Engineering and th…
Statistics
ISBN:
9781305251809
Author:
Jay L. Devore
Publisher:
Cengage Learning
Statistics for The Behavioral Sciences (MindTap C…
Statistics for The Behavioral Sciences (MindTap C…
Statistics
ISBN:
9781305504912
Author:
Frederick J Gravetter, Larry B. Wallnau
Publisher:
Cengage Learning
Elementary Statistics: Picturing the World (7th E…
Elementary Statistics: Picturing the World (7th E…
Statistics
ISBN:
9780134683416
Author:
Ron Larson, Betsy Farber
Publisher:
PEARSON
The Basic Practice of Statistics
The Basic Practice of Statistics
Statistics
ISBN:
9781319042578
Author:
David S. Moore, William I. Notz, Michael A. Fligner
Publisher:
W. H. Freeman
Introduction to the Practice of Statistics
Introduction to the Practice of Statistics
Statistics
ISBN:
9781319013387
Author:
David S. Moore, George P. McCabe, Bruce A. Craig
Publisher:
W. H. Freeman