Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming (Q2188244)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming |
scientific article |
Statements
Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming (English)
0 references
10 June 2020
0 references
In this paper, the author shows that reasonable constraint qualifications from nonlinear programming may easily fail to hold at the feasible points of (MPSC), and so, weaker stationarity notions are studied. Furthermore, MPSC-tailored versions of MFCQ and LICQ are introduced. The MPSC-tailored versions of the Abadie and Guignard constraint qualification are some of the weakest regularity conditions from nonlinear programming. These conclusions are applied to state necessary optimality conditions for (discretized) optimal control problems with switching constraints, for example, a switching-constrained reformulation of mathematical programs with either-or-constraints.
0 references
constraint qualifications
0 references
nonlinear programming
0 references
optimality conditions
0 references
switching constraints
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
