Moment inequalities for sums of random matrices and their applications in optimization
From MaRDI portal
Publication:647387
DOI10.1007/S10107-009-0330-5zbMATH Open1231.60007OpenAlexW2131939929MaRDI QIDQ647387FDOQ647387
Authors: Anthony Man-Cho So 
Publication date: 23 November 2011
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-009-0330-5
Recommendations
- Improved approximation bound for quadratic optimization problems with orthogonality constraints
- Linear matrix inequalities with stochastically dependent perturbations and applications to chance-constrained semidefinite optimization
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
- A Semidefinite Programming Approach to Optimal-Moment Bounds for Convex Classes of Distributions
- Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
Quadratic programming (90C20) Large deviations (60F10) Random matrices (probabilistic aspects) (60B20) Randomized algorithms (68W20) Analysis of algorithms (68W40) Stochastic programming (90C15) Approximation algorithms (68W25)
Cites Work
- Matrix Analysis
- Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
- Rank-reducibility of a symmetric matrix and sampling theory of minimum trace factor analysis
- Approximate graph coloring by semidefinite programming
- The random paving property for uniformly bounded matrices
- Geometric algorithms and combinatorial optimization.
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- Assignment Problems and the Location of Economic Activities
- New Results on Quadratic Minimization
- Convex Approximations of Chance Constrained Programs
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- Quadratic forms on graphs
- Title not available (Why is that?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Problems of distance geometry and convex properties of quadratic maps
- On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
- Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
- Slow Adaptive OFDMA Systems Through Chance Constrained Programming
- Semidefinite programming relaxations for the quadratic assignment problem
- Title not available (Why is that?)
- Expander flows, geometric embeddings and graph partitioning
- Scenario approximations of chance constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- Euclidean distortion and the sparsest cut
- On maximization of quadratic form over intersection of ellipsoids with common center
- On approximating complex quadratic optimization problems via semidefinite programming relaxations
- A Unified Theorem on SDP Rank Reduction
- On safe tractable approximations of chance-constrained linear matrix inequalities
- Semidefinite programming in combinatorial optimization
- Strong duality for a trust-region type relaxation of the quadratic assignment problem
- On Lagrangian relaxation of quadratic matrix constraints
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
- Title not available (Why is that?)
- Probabilistic analysis of the semidefinite relaxation detector in digital communications
- The Khintchine inequalities and martingale expanding sphere of their action
- Approximating global quadratic optimization with convex quadratic constraints
Cited In (23)
- Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods
- Dimension-free bounds for largest singular values of matrix Gaussian series
- Discrete approximation and quantification in distributionally robust optimization
- An Approximation Scheme for Distributionally Robust Nonlinear Optimization
- Near-optimality of linear recovery from indirect observations
- Convex relaxations for permutation problems
- ON RANDOM WEIGHTED SUM OF POSITIVE SEMI-DEFINITE MATRICES
- Distributionally robust optimization with matrix moment constraints: Lagrange duality and cutting plane methods
- Approximation algorithms for quantum many-body problems
- Near-optimal bounds for generalized orthogonal Procrustes problem via generalized power method
- Linear matrix inequalities with stochastically dependent perturbations and applications to chance-constrained semidefinite optimization
- Convergence analysis for distributionally robust optimization and equilibrium problems
- Gaussian Process Landmarking for Three-Dimensional Geometric Morphometrics
- Matrix concentration inequalities via the method of exchangeable pairs
- Approximating the little Grothendieck problem over the orthogonal and unitary groups
- Distributionally robust optimization. A review on theory and applications
- An approximation scheme for distributionally robust PDE-constrained optimization
- Approximating Nash equilibria and dense subgraphs via an approximate version of Carathéodory's theorem
- Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
- Probability bounds for polynomial functions in random variables
- Global registration of multiple point clouds using semidefinite programming
- Norms of structured random matrices
- Disentangling orthogonal matrices
This page was built for publication: Moment inequalities for sums of random matrices and their applications in optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q647387)
