In this paper, a projected gradient trust region algorithm for solving nonlinear equality systems with convex constraints is considered. The global convergence results are developed in a very general setting of computing trial directions by this method combining with the line search technique. Close to the solution set this method is locally Q-superlinearly convergent under an error bound assumption which is much weaker than the standard nonsingularity condition.
展开▼
机译:77岁的姐妹。先生和产品。辛西娅·萨尔兹曼·蒙德尔(Cynthia Salzman Mondell)和艾伦·蒙德尔(Allen Mondell)。 Circle R Media and Media Projects Inc.,2005年。55分钟。 (Circle R Media and Media Projects Inc.,http://www.mediaprojects.org/