Subsampling Algorithms for Semidefinite Programming (Q5168846): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fast computation of low-rank matrix approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: LAPACK Users' Guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Subdifferentials by Random Sampling of Gradients / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact matrix completion via convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-Order Methods for Sparse Covariance Selection / 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: Orthogonal Eigenvectors and Relative Gaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: The design and implementation of the MRRR algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Patterns in eigenvalues: the 70th Josiah Willard Gibbs lecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tracy-Widom limit for the largest eigenvalue of a large class of complex sample covariance matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast monte-carlo algorithms for finding low-rank approximations / 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: Q4040931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distribution of the largest eigenvalue in principal components analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Stochastic Approximation Approach to Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral Algorithms / 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: ARPACK Users' Guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3967358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual subgradient methods for convex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Estimating the Largest Eigenvalue with the Lanczos Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acceleration of Stochastic Approximation by Averaging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling from large matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2756976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The convergence behavior of Ritz values in the presence of close eigenvalues / rank
 
Normal rank

Latest revision as of 19:21, 8 July 2024

scientific article; zbMATH DE number 6318796
Language Label Description Also known as
English
Subsampling Algorithms for Semidefinite Programming
scientific article; zbMATH DE number 6318796

    Statements

    0 references
    21 July 2014
    0 references
    0 references
    semidefinite programming
    0 references
    stochastic optimization
    0 references
    subsampling
    0 references
    0 references
    0 references
    math.OC
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references