Pages that link to "Item:Q1751222"
From MaRDI portal
The following pages link to Optimization over structured subsets of positive semidefinite matrices via column generation (Q1751222):
Displaying 17 items.
- LP-based tractable subcones of the semidefinite plus nonnegative cone (Q1657406) (← links)
- Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods (Q2010087) (← links)
- Polyhedral approximations of the semidefinite cone and their application (Q2028478) (← links)
- Decomposed structured subsets for semidefinite and sum-of-squares optimization (Q2071977) (← links)
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (Q2146997) (← 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)
- Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes (Q2696926) (← links)
- Sum of squares basis pursuit with linear and second order cone programming (Q2979646) (← links)
- Scalable Optimization Methods for Incorporating Spatiotemporal Fractionation into Intensity-Modulated Radiotherapy Planning (Q5086022) (← links)
- A Scalable Algorithm for Sparse Portfolio Selection (Q5087719) (← 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)
- Evaluating approximations of the semidefinite cone with trace normalized distance (Q6043109) (← links)
- A Sum of Squares Characterization of Perfect Graphs (Q6087752) (← links)
- Tighter bounds on transient moments of stochastic chemical systems (Q6182326) (← links)
