Improved approximation algorithms for orthogonally constrained problems using semidefinite optimization

DOI10.1007/978-3-032-28691-8_17MaRDI QIDQ7349460zbMATH OpenFDO

Authors Ryan Cory-Wright, Jean Pauphilet

Publication date 16 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-28691-8_17

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Cites work

• A generalized Grothendieck inequality and nonlocal correlations that require high entanglement
• A remark on the rank of positive semidefinite matrices subject to affine constraints
• A semidefinite relaxation for sums of heterogeneous quadratic forms on the Stiefel manifold
• A strengthened SDP relaxation for quadratic optimization over the Stiefel manifold
• Approximating the little Grothendieck problem over the orthogonal and unitary groups
• Certifiably optimal low rank factor analysis
• Efficient Rounding for the Noncommutative Grothendieck Inequality
• Estimation of (near) low-rank matrices with noise and high-dimensional scaling
• Extrema of sums of heterogeneous quadratic forms
• Faster exact solution of sparse maxcut and QUBO problems
• scientific article; zbMATH DE number 4070633 (Why is no real title available?)
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Improved approximation bound for quadratic optimization problems with orthogonality constraints
• Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints
• On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
• On tractable approximations of uncertain linear matrix inequalities affected by interval uncertainty
• Semidefinite relaxation and nonconvex quadratic optimization
• Stiefel optimization is NP-hard
• Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
• The design of approximation algorithms
• The positive semidefinite Grothendieck problem with rank constraint
• Tight hardness of the non-commutative Grothendieck problem

This page was built for publication: Improved approximation algorithms for orthogonally constrained problems using semidefinite optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7349460)