Maximum entropy method for γ-convex programming

By means of γ-subdifferential and γ-convexity some results on maximum entropy method for γ-convex programming are introduced. If x* is a strictly local minimizer of the γ-convex programming, then x* is unique minimizer of it. Suppose xp is a strictly local finite minimizer of problem (G): min f(x), x is a member of the setΩpqq{x|gp(x)i(x)p (xp) = 0. (convergence theorem). Suppose x* is a member of the setbdΩ, if xp is a strictly local finite minimizer of the problem (G) and x* is a strictly local finite minimizer of the problem (S), then xp-&gtx*(p-&gt infinity).