Pages that link to "Item:Q1939083"
From MaRDI portal
The following pages link to Implicit optimality criterion for convex SIP problem with box constrained index set (Q1939083):
Displayed 6 items.
- Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem (Q494875) (← links)
- Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets (Q1682971) (← links)
- Immobile indices and CQ-free optimality criteria for linear copositive programming problems (Q2174923) (← links)
- Optimality conditions for linear copositive programming problems with isolated immobile indices (Q5207739) (← links)
- On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets (Q5413872) (← links)
- Algorithmic determination of immobile indices in convex SIP problems with polyhedral index sets (Q5882389) (← links)
