Cover Image

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

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Friedland, Shmuel, Li, Chi-Kwong
Format:	Preprint
Published:	2023
Subjects:	Numerical Analysis Optimization and Control 15A60, 15A69, 68Q25, 68W25, 81P40, 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 for quaternionic matrices
by: Friedland, Shmuel
Published: (2023)

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

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

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

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

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

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

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

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

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

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

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

Improved approximation ratios for the Quantum Max-Cut problem on general, triangle-free and bipartite graphs
by: Gribling, Sander, et al.
Published: (2025)

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)

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

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

On the Curvature of the Central Path of Linear Programming Theory
by: Dedieu, Jean-Pierre, et al.
Published: (2003)

Grassmannian optimization is NP-hard
by: Lai, Zehua, 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)

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

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

Optimal phase change for a generalized Grover's algorithm
by: Cardullo, Christopher, et al.
Published: (2025)

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

Sample-based almost-sure quasi-optimal approximation in reproducing kernel Hilbert spaces
by: Hegemann, Nando, et al.
Published: (2024)

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

A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization
by: He, Chuan, et al.
Published: (2023)

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

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

Connections between convex optimization algorithms and subspace correction methods
by: Jiang, Boou, et al.
Published: (2025)

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

A polynomial-time algorithm for deciding the Hilbert Nullstellensatz over $\mathbb{Z}_2$. A proof of $\mathbf{P}=\mathbf{NP}$ hypothesis
by: Petrov, Petar P.
Published: (2022)

Explicit Recursive Construction of Super-Replication Prices under Proportional Transaction Costs
by: Lepinette, Emmanuel, et al.
Published: (2025)

Incremental Certificate Learning for Hybrid Neural Network Verification . A Solver Architecture for Piecewise-Linear Safety Queries
by: Gokavarapu, Chandrasekhar
Published: (2025)

An Inexact Feasible Interior Point Method for Linear Optimization with High Adaptability to Quantum Computers
by: Mohammadisiahroudi, Mohammadhossein, et al.
Published: (2023)

Fast and Provable Nonconvex Robust Matrix Completion
by: Fu, Yichen, et al.
Published: (2026)

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

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

Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization
by: Nesterov, Yurii
Published: (2025)

Kurdyka-Łojasiewicz exponent via Hadamard parametrization
by: Ouyang, Wenqing, et al.
Published: (2024)