Generalized Proximal Method for Efficient Solutions in Vector Optimization
This article is devoted to developing the generalized proximal algorithm of finding efficient solutions to the vector optimization problem for a mapping from a uniformly convex and uniformly smooth Banach space to a real Banach space with respect to the partial order induced by a pointed closed conv...
Saved in:
| Published in | Numerical functional analysis and optimization Vol. 32; no. 8; pp. 843 - 857 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
Philadelphia, PA
Taylor & Francis Group
01.08.2011
Taylor & Francis |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0163-0563 1532-2467 |
| DOI | 10.1080/01630563.2011.587072 |
Cover
| Summary: | This article is devoted to developing the generalized proximal algorithm of finding efficient solutions to the vector optimization problem for a mapping from a uniformly convex and uniformly smooth Banach space to a real Banach space with respect to the partial order induced by a pointed closed convex cone. In contrast to most published literature on this subject, our algorithm does not depend on the nonemptiness of ordering cone of the space under consideration and deals with finding efficient solutions of the vector optimization problem in question. We prove that under some suitable conditions the sequence generated by our method weakly converges to an efficient solution of this problem. |
|---|---|
| Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| ISSN: | 0163-0563 1532-2467 |
| DOI: | 10.1080/01630563.2011.587072 |