Pages that link to "Item:Q1024728"
From MaRDI portal
The following pages link to New stopping criteria for detecting infeasibility in conic optimization (Q1024728):
Displaying 11 items.
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization (Q298162) (← links)
- Weak infeasibility in second order cone programming (Q518144) (← links)
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming (Q1702782) (← links)
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization (Q1926632) (← links)
- Algebraic connectivity of an even uniform hypergraph (Q1928511) (← links)
- Conic programming: infeasibility certificates and projective geometry (Q1996078) (← links)
- Bad Semidefinite Programs: They All Look the Same (Q2967605) (← links)
- Solving SDP completely with an interior point oracle (Q4999336) (← links)
- A convergent Newton algorithm for computing Z-eigenvalues of an almost nonnegative irreducible tensor (Q5210744) (← links)
- Exact Duality in Semidefinite Programming Based on Elementary Reformulations (Q5501234) (← links)
- Preprocessing and Regularization for Degenerate Semidefinite Programs (Q5746441) (← links)
