No article text was recorded for this version.
non-convex rank constraints
Version 1 of 173 papers76 conceptsfrozen 2026-10-04
Papers in this version
- Blog: An Equivalence between Critical Points for Rank Constraints Versus Low-Rank Factorizations
- Blog: Low Permutation-Rank Matrices: Structural Properties and Noisy Completion
- Blog: Penalty Decomposition Methods for Rank Minimization
- Blog: Accelerated Nonconvex ADMM with Self-Adaptive Penalty for Rank-Constrained Model Identification
- Blog: Weighted Schatten p-Norm Minimization for Image Denoising and Background Subtraction
- Blog: Stochastic Optimization of PCA with Capped MSG
- Blog: Tensor Recovery Based on A Novel Non-convex Function Minimax Logarithmic Concave Penalty Function
- Blog: Recursive Importance Sketching for Rank Constrained Least Squares: Algorithms and High-Order Convergence
- Blog: On approximating the nearest Ω‐stable matrix
- Blog: Robust PCA via Nonconvex Rank Approximation
- Blog: On Approximation Guarantees for Greedy Low Rank Optimization
- Blog: A Hybrid Penalty Method for a Class of Optimization Problems with Multiple Rank Constraints
- Blog: Top-N Recommendation with Novel Rank Approximation
- Blog: Linear Adversarial Concept Erasure
- Blog: Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm
- Blog: Denoising Hyperbolic-Valued Data by Relaxed Regularizations
- Blog: Adaptive Low-Nonnegative-Rank Approximation for State Aggregation of Markov Chains
- Blog: Asymptotic theory for maximum likelihood estimates in reduced-rank multivariate generalized linear models
- Blog: Bilinear Factor Matrix Norm Minimization for Robust PCA: Algorithms and Applications
- Blog: Transport Clustering: Solving Low-Rank Optimal Transport via Clustering
- Blog: Robust Subspace Clustering via Tighter Rank Approximation
- Blog: On Sampling Complexity of the Semidefinite Affine Rank Feasibility Problem
- Blog: Long-Context Linear System Identification
- Blog: Hybrid Singular Value Thresholding for Tensor Completion
- Blog: Cholesky Decomposition-Based Metric Learning for Video-Based Human Action Recognition
- Blog: Estimation of Markov Chain via Rank-constrained Likelihood
- Blog: Large-Scale Convex Minimization with a Low-Rank Constraint
- Blog: Low Rank Pure Quaternion Approximation for Pure Quaternion Matrices
- Blog: Simultaneous heterogeneity and reduced-rank learning for multivariate response regression
- Blog: Convex Co-embedding
- Blog: Finding stationary points on bounded-rank matrices: A geometric hurdle and a smooth remedy
- Blog: Subsampling Algorithms for Semidefinite Programming
- Blog: Rank Awareness in Joint Sparse Recovery
- Blog: Non-Euclidean Contraction Theory for Monotone and Positive Systems
- Blog: Learning Stable Linear Dynamical Systems with the Weighted Least Square Method
- Blog: Learning with Average Top-k Loss
- Blog: Beyond Pham's algorithm for joint diagonalization
- Blog: A Proximal Alternating Direction Method for Semi-Definite Rank Minimization
- Blog: Variable projection for affinely structured low-rank approximation in weighted 2-norms
- Blog: Low-Rank Univariate Sum of Squares Has No Spurious Local Minima
- Blog: Computation of the maximum likelihood estimator in low-rank factor analysis
- Blog: Large-Scale Convex Minimization with a Low-Rank Constraint
- Blog: Local Search Algorithms for Rank-Constrained Convex Optimization
- Blog: Large-Scale Low-Rank Matrix Learning with Nonconvex Regularizers
- Blog: Principal Component Analysis with Tensor Train Subspace
- Blog: Generalized Nonconvex Nonsmooth Low-Rank Minimization
- Blog: Practical Matrix Completion and Corruption Recovery Using Proximal Alternating Robust Subspace Minimization.
- Blog: Fantope Regularization in Metric Learning
- Blog: Nonconvex Sparse Spectral Clustering by Alternating Direction Method of Multipliers and Its Convergence Analysis
- Blog: Robust Factor Analysis Parameter Estimation
- Blog: Improved Regret Bounds of Bilinear Bandits using Action Space Analysis
- Blog: SOFAR: Large-Scale Association Network Learning
- Blog: On the partial convexification for low-rank spectral optimization: rank bounds and algorithms
- Blog: Index Coding and Network Coding via Rank Minimization
- Blog: Best Pair Formulation & Accelerated Scheme for Non-convex Principal Component Pursuit
- Blog: Multi-channel Weighted Nuclear Norm Minimization for Real Color Image Denoising
- Blog: Efficient and Practical Stochastic Subgradient Descent for Nuclear Norm Regularization
- Blog: A Nonconvex Projection Method for Robust PCA.
- Blog: A Nonconvex Relaxation Approach for Rank Minimization Problems
- Blog: Stable Rank Normalization for Improved Generalization in Neural Networks and GANs
Showing 60 of 73 papers.
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_non_convex_rank_constraints_8db9ad78,
title = {non-convex rank constraints},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/non-convex-rank-constraints/rdr_8db9ad784a6f4a99be0148af4216253e},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_non_convex_rank_constraints_8db9ad78_v1,
title = {non-convex rank constraints},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/non-convex-rank-constraints/rdr_8db9ad784a6f4a99be0148af4216253e/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}