Pages that link to "Item:Q1926632"
From MaRDI portal
The following pages link to How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization (Q1926632):
Displaying 12 items.
- 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)
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone (Q1785193) (← links)
- On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming (Q1928305) (← links)
- Numerical algebraic geometry and semidefinite programming (Q1979983) (← links)
- Conic programming: infeasibility certificates and projective geometry (Q1996078) (← links)
- Douglas-Rachford splitting and ADMM for pathological convex optimization (Q2282817) (← links)
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs (Q2293657) (← links)
- A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs (Q2316619) (← links)
- Perturbed sums-of-squares theorem for polynomial optimization and its applications (Q2811486) (← links)
- Bad Semidefinite Programs: They All Look the Same (Q2967605) (← links)
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 (Q6170529) (← links)
