Efficient Trust Region Subproblem Algorithms
The Trust Region Subproblem (TRS) is the problem of minimizing a quadratic (possibly non-convex) function over a sphere. It is the main step of the trust region method for unconstrained optimization problems. Two cases may cause numerical difficulties in solving the TRS, i.e., (i) the so-called hard...
Main Author: | Ye, Heng |
---|---|
Language: | en |
Published: |
2011
|
Subjects: | |
Online Access: | http://hdl.handle.net/10012/6297 |
Similar Items
-
Efficient Trust Region Subproblem Algorithms
by: Ye, Heng
Published: (2011) -
On Algorithms, Separability and Cellular Automata in Quantum Computing
by: Cheung, Donny
Published: (2007) -
On Algorithms, Separability and Cellular Automata in Quantum Computing
by: Cheung, Donny
Published: (2007) -
A survey of the trust region subproblem within a semidefinite framework
by: Fortin, Charles
Published: (2006) -
A survey of the trust region subproblem within a semidefinite framework
by: Fortin, Charles
Published: (2006)