Improved approximation bound for quadratic optimization problems with orthogonality constraints
From MaRDI portal
Publication:4633935
zbMATH Open1423.90169MaRDI QIDQ4633935FDOQ4633935
Authors: Anthony Man-Cho So 
Publication date: 6 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=1496900
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
Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25)
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
- Structured Quasi-Newton Methods for Optimization with Orthogonality Constraints
- Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension
- Proof of Tomaszewski's conjecture on randomly signed sums
- Title not available (Why is that?)
- 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)
