Generalizations of the trust region problem
- 1 January 1993
- journal article
- research article
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 2 (3-4) , 189-209
- https://doi.org/10.1080/10556789308805542
Abstract
The trust region problem requires the global minimum of a general quadratic function subject to an ellipsoidal constraint. The development of algorithms for the solution of this problem has found applications in nonlinear and combinatorial optimization. In this paper we generalize the trust region problem by allowing a general quadratic constraint. The main results are a characterization of the global minimizer of the generalized trust region problem, and the development of an algorithm that finds an approximate global minimizer in a finite number of iterations.Keywords
This publication has 15 references indexed in Scilit:
- Quadratically constrained least squares and quadratic problemsNumerische Mathematik, 1991
- Algorithms for the solution of quadratic knapsack problemsLinear Algebra and its Applications, 1991
- An interior point algorithm to solve computationally difficult set covering problemsMathematical Programming, 1991
- Computing a Trust Region Step for a Penalty FunctionSIAM Journal on Scientific and Statistical Computing, 1990
- Matrix AnalysisPublished by Cambridge University Press (CUP) ,1985
- Algorithm 611: Subroutines for Unconstrained Minimization Using a Model/Trust-Region ApproachACM Transactions on Mathematical Software, 1983
- Computing a Trust Region StepSIAM Journal on Scientific and Statistical Computing, 1983
- Computing Optimal Locally Constrained StepsSIAM Journal on Scientific and Statistical Computing, 1981
- Least squares with a quadratic constraintNumerische Mathematik, 1980
- Plus-operators in a space with indefinite metricAmerican Mathematical Society Translations: Series 2, 1969