Pages that link to "Item:Q1424271"
From MaRDI portal
The following pages link to Semidefinite programming relaxations for semialgebraic problems (Q1424271):
Displaying 7 items.
- Exploiting equalities in polynomial programming (Q935230) (← links)
- Chebyshev model arithmetic for factorable functions (Q1675562) (← links)
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems (Q1939707) (← links)
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs (Q2349139) (← links)
- Robust global optimization with polynomials (Q2492692) (← links)
- Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations (Q5376454) (← links)
- DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization (Q5382573) (← links)
