Pages that link to "Item:Q3094772"
From MaRDI portal
The following pages link to Approximation Algorithms and Semidefinite Programming (Q3094772):
Displayed 34 items.
- Regularity properties of non-negative sparsity sets (Q342902) (← links)
- Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope (Q740647) (← links)
- Approximating the weighted maximin dispersion problem over an \(\ell _p\)-ball: SDP relaxation is misleading (Q1653283) (← links)
- Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
- A semidefinite programming approach to a cross-intersection problem with measures (Q1683683) (← links)
- Numerical algebraic geometry and semidefinite programming (Q1979983) (← links)
- Tropical spectrahedra (Q1985292) (← links)
- Hyperbolic efficiency measurement: a conic programming approach (Q1999369) (← links)
- On computational capabilities of Ising machines based on nonlinear oscillators (Q2150420) (← links)
- Bistable latch Ising machines (Q2152093) (← links)
- Incompatibility in general probabilistic theories, generalized spectrahedra, and tensor norms (Q2159229) (← links)
- The theta number of simplicial complexes (Q2317686) (← links)
- On Hazan's algorithm for symmetric programming problems (Q2342137) (← links)
- Three-monotone interpolation (Q2354672) (← links)
- Solving generic nonarchimedean semidefinite programs using stochastic game algorithms (Q2409007) (← links)
- Control of multi-scroll Chen system (Q2410786) (← links)
- Approximating projections by quantum operations (Q2685389) (← links)
- Tight Bounds on the Radius of Nonsingularity (Q2803591) (← links)
- On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming (Q2821802) (← links)
- Spotting Trees with Few Leaves (Q3448789) (← links)
- On the Lovász Theta Function for Independent Sets in Sparse Graphs (Q4571926) (← links)
- Variational Gaussian approximation for Poisson data (Q4607825) (← links)
- An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound (Q4634029) (← links)
- A new proof for the existence of degree bounds for Putinar’s Positivstellensatz (Q4635365) (← links)
- The determinant bound for discrepancy is almost tight (Q4908259) (← links)
- Approximability of the Problem of Finding a Vector Subset with the Longest Sum (Q4973237) (← links)
- (Q5053241) (← links)
- Optimal arrangements of classical and quantum states with limited purity (Q5108155) (← links)
- Semidefinite relaxation for the total least squares problem with Tikhonov-like regularization (Q5151536) (← links)
- Spotting Trees with Few Leaves (Q5346548) (← links)
- Application of facial reduction to <i>H</i> <sub>∞</sub> state feedback control problem (Q5742517) (← links)
- The maximum measure of non-trivial 3-wise intersecting families (Q6120852) (← links)
- Graph isomorphism: physical resources, optimization models, and algebraic characterizations (Q6126661) (← links)
- Polyhedral approximation of spectrahedral shadows via homogenization (Q6150652) (← links)