Pages that link to "Item:Q3959766"
From MaRDI portal
The following pages link to Characterizations of optimality without constraint qualification for the abstract convex program (Q3959766):
Displaying 13 items.
- Optimality criteria without constraint qualifications for linear semidefinite problems (Q690528) (← links)
- An extension lemma and homogeneous programming (Q761254) (← links)
- A geometric Gordan-Stiemke theorem (Q798735) (← links)
- Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems (Q1101679) (← links)
- Characterizing optimality in mathematical programming models (Q1108200) (← links)
- Equivalence of a Ky Fan type minimax theorem and a Gordan type alternative theorem (Q1117445) (← links)
- Regularizing the abstract convex program (Q1156085) (← links)
- Generalizations of Slater's constraint qualification for infinite convex programs (Q1198330) (← links)
- Asymptotic dual conditions characterizing optimality for infinite convex programs (Q1379971) (← links)
- A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes (Q1821698) (← links)
- Strong duality and minimal representations for cone optimization (Q1928754) (← links)
- Implicit optimality criterion for convex SIP problem with box constrained index set (Q1939083) (← links)
- Optimization of steerable sensor network for threat detection (Q5300452) (← links)
