Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/4767
Title: Optimality conditions via exact penalty functions
Authors: Meng, K
Yang, XQ 
Keywords: KKT optimality condition
Nonlinear programming problem
Mathematical programs with complementarity constraints
Strong stationarity
Mordukhovich stationarity
Exact penalty function
Issue Date: 2010
Publisher: Society for Industrial and Applied Mathematics
Source: SIAM journal on optimization, 2010, v. 20, no. 6, p. 3208-3231 How to cite?
Journal: SIAM journal on optimization 
Abstract: In this paper, we study KKT optimality conditions for constrained nonlinear programming problems and strong and Mordukhovich stationarities for mathematical programs with complementarity constraints using ɭp penalty functions, with 0 ≤ p ≤ 1. We introduce some optimality indication sets by using contingent derivatives of penalty function terms. Some characterizations of optimality indication sets are obtained by virtue of the original problem data. We show that the KKT optimality condition holds at a feasible point if this point is a local minimizer of some ɭp penalty function with p belonging to the optimality indication set. Our result on constrained nonlinear programming includes some existing results from the literature as special cases.
URI: http://hdl.handle.net/10397/4767
ISSN: 1052-6234
EISSN: 1095-7189
DOI: 10.1137/090771016
Rights: © 2010 Society for Industrial and Applied Mathematics
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
Meng_Optimality_conditions_exact.pdf283.6 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

9
Last Week
0
Last month
1
Citations as of Jul 20, 2017

WEB OF SCIENCETM
Citations

8
Last Week
0
Last month
0
Citations as of Aug 13, 2017

Page view(s)

256
Last Week
4
Last month
Checked on Aug 14, 2017

Download(s)

77
Checked on Aug 14, 2017

Google ScholarTM

Check

Altmetric



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