Pages that link to "Item:Q312678"

The following pages link to A rank-corrected procedure for matrix completion with fixed basis coefficients (Q312678):

Displaying 28 items.

• Two-stage convex relaxation approach to low-rank and sparsity regularized least squares loss (Q683720) (← links)
• An efficient algorithm for batch images alignment with adaptive rank-correction term (Q1624632) (← links)
• Equivalent Lipschitz surrogates for zero-norm and rank optimization problems (Q1756795) (← links)
• An efficient algorithm for sparse inverse covariance matrix estimation based on dual formulation (Q1796959) (← links)
• Symmetric Gauss-Seidel technique-based alternating direction methods of multipliers for transform invariant low-rank textures problem (Q1799658) (← links)
• Robust low-rank matrix estimation (Q1990590) (← links)
• Matrix optimization based Euclidean embedding with outliers (Q2044470) (← links)
• Robust tensor recovery with nonconvex and nonsmooth regularization (Q2096313) (← links)
• A unified Douglas-Rachford algorithm for generalized DC programming (Q2114583) (← links)
• Augmented Lagrangian methods for convex matrix optimization problems (Q2158112) (← links)
• Two relaxation methods for rank minimization problems (Q2198528) (← links)
• Nonconvex optimization for robust tensor completion from grossly sparse observations (Q2219800) (← links)
• On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming (Q2220656) (← links)
• A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery (Q2220914) (← links)
• Variational analysis of the Ky Fan \(k\)-norm (Q2359140) (← links)
• Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction (Q2364497) (← links)
• Spectral operators of matrices (Q2413097) (← links)
• Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization (Q2425177) (← links)
• An Adaptive Correction Approach for Tensor Completion (Q3179604) (← links)
• Several Classes of Stationary Points for Rank Regularized Minimization Problems (Q3300765) (← links)
• Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian (Q5217598) (← links)
• The Analytic Solutions of a Class of Constrained Matrix Minimization and Maximization Problems with Applications (Q5231680) (← links)
• Multistage Convex Relaxation Approach to Rank Regularized Minimization Problems Based on Equivalent Mathematical Program with a Generalized Complementarity Constraint (Q5348478) (← links)
• Robust Tensor Completion: Equivalent Surrogates, Error Bounds, and Algorithms (Q5863527) (← links)
• A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions (Q5962721) (← links)
• Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines (Q6051312) (← links)
• A Corrected Tensor Nuclear Norm Minimization Method for Noisy Low-Rank Tensor Completion (Q6176008) (← links)
• Hybrid Algorithms for Finding a D-Stationary Point of a Class of Structured Nonsmooth DC Minimization (Q6188511) (← links)