Title :
New Convergent Algorithm for Solving a Class of Optimization Problems
Author :
Jiao, Hong-Wei ; Yin, Jing-Ben ; Li, Kun
Author_Institution :
Dept. of Math., Henan Inst. of Sci. & Technol., Xinxiang, China
Abstract :
A convergent algorithm is proposed for solving a class of optimization problems (P1), which can be broadly applied to engineering designs and stability analysis of nonlinear systems. By utilizing logarithmic characteristic and linearization technique, linear relaxation programming (LRP) about problem (P1) is established, through the successive refinement of the linear relaxation of the feasible region and the solutions of a series of linear relaxation programming (LRP), the proposed algorithm is convergent to the global minimum of the (P1). And finally the numerical results show the feasibility of the proposed algorithm.
Keywords :
convergence; linear programming; relaxation theory; convergent algorithm; engineering design; linear relaxation programming; logarithmic characteristic; nonlinear system; optimization problem; stability analysis; Algorithm design and analysis; Design engineering; Design optimization; Educational institutions; Linear programming; Linearization techniques; Mathematics; Nonlinear systems; Optimization methods; Stability analysis; branch and bound; fractional problem; global optimization; linear technique;
Conference_Titel :
Information and Computing (ICIC), 2010 Third International Conference on
Conference_Location :
Wuxi, Jiang Su
Print_ISBN :
978-1-4244-7081-5
Electronic_ISBN :
978-1-4244-7082-2
DOI :
10.1109/ICIC.2010.136
