A Non-Monotone Line-Search Method for Minimizing Functions with Spurious Local Minima
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866912248375541760 |
|---|---|
| author | Aminifard, Zohreh Grapiglia, Geovani Nunes |
| author_facet | Aminifard, Zohreh Grapiglia, Geovani Nunes |
| contents | In this paper, we propose a new non-monotone line-search method for smooth unconstrained optimization problems with objective functions that have many non-global local minimizers. The method is based on a relaxed Armijo condition that allows a controllable increase in the objective function between consecutive iterations. This property helps the iterates escape from nearby local minimizers in the early iterations. For objective functions with Lipschitz continuous gradients, we derive worst-case complexity estimates on the number of iterations needed for the method to find approximate stationary points. Numerical results are presented, showing that the new method can significantly outperform other non-monotone methods on functions with spurious local minima. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_19319 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Non-Monotone Line-Search Method for Minimizing Functions with Spurious Local Minima Aminifard, Zohreh Grapiglia, Geovani Nunes Optimization and Control In this paper, we propose a new non-monotone line-search method for smooth unconstrained optimization problems with objective functions that have many non-global local minimizers. The method is based on a relaxed Armijo condition that allows a controllable increase in the objective function between consecutive iterations. This property helps the iterates escape from nearby local minimizers in the early iterations. For objective functions with Lipschitz continuous gradients, we derive worst-case complexity estimates on the number of iterations needed for the method to find approximate stationary points. Numerical results are presented, showing that the new method can significantly outperform other non-monotone methods on functions with spurious local minima. |
| title | A Non-Monotone Line-Search Method for Minimizing Functions with Spurious Local Minima |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2502.19319 |