Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2011 Vieweg+Teubner Verlag | Springer Fachmedien Wiesbaden GmbH
About this chapter
Cite this chapter
Kirches, C. (2011). Outer Convexification of Constraints. In: Fast Numerical Methods for Mixed-Integer Nonlinear Model-Predictive Control. Vieweg+Teubner Verlag. https://doi.org/10.1007/978-3-8348-8202-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-8348-8202-8_6
Publisher Name: Vieweg+Teubner Verlag
Print ISBN: 978-3-8348-1572-9
Online ISBN: 978-3-8348-8202-8
eBook Packages: Computer ScienceComputer Science (R0)