Outer Convexification of Constraints

  • Christian Kirches


In this chapter, we take a closer look at combinatorial issues raised by applying outer convexification to constraints that directly depend on a discrete control. We describe several undesirable phenomena that arise when treating such problems with a Sequential Quadratic Programming (SQP) method, and give explanations based on the violation of Linear Independence Constraint Qualification (LICQ). We show that the Nonlinear Programs (NLPs) can instead be treated favorably as Mathematical Programs with Vanishing Constraints (MPVCs), a class of challenging problems with complementary constraints and nonconvex feasible set. We give a summary of a Lagrangian framework for MPVCs due to [3] and others, which allows for the design of derivative based descent methods for the efficient solution of MPVCs in the next chapter.


Sequential Quadratic Programming Feasible Point Tangent Cone Strict Complementarity Condition Branch Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Vieweg+Teubner Verlag | Springer Fachmedien Wiesbaden GmbH 2011

Authors and Affiliations

  • Christian Kirches

There are no affiliations available

Personalised recommendations