.png){kind=icon}
.png){kind=icon}
Return
Approximate proximal methods in vector optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2006.09.070.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper studies the vector optimization problem of finding weakly efficient points for mappings in a Banach space Y, with respect to the partial order induced by a closed, convex, and pointed cone C subset of Y with a nonempty interior. The proximal method in vector optimization is extended to develop an approximate proximal method for this problem by virtue of the approximate proximal point method for finding a root of a maximal monotone operator. In this approximate proximal method, the subproblems consist of finding weakly efficient points for suitable regularizations of the original mapping. We present both an absolute and a relative version, in which the subproblems are solved only approximately. Weak convergence of the generated sequence to a weak efficient point is established. In addition, we also discuss an extension to Bregman-function-based proximal algorithms for finding weakly efficient points for mappings. (c) 2006 Elsevier B.V. All rights reserved.
Keywords:
vector optimization
proximal point
inexact algorithm
Banach space
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available