Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/65424
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Applied Mathematics | en_US |
dc.creator | Meng, K | en_US |
dc.creator | Yang, X | en_US |
dc.date.accessioned | 2017-05-22T02:08:35Z | - |
dc.date.available | 2017-05-22T02:08:35Z | - |
dc.identifier.issn | 1877-0533 | en_US |
dc.identifier.uri | http://hdl.handle.net/10397/65424 | - |
dc.language.iso | en | en_US |
dc.publisher | Springer | en_US |
dc.rights | © Springer Science+Business Media Dordrecht 2016 | en_US |
dc.rights | This version of the article has been accepted for publication, after peer review (when applicable) and is subject to Springer Nature’s AM terms of use (https://www.springernature.com/gp/open-research/policies/accepted-manuscript-terms), but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: http://dx.doi.org/10.1007/s11228-016-0360-0 | en_US |
dc.subject | Exact penalization | en_US |
dc.subject | Local sharp minimum | en_US |
dc.subject | Regular subdifferential | en_US |
dc.subject | Smallest penalty parameter | en_US |
dc.subject | Subderivative | en_US |
dc.title | Variational analysis on local sharp minima via exact penalization | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 619 | en_US |
dc.identifier.epage | 635 | en_US |
dc.identifier.volume | 24 | en_US |
dc.identifier.issue | 4 | en_US |
dc.identifier.doi | 10.1007/s11228-016-0360-0 | en_US |
dcterms.abstract | In this paper we study local sharp minima of the nonlinear programming problem via exact penalization. Utilizing generalized differentiation tools in variational analysis such as subderivatives and regular subdifferentials, we obtain some primal and dual characterizations for a penalty function associated with the nonlinear programming problem to have a local sharp minimum. These general results are then applied to the ?p penalty function with 0 ? p ? 1. In particular, we present primal and dual equivalent conditions in terms of the original data of the nonlinear programming problem, which guarantee that the ?p penalty function has a local sharp minimum with a finite penalty parameter in the case of p?(12,1] and p=12 respectively. By assuming the Guignard constraint qualification (resp. the generalized Guignard constraint qualification), we also show that a local sharp minimum of the nonlinear programming problem can be an exact local sharp minimum of the ?p penalty function with p ? [0, 1] (resp. p?[0,12]). Finally, we give some formulas for calculating the smallest penalty parameter for a penalty function to have a local sharp minimum. | en_US |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Set-valued and variational analysis, Dec. 2016, v. 24, no. 4, p. 619-635 | en_US |
dcterms.isPartOf | Set-valued and variational analysis | en_US |
dcterms.issued | 2016-12 | - |
dc.identifier.isi | WOS:000393231300007 | - |
dc.identifier.scopus | 2-s2.0-84994509059 | - |
dc.identifier.ros | 2016000198 | - |
dc.source.type | Article | - |
dc.identifier.eissn | 1877-0541 | en_US |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | AMA-0535 | - |
dc.description.fundingSource | RGC | en_US |
dc.description.pubStatus | Published | en_US |
dc.identifier.OPUS | 6693557 | - |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Yang_Variational_Analysis_Local.pdf | Pre-Published version | 821.67 kB | Adobe PDF | View/Open |
Page views
102
Last Week
0
0
Last month
Citations as of Mar 24, 2024
Downloads
31
Citations as of Mar 24, 2024
SCOPUSTM
Citations
1
Last Week
0
0
Last month
Citations as of Mar 28, 2024
WEB OF SCIENCETM
Citations
1
Last Week
0
0
Last month
Citations as of Mar 28, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.