Spectral operators of matrices
From MaRDI portal
Abstract: The class of matrix optimization problems (MOPs) has been recognized in recent years to be a powerful tool by researchers far beyond the optimization community to model many important applications involving structured low rank matrices. This trend can be credited to some extent to the exciting developments in the emerging field of compressed sensing. The L"owner operator, which generates a matrix valued function by applying a single-variable function to each of the singular values of a matrix, has played an important role for a long time in solving matrix optimization problems. However, the classical theory developed for L"owner operators has become inadequate in these recent applications. The main objective of this paper is to provide some necessary theoretical foundations for designing numerical methods for solving the MOP. This goal is achieved by introducing and conducting a thorough study on a new class of matrix valued functions, coined as spectral operators of matrices. Several fundamental properties of spectral operators, including the well-definedness, continuity, directional differentiability, Fr'{e}chet-differentiability, locally Lipschitzian continuity, -order B(ouligand)-differentiability (), -order G-semismooth () and the characterization of Clarke's generalized Jacobian, are systematically studied.
Recommendations
- Spectral operators of matrices: semismoothness and characterizations of the generalized Jacobian
- Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers
- Variational analysis of spectral functions simplified
- Convex Analysis of Spectrally Defined Matrix Functions
- Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
Cites work
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A nonsmooth version of Newton's method
- A rank-corrected procedure for matrix completion with fixed basis coefficients
- A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems
- An implementable proximal point algorithmic framework for nuclear norm minimization
- An introduction to a class of matrix cone programming
- Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems
- Analysis of Symmetric Matrix Valued Functions
- Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
- Convex Analysis
- Derivatives of Spectral Functions
- Exact matrix completion via convex optimization
- First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints
- Full stability in finite-dimensional optimization
- GMRES vs. Ideal GMRES
- GMRES/CR and Arnoldi/Lanczos as Matrix Approximation Problems
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- scientific article; zbMATH DE number 3689809 (Why is no real title available?)
- scientific article; zbMATH DE number 823379 (Why is no real title available?)
- scientific article; zbMATH DE number 3374409 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 967335 (Why is no real title available?)
- scientific article; zbMATH DE number 967931 (Why is no real title available?)
- Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
- Nonsmooth analysis of singular values. I: Theory
- Nonsmooth analysis of singular values. II: Applications
- On quasidifferentiable mappings
- On the Moreau-Yosida regularization of the vector k-norm related functions
- On the rank of a matrix associated with a graph.
- On the Shannon capacity of a graph
- Proximité et dualité dans un espace hilbertien
- Rank-Sparsity Incoherence for Matrix Decomposition
- Robust principal component analysis?
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- Semidefinite optimization
- Semismooth and Semiconvex Functions in Constrained Optimization
- Semismooth Matrix-Valued Functions
- Semismoothness of Spectral Functions
- Structured low rank approximation
- The Chebyshev Polynomials of a Matrix
- The Colin de Verdière number and sphere representations of a graph
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- Twice differentiable spectral functions
Cited in
(26)- Global convergence of ADMM in nonconvex nonsmooth optimization
- Spectrally stable matrices
- Matrix optimization based Euclidean embedding with outliers
- \(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex
- A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems
- B-subdifferential of the projection onto the generalized spectraplex
- Certifying the global optimality of quartic minimization over the sphere
- Augmented Lagrangian methods for convex matrix optimization problems
- On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming
- Matrix finite-zone operators
- Regular and limiting normal cones to the graph of the subdifferential mapping of the nuclear norm
- Preemptive online algorithms for scheduling
- Low-rank matrix iteration using polynomial-filtered subspace extraction
- scientific article; zbMATH DE number 5005214 (Why is no real title available?)
- Antilinear operators and special matrices
- scientific article; zbMATH DE number 3967169 (Why is no real title available?)
- scientific article; zbMATH DE number 2050871 (Why is no real title available?)
- Spectral Decomposition of Symmetric Operator Matrices
- Spectral operators of matrices: semismoothness and characterizations of the generalized Jacobian
- Spectral problems for operator matrices
- B-subdifferentials of the projection onto the generalized simplex
- A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem
- An efficient algorithm for Fantope-constrained sparse principal subspace estimation problem
- Variational analysis of orthogonally invariant norm cones of symmetric matrices
- The robust isolated calmness of spectral norm regularized convex matrix optimization problems
- Title not available (Why is no real title available?)
This page was built for publication: Spectral operators of matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2413097)
