Answers are grounded in this paper and cite their sources.
The trust region method has been proven to be very successful in both unconstrained and constrained optimization. It requires the global minimum of a general quadratic function subject to ellipsoid constraints. In this paper, we generalize the trust region subproblem by allowing two general quadratic constraints. Conditions and properties of its solution are discussed.
No takes yet. Share an insight, caveat, or question.
Peng et al. (1997) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: