Pages that link to "Item:Q2506181"
From MaRDI portal
The following pages link to On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes (Q2506181):
Displaying 12 items.
- A Frank-Wolfe type theorem for nondegenerate polynomial programs (Q463745) (← links)
- Irreducible infeasible sets in convex mixed-integer programs (Q495724) (← links)
- Unboundedness in reverse convex and concave integer programming (Q604803) (← links)
- On boundedness of (quasi-)convex integer optimization problems (Q999128) (← links)
- Conditions for boundedness in concave programming under reverse convex and convex constraints (Q1006541) (← links)
- Global error bounds for piecewise convex polynomials (Q1942267) (← links)
- On the solution existence and stability of polynomial optimization problems (Q2136888) (← links)
- Feasible partition problem in reverse convex and convex mixed-integer programming (Q2256208) (← links)
- Minimal infeasible constraint sets in convex integer programs (Q2268936) (← links)
- Notes on the optimization problems corresponding to polynomial complementarity problems (Q2302764) (← links)
- Optimality Conditions for Minimizers at Infinity in Polynomial Programming (Q5108246) (← links)
- Γ‐robust linear complementarity problems with ellipsoidal uncertainty sets (Q6092525) (← links)