Abstract
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.
Similar content being viewed by others
References
Bazaraa M.S., Sherali H.D., Shetty C.M.: Nonlinear Programming: Theory and Algorithms. Wiley, Chichester (2006)
Fang S.-C., Wu S.-Y., Sun J.: An analytic center cutting plane method for solving semi-infinite variational inequality problems. J. Glob. Optim. 28(2), 141–152 (2004)
Gauvin J.: A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming. Math. Program. 12, 136–138 (1977)
Goberna M.A., López M.A.: Linear Semi-infinite Optimization. Wiley, Chichester (1998)
Goberna M.A., López M.A.: Semi-Infinite Programming—Recent Advances. Kluwer, Boston (2001)
Guerra Vázquez F., Rückmann J.-J., Stein O., Still G.: Generalized semi-infinite programming: a tutorial. J. Comput. Appl. Math. 217, 394–419 (2008)
Hettich R., Jongen H.Th.: Semi-infinite programming: conditions of optimality and applications. In: Stoer, J. (eds) Optimization Techniques 2, pp. 1–11. Springer, Berlin (1978)
Hettich R., Kortanek K.O.: Semi-infinite programming: theory, methods, and applications. SIAM Rev. 35(3), 380–429 (1993)
Hettich R., Still G.: Second order optimality conditions for generalized semi-infinite programming problems. Optimization 34, 195–211 (1995)
Hettich R., Zencke P.: Numerische Methoden der Approximation und semi-infiniten Optimierung. Teubner, Stuttgart (1982)
Jongen H.Th., Jonker P., Twilt F.: Nonlinear Optimization in Finite Dimensions. Kluwer, Boston (2000)
Jongen H.Th., Möbert T., Rückmann J.-J., Tammer K.: On inertia and Schur complement in optimization. Linear Algebra Appl. 95, 97–109 (1987)
Jongen H.Th., Wetterling W.W.E., Zwier G.: On sufficient conditions for local optimality in semi-infinite optimization. Optimization 18, 165–178 (1987)
Kanzi N.: Necessary optimality conditions for nonsmooth semi-infinite programming problems. J. Glob. Optim. 49(4), 713–725 (2011)
Klatte D.: Stability of stationary solutions in semi-infinite optimization via the reduction approach. In: Oettli, W., Pallaschke, D. (eds) Advances in Optimization, pp. 155–170. Springer, Berlin (1992)
Klatte D.: Stable local minimizers in semi-infinite optimization: regularity and second-order conditions. J. Comput. Appl. Math. 56, 137–157 (1994)
Klatte D.: On regularity and stability in semi-infinite optimization. Set-Valued Anal. 3, 101–111 (1995)
Kojima, M.: Strongly stable stationary solutions in nonlinear programs. In: Robinson, S.M. (ed.) Analysis and Computation of Fixed Points, pp. 93–138. Academic Press, New York (1980)
Li D.: Zero duality gap for a class of nonconvex optimization problems. J. Optim. Theory Appl. 85, 309–324 (1995)
Li D.: Saddle-point generation in nonlinear nonconvex optimization. Nonlinear Anal. 30, 4339–4344 (1997)
Li D., Sun X.L.: Local convexification of the Lagrangian function in nonconvex optimization. J. Optim. Theory Appl. 104, 109–120 (2000)
Ouelette D.V.: Schur complements and statistics. Linear Algebra Appl. 36, 187–295 (1981)
Polak E.: Optimization Algorithms and Consistent Approximations. Springer, Berlin (1997)
Reemtsen, R., Rückmann, J.-J. (eds): Semi-Infinite Programming. Kluwer, Boston (1998)
Rückmann J.-J.: On existence and uniqueness of stationary points in semi-infinite optimization. Math. Program. 86, 387–415 (1999)
Stein O.: Bilevel Strategies in Semi-infinite Programming. Kluwer, Boston (2003)
Wetterling W.W.E.: Definitheitsbedingungen für relative Extrema bei Optimierungs- und Approximationsaufgaben. Numerische Mathematik 15, 122–136 (1970)
Xu Z.K.: Local saddle points and convexification for nonconvex optimization problems. J. Optim. Theory Appl. 94, 739–746 (1997)
Zhang Q.: Optimality conditions and duality for semi-infinite programming involving B-arcwise connected functions. J. Glob. Optim. 45(4), 615–629 (2009)
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was partially supported by CONACyT grant 55681, México and by SNI (Sistema Nacional de Investigadores, México).
Rights and permissions
About this article
Cite this article
Guerra-Vázquez, F., Rückmann, JJ. & Werner, R. On saddle points in nonconvex semi-infinite programming. J Glob Optim 54, 433–447 (2012). https://doi.org/10.1007/s10898-011-9753-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-011-9753-7
Keywords
- Semi-infinite programming
- Lagrangian function
- (Partial)P-power formulation
- Local convexification
- Duality