In this study, we propose a trust-region-based procedure to solve unconstrained optimization problems that take advantage of the nonmonotone technique to introduce an efficient adaptive radius strategy. In our approach, the adaptive technique leads to decreasing the total number of iterations, while utilizing the structure of nonmonotone formula helps us to handle large-scale problems. The new algorithm preserves the global convergence and has quadratic convergence under suitable conditions. Preliminary numerical experiments on standard test problems indicate the efficiency and robustness of the proposed approach for solving unconstrained optimization problems
In this paper, we present a new trust region method for unconstrained nonlinear programming in which...
summary:Trust region methods are a class of effective iterative schemes in numerical optimization. I...
summary:Trust region methods are a class of effective iterative schemes in numerical optimization. I...
AbstractIn this paper, we incorporate a nonmonotone technique with the new proposed adaptive trust r...
In this paper, we propose a nonmonotone adaptive trust region method for unconstrained optimization ...
summary:We propose a new and efficient nonmonotone adaptive trust region algorithm to solve unconstr...
summary:We propose a new and efficient nonmonotone adaptive trust region algorithm to solve unconstr...
In this study, we propose a trust-region-based procedure to solve unconstrained optimization problem...
summary:Trust region methods are a class of effective iterative schemes in numerical optimization. I...
AbstractIn this paper, we combine the new trust region subproblem proposed in [1] with the nonmonoto...
AbstractIn this paper, we incorporate a nonmonotone technique with the new proposed adaptive trust r...
An improved trust region method for unconstrained optimization Jun Liu In this paper, a new trust re...
AbstractIn this paper, we propose a new trust region method for unconstrained optimization problems....
A new trust region method is presented, which combines nonmonotone line search technique, a self-ada...
A new self-adaptive rule of trust region radius is introduced, which is given by a piecewise functio...
In this paper, we present a new trust region method for unconstrained nonlinear programming in which...
summary:Trust region methods are a class of effective iterative schemes in numerical optimization. I...
summary:Trust region methods are a class of effective iterative schemes in numerical optimization. I...
AbstractIn this paper, we incorporate a nonmonotone technique with the new proposed adaptive trust r...
In this paper, we propose a nonmonotone adaptive trust region method for unconstrained optimization ...
summary:We propose a new and efficient nonmonotone adaptive trust region algorithm to solve unconstr...
summary:We propose a new and efficient nonmonotone adaptive trust region algorithm to solve unconstr...
In this study, we propose a trust-region-based procedure to solve unconstrained optimization problem...
summary:Trust region methods are a class of effective iterative schemes in numerical optimization. I...
AbstractIn this paper, we combine the new trust region subproblem proposed in [1] with the nonmonoto...
AbstractIn this paper, we incorporate a nonmonotone technique with the new proposed adaptive trust r...
An improved trust region method for unconstrained optimization Jun Liu In this paper, a new trust re...
AbstractIn this paper, we propose a new trust region method for unconstrained optimization problems....
A new trust region method is presented, which combines nonmonotone line search technique, a self-ada...
A new self-adaptive rule of trust region radius is introduced, which is given by a piecewise functio...
In this paper, we present a new trust region method for unconstrained nonlinear programming in which...
summary:Trust region methods are a class of effective iterative schemes in numerical optimization. I...
summary:Trust region methods are a class of effective iterative schemes in numerical optimization. I...