Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/21592
Title: Convergence analysis of a class of penalty methods for vector optimization problems with cone constraints
Authors: Huang, XX
Yang, XQ 
Teo, KL
Keywords: Convergence
Efficiency
Level-compactness
Penalty method
Vector optimization with cone constraints
Issue Date: 2006
Publisher: Springer
Source: Journal of global optimization, 2006, v. 36, no. 4, p. 637-652 How to cite?
Journal: Journal of global optimization 
Abstract: In this paper, we consider convergence properties of a class of penalization methods for a general vector optimization problem with cone constraints in infinite dimensional spaces. Under certain assumptions, we show that any efficient point of the cone constrained vector optimization problem can be approached by a sequence of efficient points of the penalty problems. We also show, on the other hand, that any limit point of a sequence of approximate efficient solutions to the penalty problems is a weekly efficient solution of the original cone constrained vector optimization problem. Finally, when the constrained space is of finite dimension, we show that any limit point of a sequence of stationary points of the penalty problems is a KKT stationary point of the original cone constrained vector optimization problem if Mangasarian-Fromovitz constraint qualification holds at the limit point.
URI: http://hdl.handle.net/10397/21592
ISSN: 0925-5001
EISSN: 1573-2916
DOI: 10.1007/s10898-004-1937-y
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

8
Last Week
3
Last month
Citations as of Sep 17, 2017

WEB OF SCIENCETM
Citations

6
Last Week
0
Last month
0
Citations as of Sep 14, 2017

Page view(s)

23
Last Week
1
Last month
Checked on Sep 18, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.