5. (x, t) = p-1 P-1 is convex on {(x,t) I t > 0} 5. (x, t) = p-1 P-1 is convex on {(x,t) I t > 0}
8.1. Consider the problenm min f(x) (P) t. g(x)s0 where f and g are convex functions over R" and X CR" is a convex set. Suppose that x is an optimal solution of (P) that satisfies g(x")<0. Show that x is also an optimal solution of the problem min f(x) s.t. xX.
8.1. Consider the problenm min f(x) (P) t. g(x)s0 where f and g are convex functions over R" and X CR" is a convex set. Suppose that x...
Are the following functions concave, convex, or neither for x > 0? (i) f(z) =ztt convex, (i) f (x)x -2 (iii) f (x) = x In x (iv) f (x)-/Inr (v) f (x) = min(x2, x3}
Let a continuously differentiable function f: Rn → R and a point x E Rn be given. For d E Rn we define Prove the following statements: (i) If f is convex and gd has a local minimum at t-0 for every d E R", then x is a minimiser of f. (ii) In general, the statement in (i) does not hold without assuming f to be convex. Hint: For) consider the function f: R2-»R given by
Let a continuously...
Consider the random variables X and Y with joint density function [5] f(x,y)=1/x , 0<y<x<1 i) Find P(X > 0 . 5 , y >0.5). ii) Find fX | y(x) and fY | x(y)..
(10) Let TEL(P3(C)) be defined by T(P(x)) = p” (x) – p(0), where the prime symbol denotes differentiation. (i) (5 marks) Let y = {x2 + 2x – 3, x, x3 – 1,1} be an ordered basis and ß the standard ordered basis for P3(C). Determine the matrix representation [T]3. (ii) (4 marks) Determine a basis for ker(T).
I. The random variables X,, where P(success) = P(X = 1) = p = 1-P(X = 0) for1,2,..., represent a series of independent Bernoulli trials. Let the random variable Y be the trial number on which the first success is achieved (a) Explain why the probability mass function of Y is f(y) = pqy-1, y = 12. where q 1- p. State the distribution of Y. 2 part of your answer you should verify this is a marimum likelihood estima-...
Suppose that f(x) is a convex function with continuous first partials defined on a convex set C in R". Prove that a point x* in C is a global minimizer of f(x) on C if and only if Vf(x*)-(x - x*)2 0 for all x in C.
Suppose that f(x) is a convex function with continuous first partials defined on a convex set C in R". Prove that a point x* in C is a global minimizer of f(x) on...
(a) Let x(t) = 1 when 0 <t<1 and 0 for all other real t. Find and graph the following: (i) r(t -3). [5] (ii) c(t/2). (5] (iii) <((t-3)/2). [5] (iv) (t/2) – 3). [5]
4. 흙 y(0, 1) = y(5, t) = 0 for t-> 0 y(x, 0)-0, at (x, 0) g(x) for 0 < x where gx)5xfor 43 xS5. 5 for 0s x <4 0
Real Analysis II
(Please do this only if you are sure)
**********************
***********************
I am also providing the convex set definition
And key details from my book which surely helps
11. Show that K is a convex set by directly applying the definition. Sketch K in the cases n= 1, 2, 3. is a basis for E. This is the n-parallelepiped spanned by vı, vertex 1% with 0 as a Definition. Let K E". Then K is a convex set...