Sublinear time algorithms for approximate semidefinite programming
type: Item
instance of: scholarly article
title: Sublinear time algorithms for approximate semidefinite programming
zbMATH Open document ID: 1346.90656
author: Dan Garber
author: Elad Hazan
published in: Mathematical Programming. Series A. Series B
publication date: 2016-08-25T00:00:00Z
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 6619167
zbMATH Keywords: semidefinite programming
zbMATH Keywords: sublinear algorithms
zbMATH Keywords: online algorithms
zbMATH Keywords: large scale optimization
MaRDI profile type: Publication
full work available at URL: s10107-015-0932-z
OpenAlex ID: W806902362
cites work: A randomized mirror-prox method for solving structured large-scale matrix saddle-point problems
cites work: Q4821526
cites work: Prediction, Learning, and Games
cites work: Sublinear optimization for machine learning
cites work: Subsampling Algorithms for Semidefinite Programming
cites work: A Direct Formulation for Sparse PCA Using Semidefinite Programming
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: A sublinear-time randomized approximation algorithm for matrix games
cites work: Sparse Approximate Solutions to Semidefinite Programs
cites work: Solving variational inequalities with Stochastic Mirror-Prox algorithm
cites work: Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
cites work: Q3093181
cites work: Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
cites work: Smoothing technique and its applications in semidefinite optimization
cites work: A Simpler Approach to Matrix Completion
cites work: Online Learning and Online Convex Optimization
cites work: User-friendly tail bounds for sums of random matrices
cites work: The multiplicative weights update method: a meta-algorithm and applications
DOI: 10.1007/S10107-015-0932-Z
description: scientific article; zbMATH DE number 6619167