The robust isolated calmness of spectral norm regularized convex matrix optimization problems
From MaRDI portal
Cites work
- A complete characterization of the robust isolated calmness of nuclear norm regularized convex optimization problems
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Characterization of the robust isolated calmness for a class of conic programming problems
- Characterization of the subdifferential of some matrix norms
- Characterizations of local upper Lipschitz property of perturbed solutions to nonlinear second-order cone programs
- Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
- Convex Analysis
- First-order methods in optimization
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 3061616 (Why is no real title available?)
- Improved spectral norm regularization for neural networks
- Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
- Nonsmooth H∞Synthesis
- On matrix approximation problems with Ky Fan \(k\) norms
- On the second-order directional derivatives of singular values of matrices and symmetric matrix-valued functions
- On the upper Lipschitz property of the KKT mapping for nonlinear semidefinite optimization
- Second-order nonsmooth optimization for \(H_{\infty}\) synthesis
- Sparse optimal control of cyber-physical systems via PQA approach
- Spectral operators of matrices
- The Chebyshev Polynomials of a Matrix
- Variational Analysis
- Variational analysis of the Ky Fan k-norm
This page was built for publication: The robust isolated calmness of spectral norm regularized convex matrix optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6903583)
