Pages that link to "Item:Q4639115"
From MaRDI portal
The following pages link to New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints (Q4639115):
Displaying 12 items.
- A comparison of solution approaches for the numerical treatment of or-constrained optimization problems (Q1986109) (← links)
- Optimality conditions and exact penalty for mathematical programs with switching constraints (Q2046549) (← links)
- Sufficient conditions for metric subregularity of constraint systems with applications to disjunctive and ortho-disjunctive programs (Q2116023) (← links)
- Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming (Q2188244) (← links)
- Linearized M-stationarity conditions for general optimization problems (Q2328209) (← links)
- On the linear independence constraint qualification in disjunctive programming (Q5151501) (← links)
- An augmented Lagrangian method for optimization problems with structured geometric constraints (Q6038673) (← links)
- Relaxed constant positive linear dependence constraint qualification for disjunctive systems (Q6076766) (← links)
- Inexact penalty decomposition methods for optimization problems with geometric constraints (Q6133301) (← links)
- Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)
- Optimality conditions and constraint qualifications for cardinality constrained optimization problems (Q6615623) (← links)
- On the directional asymptotic approach in optimization theory (Q6665398) (← links)
