Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2402.04281 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909983857180672 |
|---|---|
| author | Millán, Reinier Díaz Ugon, Julien |
| author_facet | Millán, Reinier Díaz Ugon, Julien |
| contents | In this paper we introduce two conceptual algorithms for minimising abstract convex functions. Both algorithms rely on solving a proximal-type subproblem with an abstract Bregman distance based proximal term. We prove their convergence when the set of abstract linear functions forms a linear space. This latter assumption can be relaxed to only require the set of abstract linear functions to be closed under the sum, which is a classical assumption in abstract convexity. We provide numerical examples on the minimisation of nonconvex functions with the presented algorithms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_04281 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Global minimisation of nonconvex functions by generalising the mirror descent method Millán, Reinier Díaz Ugon, Julien Optimization and Control In this paper we introduce two conceptual algorithms for minimising abstract convex functions. Both algorithms rely on solving a proximal-type subproblem with an abstract Bregman distance based proximal term. We prove their convergence when the set of abstract linear functions forms a linear space. This latter assumption can be relaxed to only require the set of abstract linear functions to be closed under the sum, which is a classical assumption in abstract convexity. We provide numerical examples on the minimisation of nonconvex functions with the presented algorithms. |
| title | Global minimisation of nonconvex functions by generalising the mirror descent method |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2402.04281 |