Skip to main content
. Author manuscript; available in PMC: 2013 Sep 25.
Published in final edited form as: ACM Trans Knowl Discov Data. 2012 Feb 1;5(4):22. doi: 10.1145/2086737.2086742

Algorithm 3.

Projected Gradient Algorithm (PG) for Solving Eq. (45)

1: Input: P0, Q0, L=2σX2, and max-iter.
2: Output: P, Q.
3: for i = 0, 1, · · · , max-iter do
4:     Set Li = L, SPi = Pi, SQi = Qi.
5:     Compute i = SPi – ∇P f (P, Q)|P=SPi,Q=SQi,
6:         i = SQi – ∇Q f (P, Q)|P=SPi,Q=SQi.
7:     Compute via Eq. (47) and via Eq. (48).
8:     Set Pi+1 = , Qi+1 = .
9:     if the stopping criterion is satisfied then exit the loop.
10: end-for
11: Set P = Pi+1, Q = Qi+1.