Nonmonotone Trust-Region Methods for Optimization of Set-Valued Mapping of Finite Cardinality
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914051934650368 |
|---|---|
| author | Ghosh, Suprova Ghosh, Debdas Peng, Zai-Yun Long, Xian-Jun |
| author_facet | Ghosh, Suprova Ghosh, Debdas Peng, Zai-Yun Long, Xian-Jun |
| contents | Non-monotone trust-region methods are known to provide additional benefits for scalar and multi-objective optimization, such as enhancing the probability of convergence and improving the speed of convergence. For optimization of set-valued maps, non-monotone trust-region methods have not yet been explored and investigated to see if they show similar benefits. Thus, in this article, we propose two non-monotone trust-region schemes--max-type and average-type for set-valued optimization. Using these methods, the aim is to find \emph{K}-critical points for a non-convex unconstrained set optimization problem through vectorization and oriented-distance scalarization. The main modification in the existing trust region method for set optimization occurs in reduction ratios, where max-type uses the maximum over function values from the last few iterations, and avg-type uses an exponentially weighted moving average of successive previous function values till the current iteration. Under appropriate assumptions, we show the global convergence of the proposed methods. To verify their effectiveness, we numerically compare their performance with the existing trust region method, steepest descent method, and conjugate gradient method using performance profile in terms of three metrics: number of non-convergence, number of iterations, and computation time. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_14426 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Nonmonotone Trust-Region Methods for Optimization of Set-Valued Mapping of Finite Cardinality Ghosh, Suprova Ghosh, Debdas Peng, Zai-Yun Long, Xian-Jun Optimization and Control Non-monotone trust-region methods are known to provide additional benefits for scalar and multi-objective optimization, such as enhancing the probability of convergence and improving the speed of convergence. For optimization of set-valued maps, non-monotone trust-region methods have not yet been explored and investigated to see if they show similar benefits. Thus, in this article, we propose two non-monotone trust-region schemes--max-type and average-type for set-valued optimization. Using these methods, the aim is to find \emph{K}-critical points for a non-convex unconstrained set optimization problem through vectorization and oriented-distance scalarization. The main modification in the existing trust region method for set optimization occurs in reduction ratios, where max-type uses the maximum over function values from the last few iterations, and avg-type uses an exponentially weighted moving average of successive previous function values till the current iteration. Under appropriate assumptions, we show the global convergence of the proposed methods. To verify their effectiveness, we numerically compare their performance with the existing trust region method, steepest descent method, and conjugate gradient method using performance profile in terms of three metrics: number of non-convergence, number of iterations, and computation time. |
| title | Nonmonotone Trust-Region Methods for Optimization of Set-Valued Mapping of Finite Cardinality |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2509.14426 |