摘要
We study how to use the SR1 update to realize minimization methods for problems where the storage is critical. We give an update formula which generates matrices using information from the last m iterations. The numerical tests show that the method is efficent.
We study how to use the SR1 update to realize minimization methods for problems where the storage is critical. We give an update formula which generates matrices using information from the last m iterations. The numerical tests show that the method is efficent.
