Pages that link to "Item:Q2979646"
From MaRDI portal
The following pages link to Sum of squares basis pursuit with linear and second order cone programming (Q2979646):
Displaying 12 items.
- Decomposed structured subsets for semidefinite and sum-of-squares optimization (Q2071977) (← links)
- Multistage distributionally robust mixed-integer programming with decision-dependent moment-based ambiguity sets (Q2097674) (← links)
- Maximum feasible subsystems of distance geometry constraints (Q2131137) (← links)
- Outer approximation with conic certificates for mixed-integer convex problems (Q2195682) (← links)
- Generating valid linear inequalities for nonlinear programs via sums of squares (Q2198537) (← links)
- Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices (Q2301196) (← links)
- On approximations of the PSD cone by a polynomial number of smaller-sized PSD cones (Q2687062) (← links)
- Diagonally Dominant Programming in Distance Geometry (Q2835679) (← links)
- Bounding Extreme Events in Nonlinear Dynamics Using Convex Optimization (Q4983492) (← links)
- Bounding extrema over global attractors using polynomial optimisation (Q5130916) (← links)
- DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization (Q5382573) (← links)
- Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets (Q6561376) (← links)
