.png){kind=icon}
Return
An interior proximal method in vector optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2011.05.006.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 maps from R-n to R-m, with respect to the partial order induced by a closed, convex, and pointed cone C subset of R-m, with nonempty interior. We develop for this problem an extension of the proximal point method for scalar-valued convex optimization problem with a modified convergence sensing condition that allows us to construct an interior proximal method for solving VOP on nonpolyhedral set. (C) 2011 Elsevier B.V. All rights reserved.
Keywords:
Interior point methods
Vector optimization
C-convex
Positively lower semicontinuous
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveA method for finding the set of non-dominated vectors for multiple objective integer linear programs
PREAI
ShareSaveMigration of the northern evergreen needleleaf timberline in Siberia in the 21<sup>st</sup> century
OAAI
OAAIShareSaveA computational avenue towards understanding and design of zwitterionic anti-biofouling materials
PREAI
ShareSave
View more