A semidefinite framework for trust region subproblems with applications to large scale minimization
- 1 April 1997
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 77 (1) , 273-299
- https://doi.org/10.1007/bf02614438
Abstract
No abstract availableKeywords
This publication has 34 references indexed in Scilit:
- Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheresOperations Research Letters, 1996
- A recipe for semidefinite relaxation for (0,1)-quadratic programmingJournal of Global Optimization, 1995
- Max-min eigenvalue problems, primal-dual Interior point algorithms, and Trust region subproblemstOptimization Methods and Software, 1995
- Quadratically constrained least squares and quadratic problemsNumerische Mathematik, 1991
- An interior-point approach to NP-complete problems. IContemporary Mathematics, 1990
- Recent Developments in Algorithms and Software for Trust Region MethodsPublished by Springer Nature ,1983
- Some applications of optimization in matrix theoryLinear Algebra and its Applications, 1981
- On the Shannon capacity of a graphIEEE Transactions on Information Theory, 1979
- Ridge Regression: Biased Estimation for Nonorthogonal ProblemsTechnometrics, 1970
- Maximization by Quadratic Hill-ClimbingEconometrica, 1966