A strengthened SDP relaxation for quadratic optimization over the Stiefel manifold
From MaRDI portal
Publication:6596339
Recommendations
Cites work
- scientific article; zbMATH DE number 1534299 (Why is no real title available?)
- scientific article; zbMATH DE number 5223994 (Why is no real title available?)
- A Procrustes problem on the Stiefel manifold
- A brief introduction to manifold optimization
- A feasible method for optimization with orthogonality constraints
- A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem
- Algorithms for the regularization of ill-conditioned least squares problems
- Approximation algorithms for quadratic programming
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- Global optimization with polynomials and the problem of moments
- Gradient type optimization methods for electronic structure calculations
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
- Kronecker product constraints with an application to the two-trust-region subproblem
- Majorization-Minimization on the Stiefel Manifold With Application to Robust Sparse PCA
- Manopt, a Matlab toolbox for optimization on manifolds
- ORBITOPES
- On Lagrangian relaxation of quadratic matrix constraints
- On minimizing a quadratic function on Stiefel manifold
- On the Sum of the Largest Eigenvalues of a Symmetric Matrix
- Partial Lagrangian relaxation for the unbalanced orthogonal Procrustes problem
- Procrustes Problems
- Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming
- Second order optimality on orthogonal Stiefel manifolds
- Semidefinite Descriptions of the Convex Hull of Rotation Matrices
- Semidefinite programming relaxations for the graph partitioning problem
- Semidefinite programming relaxations for the quadratic assignment problem
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- Strong duality for a trust-region type relaxation of the quadratic assignment problem
- Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
- The Geometry of Algorithms with Orthogonality Constraints
This page was built for publication: A strengthened SDP relaxation for quadratic optimization over the Stiefel manifold
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6596339)
