scientific article; zbMATH DE number 823379

Publication date: 13 April 1997

Full work available at URL: https://eudml.org/doc/232099

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

singular values symmetric gauge functions unitarily invariant matrix norms absolutely symmetric functions unitarily invariant matrix functions

Mathematics Subject Classification ID

Convex programming (90C25) Nonsmooth analysis (49J52) Eigenvalues, singular values, and eigenvectors (15A18) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60)

Related Items (57)

Two-stage convex relaxation approach to least squares loss constrained low-rank plus sparsity optimization problems ⋮ Birkhoff–James Orthogonality: Characterizations, Preservers, and Orthogonality Graphs ⋮ An Unbiased Approach to Low Rank Recovery ⋮ Accelerated inexact composite gradient methods for nonconvex spectral optimization problems ⋮ Vector and Matrix Optimal Mass Transport: Theory, Algorithm, and Applications ⋮ Competitive online algorithms for resource allocation over the positive semidefinite cone ⋮ Applications of gauge duality in robust principal component analysis and semidefinite programming ⋮ Certifying the global optimality of quartic minimization over the sphere ⋮ Augmented Lagrangian methods for convex matrix optimization problems ⋮ Unnamed Item ⋮ A variational approach of the rank function ⋮ An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants ⋮ Eigenvalue-constrained faces ⋮ Fixed-point proximity algorithm for minimal norm interpolation ⋮ The degrees of freedom of partly smooth regularizers ⋮ Approximation of rank function and its application to the nearest low-rank correlation matrix ⋮ Spectral operators of matrices ⋮ Domain adaptation and sample bias correction theory and algorithm for regression ⋮ A universal rank approximation method for matrix completion ⋮ Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions ⋮ Optimistic optimisation of composite objective with exponentiated update ⋮ Universal Features for High-Dimensional Learning and Inference ⋮ Matrix completion with nonconvex regularization: spectral operators and scalable algorithms ⋮ Fast projections onto mixed-norm balls with applications ⋮ Variational Gram Functions: Convex Analysis and Optimization ⋮ Reexamining low rank matrix factorization for trace norm regularization ⋮ A Path-Based Approach to Constrained Sparse Optimization ⋮ Proximal Mapping for Symmetric Penalty and Sparsity ⋮ Uniqueness in nuclear norm minimization: flatness of the nuclear norm sphere and simultaneous polarization ⋮ Convex spectral functions and approximate intertwining relationships ⋮ Minimax risk of matrix denoising by singular value thresholding ⋮ Several Classes of Stationary Points for Rank Regularized Minimization Problems ⋮ Von Neumann's trace inequality for tensors ⋮ A general representation of $\delta$-normal sets to sublevels of convex functions ⋮ Two-stage convex relaxation approach to low-rank and sparsity regularized least squares loss ⋮ On fixed points of self maps of the free ball ⋮ Spectral convex functions of operators and approximate intertwining relationships ⋮ Equivalent Lipschitz surrogates for zero-norm and rank optimization problems ⋮ On the subdifferential of symmetric convex functions of the spectrum for symmetric and orthogonally decomposable tensors ⋮ Finding the Largest Low-Rank Clusters With Ky Fan $2$-$k$-Norm and $\ell_1$-Norm ⋮ Maps preserving unitarily invariant norms of Jordan product of matrices ⋮ Von Neumann's trace inequality for Hilbert-Schmidt operators ⋮ Convergence analysis of projected gradient descent for Schatten-$p$ nonconvex matrix recovery ⋮ Convex multi-task feature learning ⋮ On inversion-free mapping and distortion minimization ⋮ Tensor-free proximal methods for lifted bilinear/quadratic inverse problems with applications to phase retrieval ⋮ Metric subregularity and/or calmness of the normal cone mapping to the $p$-order conic constraint system ⋮ Stability Robustness of Closed-Loop Systems in Angular Metrics ⋮ Efficient proximal mapping computation for low-rank inducing norms ⋮ Unnamed Item ⋮ Nonsmooth analysis of singular values. I: Theory ⋮ A non-convex algorithm framework based on DC programming and DCA for matrix completion ⋮ Unnamed Item ⋮ Duality and well behavior of nonconvex functions ⋮ Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis ⋮ A Study of Convex Convex-Composite Functions via Infimal Convolution with Applications ⋮ B-subdifferential of the projection onto the generalized spectraplex

This page was built for publication: