Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian (Q5217598)

scientific article; zbMATH DE number 7173424

Language	Label	Description	Also known as
English	Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian	scientific article; zbMATH DE number 7173424

Statements

instance of

scholarly article

0 references

title

Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian (English)

0 references

0 references

0 references

0 references

0 references

SIAM Journal on Optimization

0 references

publication date

25 February 2020

0 references

full work available at URL

https://arxiv.org/abs/1810.09856

0 references

zbMATH Keywords

spectral operators

0 references

matrix-valued functions

0 references

semismoothness

0 references

generalized Jacobian

0 references

describes a project that uses

SDPNAL+

0 references

QSDPNAL

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods

0 references

Q5690490

0 references

Q4210476

0 references

Tame functions are semismooth

0 references

Qualification Conditions in Semialgebraic Programming

0 references

Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs

0 references

Smooth Interpolation, Holder Continuity, and the Takagi-van der Waerden Function

0 references

Exact matrix completion via convex optimization

0 references

The Power of Convex Relaxation: Near-Optimal Matrix Completion

0 references

Robust principal component analysis?

0 references

Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming

0 references

Rank-Sparsity Incoherence for Matrix Decomposition

0 references

A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems

0 references

Structured low rank approximation

0 references

A Superlinearly Convergent Smoothing Newton Continuation Algorithm for Variational Inequalities over Definable Sets

0 references

Optimization and nonsmooth analysis

0 references

Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions

0 references

Q3530148

0 references

Spectral (isotropic) manifolds and their dimension

0 references

Orthogonal Invariance and Identifiability

0 references

Spectral operators of matrices

0 references

An introduction to a class of matrix cone programming

0 references

First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints

0 references

On the rank of a matrix associated with a graph.

0 references

The Euclidean distance degree of orthogonally invariant matrix varieties

0 references

Quadratic growth and critical point stability of semi-algebraic functions

0 references

Curves of Descent

0 references

Variational analysis of spectral functions simplified

0 references

Finite-Dimensional Variational Inequalities and Complementarity Problems

0 references

Hankel Matrix Rank Minimization with Applications to System Identification and Realization

0 references

Convex spectral functions

0 references

Q4917542

0 references

GMRES/CR and Arnoldi/Lanczos as Matrix Approximation Problems

0 references

On generalized matrix functions

0 references

Functions of Matrices

0 references

Q4303969

0 references

An Invitation to Tame Optimization

0 references

The Josephy-Newton method for semismooth generalized equations and semismooth SQP for optimization

0 references

The Colin de Verdière number and sphere representations of a graph

0 references

On eigenvalues of matrices dependent on a parameter

0 references

Derivatives of Spectral Functions

0 references

Convex Analysis on the Hermitian Matrices

0 references

Q5690370

0 references

Twice Differentiable Spectral Functions

0 references

Nonsmooth analysis of singular values. I: Theory

0 references

Nonsmooth analysis of singular values. II: Applications

0 references

New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors

0 references

A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems

0 references

On Efficiently Solving the Subproblems of a Level-Set Method for Fused Lasso Problems

0 references

QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming

0 references

An exact penalty method for semidefinite-box-constrained low-rank matrix optimization problems

0 references

An implementable proximal point algorithmic framework for nuclear norm minimization

0 references

Über monotone Matrixfunktionen

0 references

On the Shannon capacity of a graph

0 references

Penalty decomposition methods for rank minimization

0 references

\(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization

0 references

A rank-corrected procedure for matrix completion with fixed basis coefficients

0 references

Semismooth and Semiconvex Functions in Constrained Optimization

0 references

Full Stability in Finite-Dimensional Optimization

0 references

Second-Order Subdifferential Calculus with Applications to Tilt Stability in Optimization

0 references

A Formula for the Fréchet Derivative of a Generalized Matrix Function

0 references

Newton's Method for B-Differentiable Equations

0 references

A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems

0 references

Nonsmooth Equations: Motivation and Algorithms

0 references

Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems

0 references

Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations

0 references

A nonsmooth version of Newton's method

0 references

A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities

0 references

Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization

0 references

Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity

0 references

Convex Analysis

0 references

On concepts of directional differentiability

0 references

Q3237291

0 references

The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications

0 references

Semismooth Matrix-Valued Functions

0 references

Strong Semismoothness of Eigenvalues of Symmetric Matrices and Its Application to Inverse Eigenvalue Problems

0 references

Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras

0 references

Semidefinite optimization

0 references

GMRES vs. Ideal GMRES

0 references

The Chebyshev Polynomials of a Matrix

0 references

Second-order directional derivatives of all eigenvalues of a symmetric matrix

0 references

A Multigrid Semismooth Newton Method for Semilinear Contact Problems

0 references

On totally differentiable and smooth functions

0 references

Q3654637

0 references

SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints

0 references

A Newton-CG Augmented Lagrangian Method for Semidefinite Programming

0 references

A unified approach to error bounds for structured convex optimization problems

0 references

Identifiers

zbMATH Open document ID

1434.49007

0 references

DOI

10.1137/18M1222235

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5217598