A TRUST REGION SUBSPACE METHOD FOR LARGE-SCALE UNCONSTRAINED OPTIMIZATION
This paper presents a trust region subspace method for minimizing large-scale unconstrained problems. We choose a subspace that consists of some old directions which are invariable and some newest directions which are changed at each iteration. A restart technique is used when the old directions have little contribution. Numerical results are reported which indicate that the method is promising.
Year of publication: |
2012
|
---|---|
Authors: | GONG, LUJIN |
Published in: |
Asia-Pacific Journal of Operational Research (APJOR). - World Scientific Publishing Co. Pte. Ltd., ISSN 1793-7019. - Vol. 29.2012, 04, p. 1250021-1
|
Publisher: |
World Scientific Publishing Co. Pte. Ltd. |
Subject: | Large scale | unconstrained optimization | subspace method | trust region |
Saved in:
Online Resource
Saved in favorites
Similar items by subject
-
Estimation of factor models by realization-based and approximation methods
Scherrer, W., (1998)
-
Estimation of factor models by realization-based and approximation methods
Scherrer, W., (1998)
-
On D-Optimality Based Trust Regions for Black-Box Optimization Problems
Brekelmans, Ruud, (2001)
- More ...