v2007.09.13 - Convex Optimization

7.2. SECOND PREVALENT PROBLEM: 463compaction of the reconstruction by minimizing total distance. (730) It is bestused where some physical equilibrium implies such an energy minimization;e.g., [264,5].For this Problem 2, the trace rank-heuristic arose naturally in theobjective in terms of V . We observe: V (in contrast to VN T ) spreads energyover all available distances (B.4.2 no.20, confer no.22) although the rankfunction itself is insensitive to choice of auxiliary matrix.7.2.2.4 Rank minimization heuristic beyond convex envelopeFazel, Hindi, and Boyd [91] [292] [92] propose a rank heuristic more potentthan trace (1166) for problems of rank minimization;rankY ← log det(Y +εI) (1171)the concave surrogate function log det in place of quasiconcave rankY(2.9.2.6.2) when Y ∈ S n + is variable and where ε is a small positive constant.They propose minimization of the surrogate by substituting a sequencecomprising infima of a linearized surrogate about the current estimate Y i ;id est, from the first-order Taylor series expansion about Y i on some openinterval of ‖Y ‖ (D.1.7)log det(Y + εI) ≈ log det(Y i + εI) + tr ( (Y i + εI) −1 (Y − Y i ) ) (1172)we make the surrogate sequence of infima over bounded convex feasible set Cwhere, for i = 0...arg inf rankY ← lim Y i+1 (1173)Y ∈ C i→∞Y i+1 = arg infY ∈ C tr( (Y i + εI) −1 Y ) (1174)Choosing Y 0 =I , the first step becomes equivalent to finding the infimum oftrY ; the trace rank-heuristic (1166). The intuition underlying (1174) is thenew term in the argument of trace; specifically, (Y i + εI) −1 weights Y so thatrelatively small eigenvalues of Y found by the infimum are made even smaller.