Pages that link to "Item:Q987504"
From MaRDI portal
The following pages link to Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices (Q987504):
Displaying 10 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)
- Stationarity and regularity of infinite collections of sets: applications to infinitely constrained optimization (Q1935288) (← links)
- Implicit optimality criterion for convex SIP problem with box constrained index set (Q1939083) (← links)
- How to solve a semi-infinite optimization problem (Q2253347) (← links)
- The algorithm for determination of immobile indixes in convex SIP problems with polyhedral index sets (Q2929008) (← links)
- Sufficient optimality conditions for convex semi-infinite programming (Q3562400) (← 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)
- On the uniform duality in copositive optimization (Q6644265) (← links)