On saddle points in nonconvex semi-infinite programming
In this paper we apply two convexification procedures to the Lagrangian of a nonconvex semi-infinite programming problem. Under the reduction approach it is shown that, locally around a local minimizer, this problem can be transformed equivalently in such a way that the transformed Lagrangian fulfills saddle point optimality conditions, where for the first procedure both the original objective function and constraints (and for the second procedure only the constraints) are substituted by their pth powers with sufficiently large power p. These results allow that local duality theory and corresponding numerical methods (e.g. dual search) can be applied to a broader class of nonconvex problems. Copyright Springer Science+Business Media, LLC. 2012
Volume (Year): 54 (2012)
Issue (Month): 3 (November)
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/business/operations+research/journal/10898|
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Nader Kanzi, 2011. "Necessary optimality conditions for nonsmooth semi-infinite programming problems," Journal of Global Optimization, Springer, vol. 49(4), pages 713-725, April.
- Qingxiang Zhang, 2009. "Optimality conditions and duality for semi-infinite programming involving B-arcwise connected functions," Computational Optimization and Applications, Springer, vol. 45(4), pages 615-629, December.
When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:54:y:2012:i:3:p:433-447. 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.