In this paper, we introduce a concept of substationary points and present a new trust region-based method for the optimization problems with general nonlinear equality constraints and simple bounds. Without the linear...In this paper, we introduce a concept of substationary points and present a new trust region-based method for the optimization problems with general nonlinear equality constraints and simple bounds. Without the linear independent assumption on the gradients of the equalitiy constraints, we prove the global convergence results for the main algorithm and indicate that they extend the results on SQP and those on trust region methods for equality constrained optimizstion and for optimization with simple bounds. Moreover, since any nonlinear programming problem can be converted into the standard nonlinear programming by introducing slack variables, the trust region method preseated in this paper can be used for solving general nonlinear programming problems.展开更多
文摘In this paper, we introduce a concept of substationary points and present a new trust region-based method for the optimization problems with general nonlinear equality constraints and simple bounds. Without the linear independent assumption on the gradients of the equalitiy constraints, we prove the global convergence results for the main algorithm and indicate that they extend the results on SQP and those on trust region methods for equality constrained optimizstion and for optimization with simple bounds. Moreover, since any nonlinear programming problem can be converted into the standard nonlinear programming by introducing slack variables, the trust region method preseated in this paper can be used for solving general nonlinear programming problems.
