摘要：The maximal entropy principle is applied to solve convex inequality problems. An inequality problem...The maximal entropy principle is applied to solve convex inequality problems. An inequality problem can be transformed into a minmax problem.Then it can be transformed into an unconstrained parameterized min problem,using the entropic function to smooth the minmax problem. The solution of the inequality problem can be obtained, by solving the parameterized min problems and adjusting the parameter to zero, under a certain principle. However, it is sufficient to solve a parameterized inequality problem each time, from the propositions of the aggregate function. In the article, some propositions of the aggregate function are discussed, the algorithm and its convergence are obtained.显示全部
