𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces

✍ Scribed by Zhe Chen; Haiqiao Huang; Kequan Zhao


Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
485 KB
Volume
57
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

✦ Synopsis


Pareto optimal solution

Error term a b s t r a c t

In this paper, we consider a convex vector optimization problem of finding weak Pareto optimal solutions for an extended vector-valued map from a uniformly convex and uniformly smooth Banach space to a real Banach space, with respect to the partial order induced by a closed, convex and pointed cone with a nonempty interior. We propose an inexact vector-valued proximal-type point algorithm based on a Lyapunov functional when the iterates are computed approximately and prove the sequence generated by the algorithm weakly converges to a weak Pareto optimal solution of the vector optimization problem under some mild conditions. Our results improve and generalize some known results.


πŸ“œ SIMILAR VOLUMES


Some vector optimization problems in Ban
✍ Guolin Yu; Sanyang Liu πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 216 KB

In this paper, we consider a vector optimization problem where all functions involved are defined on Banach spaces. New classes of generalized type-I functions are introduced for functions between Banach spaces. Based upon these generalized type-I functions, we obtain a few sufficient optimality con

A hybrid projection method for generaliz
✍ Narin Petrot; Kriengsak Wattanawitoon; Poom Kumam πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier 🌐 English βš– 381 KB

We introduce a hybrid projection iterative scheme for approximating a common element of the set of solutions of a generalized mixed equilibrium problem and the set of fixed points of two quasi-Ο†-nonexpansive mappings in a real uniformly convex and uniformly smooth Banach space. Then, we establish st

General Further Discarding Tests in Geom
✍ Daniel Scholz πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 387 KB

## ABSTRACT Using a geometric branch‐and‐bound technique, my goal in this paper is to compute a sharp outer approximation of all Pareto‐optimal solutions in multicriteria optimization problems. To this end, I propose some general further discarding tests that are based on the Fritz John necessary c