Add to ORKGTrust-region methods are popular for nonlinear optimization problems. How to determine the predicted re-duction of the trust-region subproblem is a key issue for trust-region methods. Powell gave an estimation of the lower bound of the trust-region subproblem by considering the negative gradient direction. In this article, we give an alternate way to estimate the same lower bound of the trust-region subproblem
We introduce a trust region algorithm for minimization of nonsmooth functions with linear constraint...
We consider the problem of minimizing a quadratic function subject to an ellipsoidal constraint whe...
Trust-region methods are amongst the most commonly used methods in unconstrained mathematical optimi...
An improved trust region method for unconstrained optimization Jun Liu In this paper, a new trust re...
This work is concerned with the theoretical study and the implementation of algorithms for solving t...
We review the main techniques used in trust region algorithms for nonlinear constrained optimization...
Trust region algorithms are a class of recently developed algorithms for solving optimization proble...
An algorithm for solving the problem of minimizing a non-linear function subject to equality constra...
We present trust-region methods for the general unconstrained minimization problem. Trust-region alg...
AbstractIn this paper, we propose a new trust region method for unconstrained optimization problems....
In classical trust-region optimization algorithms, the radius of the trust region is reduced, kept c...
Given an algorithm A for solving some mathematical problem based on the iterative solution of simple...
Abstract. We consider methods for large-scale unconstrained minimization based on finding an approxi...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/15...
Two trust-region interior-point algorithms for the solution of minimization problems with simple bou...
We introduce a trust region algorithm for minimization of nonsmooth functions with linear constraint...
We consider the problem of minimizing a quadratic function subject to an ellipsoidal constraint whe...
Trust-region methods are amongst the most commonly used methods in unconstrained mathematical optimi...
An improved trust region method for unconstrained optimization Jun Liu In this paper, a new trust re...
This work is concerned with the theoretical study and the implementation of algorithms for solving t...
We review the main techniques used in trust region algorithms for nonlinear constrained optimization...
Trust region algorithms are a class of recently developed algorithms for solving optimization proble...
An algorithm for solving the problem of minimizing a non-linear function subject to equality constra...
We present trust-region methods for the general unconstrained minimization problem. Trust-region alg...
AbstractIn this paper, we propose a new trust region method for unconstrained optimization problems....
In classical trust-region optimization algorithms, the radius of the trust region is reduced, kept c...
Given an algorithm A for solving some mathematical problem based on the iterative solution of simple...
Abstract. We consider methods for large-scale unconstrained minimization based on finding an approxi...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/15...
Two trust-region interior-point algorithms for the solution of minimization problems with simple bou...
We introduce a trust region algorithm for minimization of nonsmooth functions with linear constraint...
We consider the problem of minimizing a quadratic function subject to an ellipsoidal constraint whe...
Trust-region methods are amongst the most commonly used methods in unconstrained mathematical optimi...