The following pages link to (Q2762830):
Displaying 5 items.
- A polynomial time constraint-reduced algorithm for semidefinite optimization problems (Q493064) (← links)
- Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems (Q630020) (← links)
- Analyticity of weighted central paths and error bounds for semidefinite programming (Q948959) (← links)
- Strong duality and minimal representations for cone optimization (Q1928754) (← links)
- Generating and measuring instances of hard semidefinite programs (Q1960189) (← links)
