Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/5884
PIRA download icon_1.1View/Download Full Text
Title: Nonlinear Lagrangian for multiobjective optimization and applications to duality and exact penalization
Authors: Huang, XX
Yang, XQ 
Issue Date: 2002
Source: SIAM journal on optimization, 2002, v. 13, no. 3, p. 675–692
Abstract: Duality and penalty methods are popular in optimization. The study on duality and penalty methods for nonconvex multiobjective optimization problems is very limited. In this paper, we introduce vector-valued nonlinear Lagrangian and penalty functions and formulate nonlinear Lagrangian dual problems and nonlinear penalty problems for multiobjective constrained optimization problems. We establish strong duality and exact penalization results. The strong duality is an inclusion between the set of infimum points of the original multiobjective constrained optimization problem and that of the nonlinear Lagrangian dual problem. Exact penalization is established via a generalized calmness-type condition.
Keywords: Multiobjective optimization
Nonlinear Lagrangian function
Duality
Exact penalization
Stability
Publisher: Society for Industrial and Applied Mathematics
Journal: SIAM Journal on optimization 
ISSN: 1052-6234
EISSN: 1095-7189
DOI: 10.1137/S1052623401384850
Rights: © 2002 Society for Industrial and Applied Mathematics
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
Huang_Nonlinear_Lagrangian_Duality.pdf206.32 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page views

100
Last Week
2
Last month
Citations as of Apr 14, 2024

Downloads

219
Citations as of Apr 14, 2024

SCOPUSTM   
Citations

23
Last Week
0
Last month
0
Citations as of Apr 12, 2024

WEB OF SCIENCETM
Citations

21
Last Week
0
Last month
0
Citations as of Apr 11, 2024

Google ScholarTM

Check

Altmetric


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