Convex numerical radius

DOI10.1016/J.JMAA.2009.07.037zbMath1177.47007OpenAlexW2050055981MaRDI QIDQ1034060

Manuel Ruiz Galán

Publication date: 10 November 2009

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2009.07.037

zbMATH Keywords

coercivityBishop-Phelps theoremnumerical radiussubdifferential of a convex functionconvex lsc functionJames's sup theorem

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Nonlinear accretive operators, dissipative operators, etc. (47H06) Subnormal operators, hyponormal operators, etc. (47B20) Numerical range, numerical radius (47A12)

Related Items (2)

A coercive James's weak compactness theorem and nonlinear variational problems ⋮ Compactness, Optimality, and Risk

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convex functions, monotone operators and differentiability.
• Extremal structure of convex sets. II
• In a nonreflexive space the subdifferential is not onto
• A counterexample on numerical radius attaining operators
• A one perturbation variational principle and applications
• Denseness of holomorphic functions attaining their numerical radii
• Techniques of variational analysis
• On the field of values subordinate to a norm
• Numerical Radius-Attaining Operators on C(K)
• A Version of James' Theorem for Numerical Radius
• Weakly Compact Sets
• An Extension to the Theorem of Bishop and Phelps

This page was built for publication: Convex numerical radius