A strengthened SDP relaxation for quadratic optimization over the Stiefel manifold
From MaRDI portal
Publication:6596339
DOI10.1007/s10957-023-02168-6MaRDI QIDQ6596339
Publication date: 2 September 2024
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- A feasible method for optimization with orthogonality constraints
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
- Approximation algorithms for quadratic programming
- Semidefinite programming relaxations for the quadratic assignment problem
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- A Procrustes problem on the Stiefel manifold
- Semidefinite programming relaxations for the graph partitioning problem
- Strong duality for a trust-region type relaxation of the quadratic assignment problem
- A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem
- Second order optimality on orthogonal Stiefel manifolds
- A brief introduction to manifold optimization
- Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming
- On minimizing a quadratic function on Stiefel manifold
- Partial Lagrangian relaxation for the unbalanced orthogonal Procrustes problem
- On Lagrangian Relaxation of Quadratic Matrix Constraints
- Global Optimization with Polynomials and the Problem of Moments
- Gradient Type Optimization Methods For Electronic Structure Calculations
- Manopt, a Matlab toolbox for optimization on manifolds
- Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem
- ORBITOPES
- On the Sum of the Largest Eigenvalues of a Symmetric Matrix
- Algorithms for the regularization of ill-conditioned least squares problems
- The Geometry of Algorithms with Orthogonality Constraints
- Procrustes Problems
- Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
- Majorization-Minimization on the Stiefel Manifold With Application to Robust Sparse PCA
- Semidefinite Descriptions of the Convex Hull of Rotation Matrices
- Handbook of semidefinite programming. Theory, algorithms, and applications
This page was built for publication: A strengthened SDP relaxation for quadratic optimization over the Stiefel manifold