Pages that link to "Item:Q611309"
From MaRDI portal
The following pages link to Polyhedral and semidefinite programming methods in combinatorial optimization (Q611309):
Displaying 29 items.
- Lift-and-project ranks of the stable set polytope of joined \(a\)-perfect graphs (Q299078) (← links)
- Facial reduction algorithms for conic optimization problems (Q368590) (← links)
- Guaranteed clustering and biclustering via semidefinite programming (Q463740) (← links)
- Convexity of the image of a quadratic map via the relative entropy distance (Q464812) (← links)
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods (Q494329) (← links)
- A note on alternating projections for ill-posed semidefinite feasibility problems (Q517318) (← links)
- Certifying numerical estimates of spectral gaps (Q1647864) (← links)
- Lift-and-project ranks of the set covering polytope of circulant matrices (Q1759829) (← links)
- Noisy Euclidean distance matrix completion with a single missing node (Q2010104) (← links)
- Perturbation analysis of singular semidefinite programs and its applications to control problems (Q2026715) (← links)
- On the spectral structure of Jordan-Kronecker products of symmetric and skew-symmetric matrices (Q2226438) (← links)
- Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem (Q2272297) (← links)
- A bound on the Carathéodory number (Q2401297) (← links)
- Irreducible infeasible subsystems of semidefinite systems (Q2420811) (← links)
- New approaches for optimizing over the semimetric polytope (Q2576727) (← links)
- Semidefinite programming in combinatorial and polynomial optimization (Q2889301) (← links)
- Bad Semidefinite Programs: They All Look the Same (Q2967605) (← links)
- Polyhedral techniques in combinatorial optimization II: applications and computations (Q4262981) (← links)
- Facial Reduction and Partial Polyhedrality (Q4586172) (← links)
- Semidefinite Approximation of Closed Convex Set (Q4613906) (← links)
- Polyhedral techniques in combinatorial optimization I: Theory (Q4715790) (← links)
- Primal-Dual Interior-Point Methods for Domain-Driven Formulations (Q5119848) (← links)
- Coordinate Shadows of Semidefinite and Euclidean Distance Matrices (Q5258947) (← links)
- Preprocessing and Regularization for Degenerate Semidefinite Programs (Q5746441) (← links)
- Error Bounds and Singularity Degree in Semidefinite Programming (Q5857289) (← links)
- Validating numerical semidefinite programming solvers for polynomial invariants (Q5916266) (← links)
- Sum-of-squares hierarchies for binary polynomial optimization (Q5918420) (← links)
- Semidefinite relaxations for partitioning, assignment and ordering problems (Q5925162) (← links)
- Sum-of-squares hierarchies for binary polynomial optimization (Q5925640) (← links)
