Publication:4856866

From MaRDI portal
Revision as of 04:48, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


zbMath0860.15026MaRDI QIDQ4856866

Adrian S. Lewis

Publication date: 13 April 1997

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


90C25: Convex programming

49J52: Nonsmooth analysis

15A18: Eigenvalues, singular values, and eigenvectors

15A60: Norms of matrices, numerical range, applications of functional analysis to matrix theory


Related Items

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