Here, are positive. The optimality condition is satisfied when Bi = 1. Increasing ai is effective in making p smaller when Bi > 1. When Bi < 1, the opposite is true. Multiplying a by B, a are gradually updated while satisfying Eq. (3). A heuristic updating scheme is as follows: