Cover Image

On semidefinite programming characterizations of the numerical radius and its dual norm for quaternionic matrices

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Friedland, Shmuel
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control 15A60, 15A69, 15B33, 68Q25, 68W25, 90C22, 90C51
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On semidefinite programming characterizations of the numerical radius and its dual norm
by: Friedland, Shmuel, et al.
Published: (2023)

A semidefinite programming characterization of the Crawford number
by: Friedland, Shmuel, et al.
Published: (2024)

Complexity of Geometric programming in the Turing model and application to nonnegative tensors
by: Friedland, Shmuel, et al.
Published: (2023)

Tensors, entanglement, separability, and their complexity
by: Friedland, Shmuel
Published: (2025)

Solving exact and noisy rank-one tensor completion with semidefinite programming
by: Cifuentes, Diego, et al.
Published: (2025)

Bundle EXTRA for Decentralized Optimization
by: Liu, Haijuan, et al.
Published: (2026)

A non-iterative polynomial algorithm for linear programming
by: Jing-Yuan, Wei
Published: (2013)

Topological structure and a polynomial-time solution of linear programming over the real numbers
by: Wei, Jing-Yuan
Published: (2018)

Distributed Computing for Huge-Scale Aggregative Convex Programming
by: Tao, Luoyi
Published: (2026)

Knapsack and Shortest Path Problems Generalizations From A Quantum-Inspired Tensor Network Perspective
by: Subiñas, Sergio Muñiz, et al.
Published: (2025)

DualFL: A Duality-based Federated Learning Algorithm with Communication Acceleration in the General Convex Regime
by: Park, Jongho, et al.
Published: (2023)

CompressedScaffnew: The First Theoretical Double Acceleration of Communication from Local Training and Compression in Distributed Optimization
by: Condat, Laurent, et al.
Published: (2022)

A semiconcavity approach to stability of entropic plans and exponential convergence of Sinkhorn's algorithm
by: Chiarini, Alberto, et al.
Published: (2024)

Distributed Gradient-Regularized Newton Method: Scheduled Consensus and O(epsilon^{-1}) Global Iteration Complexity
by: Hu, Wei, et al.
Published: (2026)

Degree Sequence Optimization and Extremal Degree Enumerators
by: Onn, Shmuel
Published: (2024)

Circuit and Graver Walks and Linear and Integer Programming
by: Onn, Shmuel
Published: (2024)

HaTT: Hadamard avoiding TT recompression
by: Sun, Zhonghao, et al.
Published: (2024)

On the resolution of $\ell_1$-norm minimization via a two-metric adaptive projection method
by: Wu, Hanju, et al.
Published: (2025)

Barrier relaxations of the classical and quantum optimal transport problems
by: Friedland, Shmuel
Published: (2025)

SUDA-Muon: Structural Design Principles and Boundaries for Fully Decentralized Muon
by: Zhang, Hengrui, et al.
Published: (2026)

An inertial iteratively regularized extragradient method for bilevel variational inequality problems
by: Alves, M. Marques, et al.
Published: (2025)

The rate of convergence of Bregman proximal methods: Local geometry vs. regularity vs. sharpness
by: Azizian, Waïss, et al.
Published: (2022)

On the boundedness of the sequence generated by minibatch stochastic gradient descent
by: Bauschke, Heinz H., et al.
Published: (2025)

Concave Certificates: Geometric Framework for Distributionally Robust Risk and Complexity Analysis
by: Chu, Hong T. M.
Published: (2026)

Policy Optimization over General State and Action Spaces
by: Ju, Caleb, et al.
Published: (2022)

A New Decomposition Paradigm for Graph-structured Nonlinear Programs via Message Passing
by: Ding, Kuangyu, et al.
Published: (2025)

A Heuristic Alternating Direction Method of Multipliers Framework for Distributed and Centralized Tree-Constrained Optimization: Applications to Hop-Constrained Spanning Tree Multicommodity Flow Design
by: Mokhtari, Yacine
Published: (2025)

Exactness and Effective Degree Bound of Lasserre's Relaxation for Polynomial Optimization over Finite Variety
by: Hua, Zheng, et al.
Published: (2021)

Grassmannian optimization is NP-hard
by: Lai, Zehua, et al.
Published: (2024)

Performance Estimation of second-order optimization methods on classes of univariate functions
by: Rubbens, Anne, et al.
Published: (2025)

Rate-Distortion Analysis of Compressed Query Delegation with Low-Rank Riemannian Updates
by: Alpay, Faruk, et al.
Published: (2026)

Distributed Computing for Huge-Scale Linear Programming
by: Tao, Luoyi
Published: (2024)

Dimension-free estimators of gradients of functions with(out) non-independent variables
by: Lamboni, Matieyendou
Published: (2025)

A Theory of Composition and Duality of Extremal Optimal Fixed-Point Algorithms
by: Yoon, TaeHo, et al.
Published: (2026)

Uniform Value and Decidability in Ergodic Blind Stochastic Games
by: Chatterjee, Krishnendu, et al.
Published: (2024)

A distributed proximal splitting method with linesearch for locally Lipschitz gradients
by: Atenas, Felipe, et al.
Published: (2024)

On the Geometric Convergence of Byzantine-Resilient Distributed Optimization Algorithms
by: Kuwaranancharoen, Kananart, et al.
Published: (2023)

On Almost-Type Special Structured Tensor Classes Associated with Semi-Positive Tensors
by: Chauhan, Bharat Pratap, et al.
Published: (2024)

Properties of the complementarity set for the cone of copositive matrices
by: Kostyukova, O. I.
Published: (2024)

On the Convergence of Constrained Gradient Method
by: Zhou, Danqing, et al.
Published: (2025)