The following pages link to (Q5852066):
Displaying 11 items.
- Robust Farkas' lemma for uncertain linear systems with applications (Q548208) (← links)
- New strong duality results for convex programs with separable constraints (Q613429) (← links)
- A note on nonconvex minimax theorem with separable homogeneous polynomials (Q637566) (← links)
- Optimality criteria without constraint qualifications for linear semidefinite problems (Q690528) (← links)
- Farkas' lemma for separable sublinear inequalities without qualifications (Q732779) (← links)
- Liberating the subgradient optimality conditions from constraint qualifications (Q857800) (← links)
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications (Q974991) (← links)
- Valid inequalities for separable concave constraints with indicator variables (Q1801013) (← links)
- Global error bounds for piecewise convex polynomials (Q1942267) (← links)
- Duality theorems for separable convex programming without qualifications (Q2359787) (← links)
- Optimality theorems for linear fractional optimization problems involving integral functions defined on Cn [0,1] (Q5889943) (← links)