Zero duality gap for a class of nonconvex optimization problems
Journal of Optimization Theory and Applications
Stable local minimizers in semi-infinite optimization: regularity and second-order conditions
Journal of Computational and Applied Mathematics
Optimization: algorithms and consistent approximations
Optimization: algorithms and consistent approximations
Local saddle points and convexification for nonconvex optimization problems
Journal of Optimization Theory and Applications
Saddle point generation in nonlinear nonconvex optimization
Proceedings of second world congress on Nonlinear analysts
Local convexification of the Lagrangian function in nonconvex optimization
Journal of Optimization Theory and Applications
BI-Level Strategies in Semi-Infinite Programming
BI-Level Strategies in Semi-Infinite Programming
An Analytic Center Cutting Plane Method for Solving Semi-Infinite Variational Inequality Problems
Journal of Global Optimization
Nonlinear Optimization in Finite Dimensions - Morse Theory, Chebyshev Approximation, Transversality, Flows, Parametric Aspects (Nonconvex Optimization and its Applications Volume 47)
Generalized semi-infinite programming: A tutorial
Journal of Computational and Applied Mathematics
Journal of Global Optimization
Necessary optimality conditions for nonsmooth semi-infinite programming problems
Journal of Global Optimization
Hi-index | 0.00 |
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.