Reference no: EM131372534
Q1. Find the range of values of the parameter a for which the function
f(x1, x2, x3) = 2x1x3 - x12 - x22 - 5x32 - 2ax1x2 - 4x2x3 is concave.
Q2. Consider the function
f(x) = ½xTQx - xTb,
where Q = QT > 0 and x, b ∈ Rn. Define the function Φ: R → R by Φ(α) = f(x + αd), where x, d ∈ Rn are fixed vectors and d ≠ 0. Show that Φ(α) is a strictly convex quadratic function of α.
Q3. Show that f(x) = x1x2 is a convex function on Ω = {[a, ma]T: a ∈ R}, where m is any given nonnegative constant.
Q4. Suppose that the set Ω = {x : h(x) = c} is convex, where h : Rn → R and c ∈ R. Show that h is convex and concave over Ω.
Q5. Find all sub-gradients of
f(x) = |x|, x ∈ R,
at x = 0 and at x = 1.
Q6. Let Ω ⊂ Rn be a convex set, and fi: Ω → R, i = 1, . . . , l be convex functions. Show that max {f1, . . . , fl} is a convex function.
Note: The notation max{f1, . . . , fl} denotes a function from Ω to R such that for each x ∈ Ω, its value is the largest among the numbers fi(x), i = 1, . . . ,l.
Q7. Let Ω ⊂ Rn be an open convex set. Show that a symmetric matrix Q ∈ Rn is positive semi definite if and only if for each x, y ∈ Ω, (x-y)TQ(x - y) ≥ 0. Show that a similar result for positive definiteness holds if we replace the "≥" by ">" in the inequality above.
Q8. Consider the problem
minimize ½||Ax-b||2
subject to x1 + · · · + xn = 1
x1, . . . ,xn ≥ 0
Is the problem a convex optimization problem? If yes, give a complete proof. If no, explain why not, giving complete explanations.
Q9. Consider the optimization problem
minimize f(x)
subject to x ∈ Ω,
where f(x) = x1x22, where x = [x1, x2]T, and Ω = {x ∈ R2: x1 = x2, x1 ≥ 0}. Show that the problem is a convex optimization problem.
Q10. Consider the convex optimization problem
minimize f(x)
subject to x ∈ Ω.
List three methods for recruiting entry level managers
: We have many methods for recruiting employees. In recent years, with the advances of information technology and the world wide web, new methods are now available that were not used even ten years ago. List three methods for recruiting entry level..
|
Confidence interval for the average caloric content
: Give a 95% confidence interval for the average caloric content of a 3-ounce cut of top loin steak. Also give a 98% confidence interval for the average caloric content of a cut.
|
Prepare a memo in which you address the advantages
: Prepare a memo in which you address the advantages and disadvantages of both internal and external staffing methods of a new office that is remote from the main office. Make sure the memo has bullet points for both the pros and cons of each altern..
|
Compare and contrast methods of evaluation and prescription
: PAD 520- Compare and contrast methods of evaluation and prescription in terms of time and the types of claims produced by each. Provide examples to support your response.
|
Is the problem a convex optimization problem
: Is the problem a convex optimization problem? If yes, give a complete proof. If no, explain why not, giving complete explanations
|
What do you observe about placement of text in the frame
: Open the imageviewer0-1 project. (This will become the basis of your own image viewer.) Create an instance of class Image Viewer. Resize the resulting frame (make it larger). What do you observe about the placement of the text in the frame?
|
Describe organizational culture
: How the stakeholders will be apprised of the project's on going risk management activities? what is risk probability Matrix? what is use of the risk mitigation stategies? Describe organizational culture. What are some of the implicit and explicit nor..
|
Confidence interval for the average transit time
: A random sample of 20 shipments gives x‾ = 2.6 days and s = 0.4 day. Give a 99% confidence interval for the average transit time.
|
How do you plan to practice methods that contribute
: GCU LDR 600: Self-leadership provides an opportunity to achieve your objectives through your own thinking, feelings, and behaviors. Self-reflection is a necessary tool to improve the way you function as a leader. How do you plan to practice method..
|