Nonmonotonic Trust Region Algorithm via the Conjugate Gradient Path for Unconstrained Generalized Geometric Programming
1. School of Management, University of Shanghai for Science and Technology2. College of Mathematics and Information Science, Henan Polytechnic University
About author:DANG Ya-zheng(1973-), female, native of Xuchang, Henan, a lecturer of Henan Polytechnic University, engages in optimization; JING Shu-jie(1965-), male, native of Changyun, Henan, an associate professor of Henan Polytechnic University, engages in optimization; LI Yu(1969-), female, native of Kaifeng, Henan, an associate professor of Henan University, engages in intelligent optimization.
Supported by:
Supported by the National Science Foundation of China(10671126)； Supported by the Shanghai Municipal Government Project(S30501)； Supported by the Innovation Fund Project for Graduate Student of Shanghai(JWCXSL1001)； Supported by the Youth Foundation of Henan Polytechnic University(Q20093)； Supported by the Applied Mathematics Provinciallevel Key Discipline of Henan Province； Supported by Operational Research and Control Theory Key Discipline of Henan Polytechnic University；
DANG Ya-zheng, JING Shu-jie, LI Yu. Nonmonotonic Trust Region Algorithm via the Conjugate Gradient Path for Unconstrained Generalized Geometric Programming [J]. Chinese Quarterly Journal of Mathematics, 2011, 26(2): 285-289.
