Improved approximation bound for quadratic optimization problems with orthogonality constraints
From MaRDI portal
Publication:4633935
Recommendations
- Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
- A note on approximating quadratic programming with rank constraint
- Moment inequalities for sums of random matrices and their applications in optimization
- Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
- Approximating the little Grothendieck problem over the orthogonal and unitary groups
Cited in
(10)- Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods
- Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- A note on random signs
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension
- Structured Quasi-Newton Methods for Optimization with Orthogonality Constraints
- Proof of Tomaszewski's conjecture on randomly signed sums
- scientific article; zbMATH DE number 6474937 (Why is no real title available?)
- Moment inequalities for sums of random matrices and their applications in optimization
This page was built for publication: Improved approximation bound for quadratic optimization problems with orthogonality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633935)
