Characterization of the subdifferential of some matrix norms
From MaRDI portal
Publication:1190112
DOI10.1016/0024-3795(92)90407-2zbMath0751.15011OpenAlexW2029213856MaRDI QIDQ1190112
Publication date: 27 September 1992
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(92)90407-2
Related Items
Adaptive estimation of the copula correlation matrix for semiparametric elliptical copulas, Variational analysis of the Crouzeix ratio, Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction, Low-rank diffusion matrix estimation for high-dimensional time-changed Lévy processes, Properties of linear approximations of matrices in the spectral norm, Subdifferentials, faces, and dual matrices, The randomized Kaczmarz method with mismatched adjoint, Low-Rank and Sparse Multi-task Learning, A rank-corrected procedure for matrix completion with fixed basis coefficients, An Adaptive Correction Approach for Tensor Completion, Fuzzy Best Simultaneous Approximation of a Finite Numbers of Functions, On tensor completion via nuclear norm minimization, Low-Rank Inducing Norms with Optimality Interpretations, Certifying the global optimality of quartic minimization over the sphere, Low rank matrix recovery from rank one measurements, Kurdyka-Łojasiewicz exponent via inf-projection, Unnamed Item, Exact matrix completion via convex optimization, \(s\)-goodness for low-rank matrix recovery, A unified approach to error bounds for structured convex optimization problems, High-dimensional dynamic systems identification with additional constraints, Pairwise sparse + low-rank models for variables of mixed type, Matrix completion by singular value thresholding: sharp bounds, Analysis of the Parallel Schwarz Method for Growing Chains of Fixed-Sized Subdomains: Part I, On some aspects of perturbation analysis for matrix cone optimization induced by spectral norm, High-dimensional covariance matrix estimation with missing observations, Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions, Subspace segmentation by dense block and sparse representation, Subdifferential set of the joint numerical radius of a tuple of matrices, Discussion: Latent variable graphical model selection via convex optimization, Rejoinder: Latent variable graphical model selection via convex optimization, On real structured controllability/stabilizability/stability radius: complexity and unified rank-relaxation based methods, Orthogonality of matrices in the Ky Fan k-norms, High-dimensional estimation of quadratic variation based on penalized realized variance, On vector and matrix median computation, A DCA-Newton method for quartic minimization over the sphere, A Corrected Tensor Nuclear Norm Minimization Method for Noisy Low-Rank Tensor Completion, Uniqueness in nuclear norm minimization: flatness of the nuclear norm sphere and simultaneous polarization, Two proposals for robust PCA using semidefinite programming, Graph rigidity for unitarily invariant matrix norms, Orthogonality to matrix subspaces, and a distance formula, A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery, Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion, Multiview Clustering of Images with Tensor Rank Minimization via Nonconvex Approach, Several Classes of Stationary Points for Rank Regularized Minimization Problems, Global convergence of ADMM in nonconvex nonsmooth optimization, Gateaux derivative of \(C^\ast\) norm, Exact matrix completion based on low rank Hankel structure in the Fourier domain, A partial proximal point algorithm for nuclear norm regularized matrix least squares problems, Birkhoff-James orthogonality and applications: a survey, Approximate tensor decompositions: Disappearance of many separations, Sensitivity and Backward Perturbation Analysis of Multiparameter Eigenvalue Problems, A semidefinite bound for mixing rates of Markov chains, Regularization and the small-ball method. I: Sparse recovery, Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization, Unnamed Item, Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity, Homogeneous penalizers and constraints in convex image restoration, A reweighted nuclear norm minimization algorithm for low rank matrix recovery, On the extremal structure of least upper bound norms and their dual, On the subdifferential of symmetric convex functions of the spectrum for symmetric and orthogonally decomposable tensors, Characterization of Birkhoff-James orthogonality, Sparse trace norm regularization, Nuclear norm minimization for the planted clique and biclique problems, Linear feature transform and enhancement of classification on deep neural network, Low-rank matrix completion in a general non-orthogonal basis, A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems, Convex Recovery of a Structured Signal from Independent Random Linear Measurements, An iterative algorithm for third-order tensor multi-rank minimization, Latent variable graphical model selection via convex optimization, Matrix optimization based Euclidean embedding with outliers, Regularization parameter selection for the low rank matrix recovery, Estimating Hadamard operator norms, with application to triangular truncation, Generic properties and a criterion of an operator norm, Low-rank elastic-net regularized multivariate Huber regression model, Linear Convergence of Descent Methods for the Unconstrained Minimization of Restricted Strongly Convex Functions, A new method based on the manifold-alternative approximating for low-rank matrix completion, Sensitivity Analysis of Nonlinear Eigenproblems, On approximation problems with zero-trace matrices, Convex analysis on Cartan subspaces., Multimodal correlations-based data clustering, Discussion: Latent variable graphical model selection via convex optimization, Discussion: Latent variable graphical model selection via convex optimization, Discussion: Latent variable graphical model selection via convex optimization, Discussion: Latent variable graphical model selection via convex optimization, Discussion: Latent variable graphical model selection via convex optimization, Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization, Unnamed Item, Robust Tensor Completion: Equivalent Surrogates, Error Bounds, and Algorithms, Proof methods for robust low-rank matrix recovery, On matrix approximation problems with Ky Fan \(k\) norms, Exposed faces and duality for symmetric and unitarily invariant norms, Stop Memorizing: A Data-Dependent Regularization Framework for Intrinsic Pattern Learning, Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm
Cites Work
