Pages that link to "Item:Q2188244"

The following pages link to Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming (Q2188244):

Displaying 15 items.

• A comparison of solution approaches for the numerical treatment of or-constrained optimization problems (Q1986109) (← links)
• Sequential optimality conditions for cardinality-constrained optimization problems with applications (Q2044577) (← 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)
• Global convergence of augmented Lagrangian method applied to mathematical program with switching constraints (Q2691360) (← links)
• Optimality conditions, approximate stationarity, and applications – a story beyond lipschitzness (Q5093796) (← links)
• On the linear independence constraint qualification in disjunctive programming (Q5151501) (← links)
• Relaxation schemes for mathematical programmes with switching constraints (Q5865340) (← links)
• Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming (Q5879577) (← links)
• An augmented Lagrangian method for optimization problems with structured geometric constraints (Q6038673) (← links)
• (Q6056675) (← 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)
• On Frèchet normal cone for nonsmooth mathematical programming problems with switching constraints (Q6140976) (← links)
• Constraint qualifications and optimality criteria for nonsmooth multiobjective programming problems on Hadamard manifolds (Q6150648) (← links)