Abstract
In this article, we develop a generalized proximal point algorithm for finding a weak Pareto optimal solution of minimizing an extended vector-valued map with respect to the positive orthant in finite-dimensional spaces by the virtue of a Bregman distance function.
| Original language | English |
|---|---|
| Pages (from-to) | 935-949 |
| Number of pages | 15 |
| Journal | Applicable Analysis |
| Volume | 90 |
| Issue number | 6 |
| DOIs | |
| Publication status | Published - 1 Jun 2011 |
Keywords
- Bregman distance function
- Generalized proximal point algorithm
- Multiobjective optimization
- Weak Pareto optimal solution
ASJC Scopus subject areas
- Analysis
- Applied Mathematics
Fingerprint
Dive into the research topics of 'Generalized proximal point algorithms for multiobjective optimization problems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver