No article text was recorded for this version.
convex relaxation overhead
Version 1 of 173 papers73 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Nearly Optimal Robust Matrix Completion
- Blog: A Stochastic Gradient Approach on Compressive Sensing Signal Reconstruction Based on Adaptive Filtering Framework
- Blog: A Non-convex One-Pass Framework for Generalized Factorization Machine and Rank-One Matrix Sensing
- Blog: Low-rank Solutions of Linear Matrix Equations via Procrustes Flow
- Blog: Non-convex approaches for low-rank tensor completion under tubal sampling
- Blog: A Nonconvex Projection Method for Robust PCA
- Blog: Matrix Completion has No Spurious Local Minimum
- Blog: A Unified Variance Reduction-Based Framework for Nonconvex Low-Rank Matrix Recovery
- Blog: A Unified Computational and Statistical Framework for Nonconvex Low-rank Matrix Estimation
- Blog: Learning Low Rank Matrices from O(n) Entries
- Blog: Riemannian Submanifold Tracking on Low-Rank Algebraic Variety
- Blog: Guaranteed Matrix Completion via Non-convex Factorization
- Blog: Nonconvex Low-Rank Matrix Recovery with Arbitrary Outliers via Median-Truncated Gradient Descent
- Blog: Relaxed Clipping: A Global Training Method for Robust Regression and Classification
- Blog: Krylov Methods for Low-Rank Regularization
- Blog: Matrix Completion from a Few Entries
- Blog: On Approximation Guarantees for Greedy Low Rank Optimization
- Blog: Rank-1 Matrix Completion with Gradient Descent and Small Random Initialization
- Blog: Collaboratively Learning Preferences from Ordinal Data
- Blog: Fast Hybrid Algorithm for Big Matrix Recovery
- Blog: Hierarchical Convex NMF for Clustering Massive Data
- Blog: Improved complexities of conditional gradient-type methods with applications to robust matrix recovery problems
- Blog: Reexamining low rank matrix factorization for trace norm regularization
- Blog: Finding Low-rank Solutions to Matrix Problems, Efficiently and Provably
- Blog: Local and Global Convergence of General Burer-Monteiro Tensor Optimizations
- Blog: Exact Subspace Segmentation and Outlier Detection by Low-Rank Representation
- Blog: Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees
- Blog: Matrix Completion via Non-Convex Relaxation and Adaptive Correlation Learning
- Blog: Rank-1 Tensor Properties with Applications to a Class of Tensor Optimization Problems
- Blog: Low-Rank and Sparse Structure Pursuit via Alternating Minimization
- Blog: Nonconvex Matrix Factorization from Rank-One Measurements
- Blog: Non-square matrix sensing without spurious local minima via the Burer-Monteiro approach
- Blog: Riemannian Pursuit for Big Matrix Recovery
- Blog: High Dimensional Robust Sparse Regression
- Blog: No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified\n Geometric Analysis
- Blog: Accelerated Factored Gradient Descent for Low-Rank Matrix Factorization
- Blog: Fast and Provable Algorithms for Sparse PCA with Improved Sample Complexity
- Blog: Unifying Nuclear Norm and Bilinear Factorization Approaches for Low-Rank Matrix Decomposition
- Blog: A Scalable, Adaptive and Sound Nonconvex Regularizer for Low-rank Matrix Learning
- Blog: ReSync: Riemannian Subgradient-based Robust Rotation Synchronization
- Blog: Efficient Recovery of Jointly Sparse Vectors
- Blog: Non-square matrix sensing without spurious local minima via the Burer-Monteiro approach
- Blog: A Polynomial-time Form of Robust Regression
- Blog: Sharp Restricted Isometry Property Bounds for Low-Rank Matrix Recovery Problems with Corrupted Measurements
- Blog: Fast Global Convergence for Low-rank Matrix Recovery via Riemannian Gradient Descent with Random Initialization
- Blog: A collaborative framework for 3D alignment and classification of heterogeneous subvolumes in cryo-electron tomography
- Blog: A Unified Convex Surrogate for the Schatten-p Norm
- Blog: Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization
- Blog: Stochastic Variance Reduced Gradient for affine rank minimization problem
- Blog: L_0-norm Minimization for Basis Selection
- Blog: Large-Scale Low-Rank Matrix Learning with Nonconvex Regularizers
- Blog: A Convergent Gradient Descent Algorithm for Rank Minimization and Semidefinite Programming from Random Linear Measurements
- Blog: Unsupervised Spectral Learning of Finite State Transducers
- Blog: Efficient Convex Relaxations for Streaming PCA
- Blog: Deep Unrolling for Nonconvex Robust Principal Component Analysis
- Blog: A Primal-Dual Analysis of Global Optimality in Nonconvex Low-Rank Matrix Recovery
- Blog: Global Optimality of Local Search for Low Rank Matrix Recovery
- Blog: Subspace Expanders and Matrix Rank Minimization
- Blog: Low-rank matrix recovery via iteratively reweighted least squares minimization
- Blog: Matrix Recipes for Hard Thresholding Methods
Showing 60 of 73 papers.
History & citation
Current · Permanent link
- This direction split from Scaling Singular Value Decomposition for High-Dimensional Neural Architectures (90% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_convex_relaxation_overhead_b0ed80bd,
title = {convex relaxation overhead},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/convex-relaxation-overhead/rdr_b0ed80bd94b3444bbe939ad554ce6e59},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-21},
}This exact version (version 1, frozen text):
@misc{lacuna_convex_relaxation_overhead_b0ed80bd_v1,
title = {convex relaxation overhead},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/convex-relaxation-overhead/rdr_b0ed80bd94b3444bbe939ad554ce6e59/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-21},
}