Abstract
In this paper we propose a scalarization proximal point method to solve multiobjective unconstrained minimization problems with locally Lipschitz and quasiconvex vector functions. We prove, under natural assumptions, that the sequence generated by the method is well defined and converges globally to a Pareto-Clarke critical point. Our method may be seen as an extension, for nonconvex case, of the inexact proximal method for multiobjective convex minimization problems studied by Bonnel et al. (SIAM J Optim 15(4):953–970, 2005).
| Original language | English |
|---|---|
| Pages (from-to) | 79-96 |
| Number of pages | 18 |
| Journal | Journal of Global Optimization |
| Volume | 64 |
| Issue number | 1 |
| DOIs | |
| State | Published - 1 Jan 2016 |
| Externally published | Yes |
Keywords
- Clarke subdifferential
- Fejér convergence
- Multiobjective minimization
- Pareto-Clarke critical point
- Proximal point methods
- Quasiconvex functions
Fingerprint
Dive into the research topics of 'A scalarization proximal point method for quasiconvex multiobjective minimization'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver