The following pages link to (Q4496015):
Displayed 10 items.
- Facial reduction algorithms for conic optimization problems (Q368590) (← links)
- On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function (Q425872) (← links)
- Primal-dual stability in continuous linear optimization (Q959934) (← links)
- On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization (Q1926632) (← links)
- Polynomials nonnegative on a grid and discrete optimization (Q2759070) (← links)
- Simultaneous Diagonalization of Matrices and Its Applications in Quadratically Constrained Quadratic Programming (Q2817836) (← links)
- Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
- Some Recent Developments in Spectrahedral Computation (Q4556598) (← links)
- A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms (Q6041108) (← links)