A strengthened SDP relaxation for quadratic optimization over the Stiefel manifold

DOI10.1007/S10957-023-02168-6MaRDI QIDQ6596339FDOQ6596339

Authors: Samuel Burer, Kyungchan Park 

Publication date: 2 September 2024

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Recommendations

• Semidefinite relaxation and nonconvex quadratic optimization
• Second order cone programming relaxation of nonconvex quadratic optimization problems
• Tightening a copositive relaxation for standard quadratic optimization problems
• On minimizing a quadratic function on Stiefel manifold

zbMATH Keywords

Stiefel manifoldsemidefinite programmingquadratically constrained quadratic programming

Mathematics Subject Classification ID

Quadratic programming (90C20) Semidefinite programming (90C22)

Cites Work

• A feasible method for optimization with orthogonality constraints
• Manopt, a Matlab toolbox for optimization on manifolds
• The Geometry of Algorithms with Orthogonality Constraints
• Title not available (Why is that?)
• Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
• Procrustes Problems
• Global optimization with polynomials and the problem of moments
• Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
• Semidefinite programming relaxations for the quadratic assignment problem
• On the Sum of the Largest Eigenvalues of a Symmetric Matrix
• Semidefinite programming relaxations for the graph partitioning problem
• Algorithms for the regularization of ill-conditioned least squares problems
• A Procrustes problem on the Stiefel manifold
• Strong duality for a trust-region type relaxation of the quadratic assignment problem
• On Lagrangian relaxation of quadratic matrix constraints
• ORBITOPES
• Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming
• Title not available (Why is that?)
• Approximation algorithms for quadratic programming
• Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
• Gradient type optimization methods for electronic structure calculations
• Semidefinite Descriptions of the Convex Hull of Rotation Matrices
• Kronecker product constraints with an application to the two-trust-region subproblem
• A brief introduction to manifold optimization
• A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem
• On minimizing a quadratic function on Stiefel manifold
• Second order optimality on orthogonal Stiefel manifolds
• Partial Lagrangian relaxation for the unbalanced orthogonal Procrustes problem
• Majorization-Minimization on the Stiefel Manifold With Application to Robust Sparse PCA

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)