Pages that link to "Item:Q2435031"
From MaRDI portal
The following pages link to Copositive programming via semi-infinite optimization (Q2435031):
Displaying 12 items.
- First order solutions in conic programming (Q890175) (← links)
- Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets (Q1682971) (← links)
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization (Q1704915) (← links)
- Recent contributions to linear semi-infinite optimization: an update (Q1730534) (← links)
- Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma (Q1987329) (← links)
- On strong duality in linear copositive programming (Q2149604) (← links)
- Immobile indices and CQ-free optimality criteria for linear copositive programming problems (Q2174923) (← links)
- An exact explicit dual for the linear copositive programming problem (Q2679002) (← links)
- Genericity Results in Linear Conic Programming—A Tour d’Horizon (Q2976141) (← links)
- On equivalent representations and properties of faces of the cone of copositive matrices (Q5044098) (← links)
- Optimality conditions for linear copositive programming problems with isolated immobile indices (Q5207739) (← links)
- Copositive tensor optimization problem and its applications to hypergraphs (Q6189813) (← links)
