Saddle point and exact penalty representation for generalized proximal Lagrangians
In this paper, we introduce a generalized proximal Lagrangian function for the constrained nonlinear programming problem and discuss existence of its saddle points. In particular, the local saddle point is obtained by using the second-order sufficient conditions, and the global saddle point is given without requiring compactness of constraint set and uniqueness of the optimal solution. Finally, we establish equivalent relationship between global saddle points and exact penalty representations. Copyright Springer Science+Business Media, LLC. 2012
Volume (Year): 54 (2012)
Issue (Month): 4 (December)
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/business/operations+research/journal/10898|
When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:54:y:2012:i:4:p:669-687. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Rebekah McClure)
If references are entirely missing, you can add them using this form.