We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Mathematics/First-and second-order optimality conditions for mathematical programs with vanishing constraints
PeriodicalsMathematics

First-and second-order optimality conditions for mathematical programs with vanishing constraints

Checking your access to this record.

Abstract & Overview

We consider a special class of optimization problems that we call Mathematical Programs with Vanishing Constraints , MPVC for short, which serves as a unified framework for several applications in structural and topology optimization. Since an MPVC most often violates stronger standard constraint qualification, first-order necessary optimality conditions, weaker than the standard KKT-conditions, were recently investigated in depth. This paper enlarges the set of optimality criteria by stating first-order sufficient and second-order necessary and sufficient optimality conditions for MPVCs.

Cite this record

Tim Hoheisel, Christian Kanzow (2007). First-and second-order optimality conditions for mathematical programs with vanishing constraints. Applications of Mathematics, 52(6), 495–514. https://doi.org/10.1007/s10492-007-0029-y

Copy in another style

Hoheisel, T., & Kanzow, C. (2007). First-and second-order optimality conditions for mathematical programs with vanishing constraints. Applications of Mathematics, 52(6), 495–514. https://doi.org/10.1007/s10492-007-0029-y
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.