In this paper we propose an inexact proximal point method to solve multiobjective minimization problems with locally Lipschitz quasiconvex objective functions on the nonnegative orthant. Assuming that the function is also bounded from below, lower semicontinuous and using proximal distances, we obtain the convergence of the sequences generated by the algorithm. We give some computational results and an application to demand theory is presented.
|Title of host publication||Proceedings of the 2020 3rd International Conference on Robot Systems and Applications, ICRSA 2020|
|Publisher||Association for Computing Machinery|
|Number of pages||7|
|State||Published - 14 Jun 2020|
|Event||3rd International Conference on Robot Systems and Applications, ICRSA 2020 - Chengdu, China|
Duration: 14 Jun 2020 → 16 Jun 2020
|Name||ACM International Conference Proceeding Series|
|Conference||3rd International Conference on Robot Systems and Applications, ICRSA 2020|
|Period||14/06/20 → 16/06/20|
Bibliographical notePublisher Copyright:
© 2020 ACM.
- nonnegative orthant
- proximal method
- quasiconvex multiobjective minimization