Author of the publication

A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation.

, , and . Applied Mathematics and Computation, 184 (2): 886-894 (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Global optimization of signomial geometric programming using linear relaxation., and . Applied Mathematics and Computation, 150 (1): 99-114 (2004)The model and algorithm for the optimization of the granularity distribution., , and . Applied Mathematics and Computation, 179 (2): 763-771 (2006)A new SQP method of feasible directions for nonlinear programming., and . Applied Mathematics and Computation, 148 (1): 121-134 (2004)An inexact smoothing method for the monotone complementarity problem over symmetric cones., and . Optimization Methods and Software, 27 (3): 445-459 (2012)A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints., and . Applied Mathematics and Computation, 197 (2): 810-818 (2008)A variant of trust-region methods for unconstrained optimization., , , and . Applied Mathematics and Computation, 203 (1): 297-307 (2008)A fractional programming algorithm based on conic quasi-Newton trust region method for unconstrained minimization., , and . Applied Mathematics and Computation, 181 (2): 1061-1067 (2006)A global optimization algorithm using linear relaxation., , and . Applied Mathematics and Computation, 178 (2): 510-518 (2006)A general scheme for Q-S synchronization of chaotic systems with unknown parameters and scaling functions., and . Applied Mathematics and Computation, 216 (7): 2050-2057 (2010)A global optimization using linear relaxation for generalized geometric programming., , and . European Journal of Operational Research, 190 (2): 345-356 (2008)