Journal of Systems Engineering and Electronics ›› 2009, Vol. 20 ›› Issue (5): 1111-1114.

• SOFTWARE ALGORITHM AND SIMULATION • Previous Articles     Next Articles

Adjustable entropy method for solving convex inequality problem

Wang Ruopeng   

  1. Dept. of Mathematics & Physics, Beijing Inst. of Petro-Chemical Technology, Beijing 102617, P. R. China
  • Online:2009-10-22 Published:2010-01-03

Abstract:

To solve the inequality problem, an adjustable entropy method is proposed. An inequality problem can be transformed into a minimax problem which is nondifferentiable; then an adjustable entropy is used to smooth the minimax problem. The solution of inequalities can be approached by using a BFGS algorithm of the standard optimization method. Some properties of the new approximate function are presented and then the global convergence are given according to the algorithm. Two numerical examples illustrate that the proposed method is efficient and is superior to the former ones.