Special Topics in Operations Research: Convex Analysis and Optimization Homework 2, Assignments of Operational Research

The homework assignment for the special topics in operations research course at rutgers university, focusing on convex analysis and optimization. The assignment includes problems on proving mathematical facts, convex functions, nonconvex projections, and indicator functions. Students are expected to submit their solutions by february 11, 2009.

Typology: Assignments

2019/2020

Uploaded on 06/08/2020

jeny
jeny 🇺🇸

4.6

(14)

251 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Special Topics in Operations Research 16:711:611
Convex Analysis and Optimization
Spring 2009 Rutgers University Prof. Eckstein
Homework 2
Due Wednesday, February 11
1. Prove the following fact, used in the proof of Proposition 1.5.1(b) in the text: let
x, y Rn, and let {zk} Rnbe a sequence with kzkk→∞; then
lim
k→∞
kzkxk
kzkyk= 1.
Hints: consider the square of the ratio above, instead of the ratio. Expand the numer-
ator and denominator and use the Cauchy-Schwarz inequalities −kzkkwk≤hz, wi
kzkkwk. Finally, you may use without proof the following standard calculus fact about
limits of ratios of polynomials: given a1, . . . , am, b1...,bmRwith am, bm6= 0, one
has
lim
t→∞ Pm
i=1 aiti
Pm
i=1 biti=am
bm
.
2. Suppose that f:Rn(−∞,+] is a convex function and xdom f. Show that for
any dRnthe function gd: (0,)(−∞,+] defined by
gd(α) = f(x+αd)f(x)
α
is nondecreasing.
3. Nonconvex Projections (similar to exercise 2.11 in the text): Let CRnbe a closed
but possibly nonconvex set, and consider any point xRn.
(a) Show that the function g(w) = kwxkmust have a nonempty, compact set of
minima over C. Denote this set by PC(x).
(b) Show that dC(x) = infwCkwxkis an everywhere finite-valued and continuous
function of xRn.
(c) Give an example showing that if Cis not convex, dCneed not be convex.
4. Given a set XRn, its indicator function is the function δX:Rn(,+] given
by
δX(x) = 0,if xX
+,if x6∈ X.
(a) Show that if Xis a closed set, δXis a closed function.
(b) Show that if Xis a convex set, δXis a convex function.
1
pf2

Partial preview of the text

Download Special Topics in Operations Research: Convex Analysis and Optimization Homework 2 and more Assignments Operational Research in PDF only on Docsity!

Special Topics in Operations Research 16:711:

Convex Analysis and Optimization

Spring 2009 Rutgers University Prof. Eckstein

Homework 2

Due Wednesday, February 11

  1. Prove the following fact, used in the proof of Proposition 1.5.1(b) in the text: let x, y ∈ Rn, and let {zk} ⊂ Rn^ be a sequence with ‖zk‖ → ∞; then

lim k→∞

‖zk^ − x‖ ‖zk^ − y‖

Hints: consider the square of the ratio above, instead of the ratio. Expand the numer- ator and denominator and use the Cauchy-Schwarz inequalities −‖z‖‖w‖ ≤ 〈z, w〉 ≤ ‖z‖‖w‖. Finally, you may use without proof the following standard calculus fact about limits of ratios of polynomials: given a 1 ,... , am, b 1... , bm ∈ R with am, bm 6 = 0, one has lim t→∞

∑m i=1 ait i ∑m i=1 bit i =^

am bm

  1. Suppose that f : Rn^ → (−∞, +∞] is a convex function and x ∈ dom f. Show that for any d ∈ Rn^ the function gd : (0, ∞) → (−∞, +∞] defined by

gd(α) =

f (x + αd) − f (x) α is nondecreasing.

  1. Nonconvex Projections (similar to exercise 2.11 in the text): Let C ⊂ Rn^ be a closed but possibly nonconvex set, and consider any point x ∈ Rn.

(a) Show that the function g(w) = ‖w − x‖ must have a nonempty, compact set of minima over C. Denote this set by PC (x). (b) Show that dC (x) = infw∈C ‖w − x‖ is an everywhere finite-valued and continuous function of x ∈ Rn. (c) Give an example showing that if C is not convex, dC need not be convex.

  1. Given a set X ⊆ Rn, its indicator function is the function δX : Rn^ → (∞, +∞] given by δX (x) =

0 , if x ∈ X +∞, if x 6 ∈ X.

(a) Show that if X is a closed set, δX is a closed function. (b) Show that if X is a convex set, δX is a convex function.

  1. Take any closed proper function f : Rn^ → (∞, +∞] and scalar λ > 0. Then the Moreau regularization or Moreau envelope of f is the function fˆλ : Rn^ given by

fˆλ(x) = inf w∈Rn

f (w) +

2 λ

‖w − x‖^2

(a) Show that fˆλ(x) ≤ f (x) for all x ∈ Rn. (b) Show that if x∗^ is a global minimizer of f , then fˆλ(x∗) = f (x∗). (c) Show that the properness of f implies that fˆλ can never take the value +∞. Further, show that if f is convex, fˆλ cannot take the value −∞. (d) Consider any closed set C. Show that for any λ > 0, we have

dC (x) =

2 λ(̂ δC )λ(x),

where dC is the distance function defined in problem 3 and δC is the indicator function of C, as defined in problem 4.