Pages that link to "Item:Q3562400"
From MaRDI portal
The following pages link to Sufficient optimality conditions for convex semi-infinite programming (Q3562400):
Displaying 16 items.
- Optimality criteria without constraint qualifications for linear semidefinite problems (Q690528) (← links)
- Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices (Q987504) (← links)
- Optimality conditions for semi-preinvex programming (Q1378362) (← links)
- Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets (Q1682971) (← links)
- Implicit optimality criterion for convex SIP problem with box constrained index set (Q1939083) (← links)
- A refined theorem concerning the conditioning of semidefinite programs (Q2454984) (← links)
- Optimality conditions for non-smooth semi-infinite programming (Q2786319) (← links)
- Generalized Semi-Infinite Programming: Optimality Conditions Involving Reverse Convex Problems (Q2877727) (← links)
- γ-Active Constraints in Convex Semi-Infinite Programming (Q2877741) (← links)
- Sufficient optimality conditions for semi-infinite optimization problems as special \(C^{1,1}\)-problems. (Q3985680) (← links)
- (Q4322714) (← links)
- (Q4668537) (← links)
- Optimality and duality for nonsmooth semi-infinite multiobjective programming with support functions (Q4987689) (← links)
- On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets (Q5413872) (← links)
- A stochastic approximation method for convex programming with many semidefinite constraints (Q5882223) (← links)
- Set-valued semi-infinite programming problems with \(\tau\)-cone arcwise connectedness of higher-order (Q6586846) (← links)
