In this paper, we present a trust region algorithm for bound constrained minimization. Under milder conditions, we prove the global convergence of the main algorithm. It is also proved that the correct active set can ...In this paper, we present a trust region algorithm for bound constrained minimization. Under milder conditions, we prove the global convergence of the main algorithm. It is also proved that the correct active set can be identified in a finite number of iterations if strict complementarity slackness condition holds, and so the proposed algorithm reduces finally to an unconstrained minimization method in a finite number of iterations, allowing a fast asymptotic rate of convergence.展开更多
A trust region method combining with nonmonotone technique is proposed tor solving symmetric nonlinear equations. The global convergence of the given method will be established under suitable conditions. Numerical res...A trust region method combining with nonmonotone technique is proposed tor solving symmetric nonlinear equations. The global convergence of the given method will be established under suitable conditions. Numerical results show that the method is interesting for the given problems.展开更多
文摘In this paper, we present a trust region algorithm for bound constrained minimization. Under milder conditions, we prove the global convergence of the main algorithm. It is also proved that the correct active set can be identified in a finite number of iterations if strict complementarity slackness condition holds, and so the proposed algorithm reduces finally to an unconstrained minimization method in a finite number of iterations, allowing a fast asymptotic rate of convergence.
基金Supported by SF of Guangxi University(X061041)Supported by NSF of China(10761001)
文摘A trust region method combining with nonmonotone technique is proposed tor solving symmetric nonlinear equations. The global convergence of the given method will be established under suitable conditions. Numerical results show that the method is interesting for the given problems.
