Jonathan Eckstein, Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming, Mathematics of Operations Research, Vol. 18, No. 1 (Feb., 1993), pp. 202-226 ...

where J(x) is the Jacobian matrix of partial derivatives of F with respect to x. For optimization problems, the same method is used, where F(x) is the gradient of the objective function and J(x) ...

A pattern separation problem is basically a problem of obtaining a criterion for distinguishing between the elements of two disjoint sets of patterns. The patterns are usually represented by points in ...