Comparison between FMAR SD method and NRMI CG method and application
The FMAR steepest descent method and NRMI conjugate gradient method are the modification methods in the steepest descent method and conjugate gradient method respectively. Both methods are to minimize nonlinear unconstrained optimization problems. In this paper, a comparison has been made between th...
| Published in: | AIP Conference Proceedings |
|---|---|
| Main Author: | |
| Format: | Conference paper |
| Language: | English |
| Published: |
American Institute of Physics
2024
|
| Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85188428076&doi=10.1063%2f5.0193408&partnerID=40&md5=8a6143dc50d22455bef82bde83a27480 |
| Summary: | The FMAR steepest descent method and NRMI conjugate gradient method are the modification methods in the steepest descent method and conjugate gradient method respectively. Both methods are to minimize nonlinear unconstrained optimization problems. In this paper, a comparison has been made between the NRMI conjugate gradient method and the FMAR steepest descent method by using an exact line search and apply in real-life problems since there exist modifications in the conjugate gradient method and steepest descent method. Algorithms are presented and implemented in MATLAB software for both methods. Numerical results are presented based on the number of iterations and central processing unit time which have shown that the NRMI CG method performs better than the FMAR SD method for given standard test problems and is recommended to be applied in other real-life problems. © 2024 Author(s). |
|---|---|
| ISSN: | 0094243X |
| DOI: | 10.1063/5.0193408 |