Optimizing over the Growing Spectrahedron
Authors:
- 1 January 2012
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 503-514
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Coresets, sparse greedy approximation, and the Frank-Wolfe algorithmACM Transactions on Algorithms, 2010
- The Power of Convex Relaxation: Near-Optimal Matrix CompletionIEEE Transactions on Information Theory, 2010
- Approximating Parameterized Convex Optimization ProblemsLecture Notes in Computer Science, 2010
- Matrix Factorization Techniques for Recommender SystemsComputer, 2009
- Sparse Approximate Solutions to Semidefinite Programs2008
- Smoothing Technique and its Applications in Semidefinite OptimizationMathematical Programming, 2006
- Fast algorithms for approximate semidefinite programming using the multiplicative weights update method2005
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point ProblemsSIAM Journal on Optimization, 2004
- A rank minimization heuristic with application to minimum order system approximation2001
- Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random StartSIAM Journal on Matrix Analysis and Applications, 1992