New Analysis on Sparse Solutions to Random Standard Quadratic Optimization Problems and Extensions

DOI10.1287/moor.2014.0692zbMath1332.90187OpenAlexW2103765204MaRDI QIDQ3449456

Xin Chen, Jiming Peng

Publication date: 4 November 2015

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.2014.0692

zbMATH Keywords

random matricessparse solutionsstandard quadratic optimizationprobability analysiscopositive definite matrix

Mathematics Subject Classification ID

Quadratic programming (90C20) Random matrices (algebraic aspects) (15B52)

Related Items (5)

On random quadratic forms: supports of potential local maxima ⋮ On sparsity of the solution to a random quadratic optimization problem ⋮ Building a completely positive factorization ⋮ The Complexity of Simple Models—A Study of Worst and Typical Hard Cases for the Standard Quadratic Optimization Problem ⋮ Two-stage stochastic standard quadratic optimization

Cites Work

• Sparse solutions to random standard quadratic optimization problems
• New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
• A clique algorithm for standard quadratic programming
• Algorithms for determining the copositivity of a given symmetric matrix
• On standard quadratic optimization problems
• Robust principal component analysis?
• Extensions of Lipschitz mappings into a Hilbert space
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Continuous Characterizations of the Maximum Clique Problem
• Compressed sensing
• Random knapsack in expected polynomial time
• Unnamed Item
• Unnamed Item

This page was built for publication: New Analysis on Sparse Solutions to Random Standard Quadratic Optimization Problems and Extensions