Moment inequalities for sums of random matrices and their applications in optimization
type: Item
instance of: scholarly article
title: Moment inequalities for sums of random matrices and their applications in optimization
zbMATH Open document ID: 1231.60007
author: Anthony Man-Cho So
published in: Mathematical Programming. Series A. Series B
publication date: 2011-11-23T00:00:00Z
Mathematics Subject Classification ID: 60B20
Mathematics Subject Classification ID: 60F10
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 5977602
zbMATH Keywords: non-commutative Khintchine's inequality
zbMATH Keywords: semidefinite programming
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: s10107-009-0330-5
OpenAlex ID: W2131939929
cites work: Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
cites work: Quadratic forms on graphs
cites work: Strong duality for a trust-region type relaxation of the quadratic assignment problem
cites work: On Lagrangian relaxation of quadratic matrix constraints
cites work: Euclidean distortion and the sparsest cut
cites work: Expander flows, geometric embeddings and graph partitioning
cites work: Problems of distance geometry and convex properties of quadratic maps
cites work: Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
cites work: On Safe Tractable Approximations of Chance-Constrained Linear Matrix Inequalities
cites work: Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
cites work: Semidefinite programming in combinatorial optimization
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Geometric algorithms and combinatorial optimization.
cites work: Matrix Analysis
cites work: Approximate graph coloring by semidefinite programming
cites work: Assignment Problems and the Location of Economic Activities
cites work: Slow Adaptive OFDMA Systems Through Chance Constrained Programming
cites work: Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
cites work: Q3721269
cites work: Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
cites work: On maximization of quadratic form over intersection of ellipsoids with common center
cites work: Convex Approximations of Chance Constrained Programs
cites work: Q5201292
cites work: Q4303939
cites work: On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
cites work: The Khintchine inequalities and martingale expanding sphere of their action
cites work: Q4215796
cites work: Q3244478
cites work: Rank-reducibility of a symmetric matrix and sampling theory of minimum trace factor analysis
cites work: Q5417660
cites work: A Unified Theorem on SDP Rank Reduction
cites work: On approximating complex quadratic optimization problems via semidefinite programming relaxations
cites work: Q4768187
cites work: The random paving property for uniformly bounded matrices
cites work: Approximating global quadratic optimization with convex quadratic constraints
cites work: New Results on Quadratic Minimization
cites work: Semidefinite programming relaxations for the quadratic assignment problem
DOI: 10.1007/S10107-009-0330-5
description: scientific article; zbMATH DE number 5977602