Scaling symmetric rank one update for unconstrained optimization
A basic disadvantage to the symmetric rank one (SR1) update is that the SRI update may not preserve positive definiteness when starting with a positive definite approximation. A simple remedy to this problem is to restart the update with the initial approximation mostly the identity matrix whenever...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universiti Utara Malaysia
2002
|
| Subjects: | |
| Online Access: | https://repo.uum.edu.my/id/eprint/761/1/Malik_Abu_Hassan.pdf |
| _version_ | 1803624179763773440 |
|---|---|
| author | Abu Hassan, Malik Monsi, Mansor Leong, Wah June |
| author_facet | Abu Hassan, Malik Monsi, Mansor Leong, Wah June |
| author_sort | Abu Hassan, Malik |
| collection | UUM |
| description | A basic disadvantage to the symmetric rank one (SR1) update is that the SRI update may not preserve positive definiteness when starting with a positive definite approximation. A simple remedy to this problem is to restart the update with the initial approximation mostly the identity matrix whenever this difficulty arises. However, numerical experience shows that restart with the identity matrix is not a good choice. Instead of using the identity matrix we used a positive multiple of the identity matrix. The used positive scaling factor is the optimal solution of the measure defined by the problem - maximize the determinant subject to a bound of 1 on the largest eigenvalue. This measure is motivated by considering the volume of the symmetric difference of the two ellipsoids, which arise from the current and updated quadratic models in quasi-Newton methods. A replacement in the form of positive multiple of identity matrix is provided for the SR1 when it is not positive definite. Our experiments indicate that with such simple scale, the effectiveness of the SR1 method is increased dramatically. |
| first_indexed | 2024-07-04T05:14:16Z |
| format | Article |
| id | uum-761 |
| institution | Universiti Utara Malaysia |
| language | English |
| last_indexed | 2024-07-04T05:14:16Z |
| publishDate | 2002 |
| publisher | Universiti Utara Malaysia |
| record_format | dspace |
| spelling | uum-7612010-09-30T06:13:46Z https://repo.uum.edu.my/id/eprint/761/ Scaling symmetric rank one update for unconstrained optimization Abu Hassan, Malik Monsi, Mansor Leong, Wah June QA Mathematics A basic disadvantage to the symmetric rank one (SR1) update is that the SRI update may not preserve positive definiteness when starting with a positive definite approximation. A simple remedy to this problem is to restart the update with the initial approximation mostly the identity matrix whenever this difficulty arises. However, numerical experience shows that restart with the identity matrix is not a good choice. Instead of using the identity matrix we used a positive multiple of the identity matrix. The used positive scaling factor is the optimal solution of the measure defined by the problem - maximize the determinant subject to a bound of 1 on the largest eigenvalue. This measure is motivated by considering the volume of the symmetric difference of the two ellipsoids, which arise from the current and updated quadratic models in quasi-Newton methods. A replacement in the form of positive multiple of identity matrix is provided for the SR1 when it is not positive definite. Our experiments indicate that with such simple scale, the effectiveness of the SR1 method is increased dramatically. Universiti Utara Malaysia 2002 Article PeerReviewed application/pdf en https://repo.uum.edu.my/id/eprint/761/1/Malik_Abu_Hassan.pdf Abu Hassan, Malik and Monsi, Mansor and Leong, Wah June (2002) Scaling symmetric rank one update for unconstrained optimization. Analisis, 9 (1&2). pp. 63-76. ISSN 0127-8983 http://ijms.uum.edu.my |
| spellingShingle | QA Mathematics Abu Hassan, Malik Monsi, Mansor Leong, Wah June Scaling symmetric rank one update for unconstrained optimization |
| title | Scaling symmetric rank one update for unconstrained optimization |
| title_full | Scaling symmetric rank one update for unconstrained optimization |
| title_fullStr | Scaling symmetric rank one update for unconstrained optimization |
| title_full_unstemmed | Scaling symmetric rank one update for unconstrained optimization |
| title_short | Scaling symmetric rank one update for unconstrained optimization |
| title_sort | scaling symmetric rank one update for unconstrained optimization |
| topic | QA Mathematics |
| url | https://repo.uum.edu.my/id/eprint/761/1/Malik_Abu_Hassan.pdf |
| work_keys_str_mv | AT abuhassanmalik scalingsymmetricrankoneupdateforunconstrainedoptimization AT monsimansor scalingsymmetricrankoneupdateforunconstrainedoptimization AT leongwahjune scalingsymmetricrankoneupdateforunconstrainedoptimization |