Sublinear time algorithms for approximate semidefinite programming (Q304246): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C22 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C06 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W20 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6619167 / rank
 
Normal rank
Property / zbMATH Keywords
 
semidefinite programming
Property / zbMATH Keywords: semidefinite programming / rank
 
Normal rank
Property / zbMATH Keywords
 
sublinear algorithms
Property / zbMATH Keywords: sublinear algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
online algorithms
Property / zbMATH Keywords: online algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
large scale optimization
Property / zbMATH Keywords: large scale optimization / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-015-0932-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W806902362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Randomized Mirror-Prox Method for Solving Structured Large-Scale Matrix Saddle-Point Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prediction, Learning, and Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear optimization for machine learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subsampling Algorithms for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Direct Formulation for Sparse PCA Using Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sublinear-time randomized approximation algorithm for matrix games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Approximate Solutions to Semidefinite Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving variational inequalities with Stochastic Mirror-Prox algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prox-Method with Rate of Convergence <i>O</i>(1/<i>t</i>) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing technique and its applications in semidefinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simpler Approach to Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Learning and Online Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: User-friendly tail bounds for sums of random matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2913806 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:58, 12 July 2024

scientific article
Language Label Description Also known as
English
Sublinear time algorithms for approximate semidefinite programming
scientific article

    Statements

    Sublinear time algorithms for approximate semidefinite programming (English)
    0 references
    0 references
    0 references
    25 August 2016
    0 references
    semidefinite programming
    0 references
    sublinear algorithms
    0 references
    online algorithms
    0 references
    large scale optimization
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references