Exercise 3.4.2

Answers

We follow the example 1, where the set K is xTv = 1, which is a closed convex set. Let’s rewrite this as a minimizationof g. We assume a new function g(z), which is an indicator function of the set xTv = 1, g(z) = 0 or g(z) = + for z in or out of xTv = 1.

So the problem changes to

Minimizef(x) + g(z)subject tox z = 0

So our scaled augmented Lagrangian is

Lρ(x,z,u) = x2 + g(z) + 1 2ρx z + u2

If we start with x0 = 0,z0 = 0,u0 = 0, then we have

  • x1 = argmin[|x|2+1 2ρxz0+u02] = argmin[x2+1 2ρx2] = argmin[(1+1 2ρ)x2]

    • Solve for the minimal, we find x1 = 0
  • z1 = projection ofx1 + u0onto K, since x1 + u0 = 0, we find z1 = 0
  • u1 = u0 + x1 z1 = 0

It seems that if we start with x = z = u = 0, the ADMM won’t find the solution. Is this right?

User profile picture
2020-03-20 00:00
Comments