Copertina

A semidefinite programming characterization of the Crawford number

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Friedland, Shmuel, Vinzant, Cynthia
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Numerical Analysis 15A60, 15A69, 68Q25, 68W25, 90C22, 90C51
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

On semidefinite programming characterizations of the numerical radius and its dual norm for quaternionic matrices
di: Friedland, Shmuel
Pubblicazione: (2023)

Tensors, entanglement, separability, and their complexity
di: Friedland, Shmuel
Pubblicazione: (2025)

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

HaTT: Hadamard avoiding TT recompression
di: Sun, Zhonghao, et al.
Pubblicazione: (2024)

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

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

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

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

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

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

Bundle EXTRA for Decentralized Optimization
di: Liu, Haijuan, et al.
Pubblicazione: (2026)

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

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

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

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

Degree Sequence Optimization and Extremal Degree Enumerators
di: Onn, Shmuel
Pubblicazione: (2024)

Circuit and Graver Walks and Linear and Integer Programming
di: Onn, Shmuel
Pubblicazione: (2024)

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

A Lower Bound for Grothendieck's Constant
di: Heilman, Steven
Pubblicazione: (2026)

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

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

Perturbation analysis on T-eigenvalues of third-order tensors
di: Mo, Changxin, et al.
Pubblicazione: (2021)

Worst-Case Learning under a Multi-fidelity Model
di: Foucart, Simon, et al.
Pubblicazione: (2024)

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

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

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

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

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

Acceleration and restart for the randomized Bregman-Kaczmarz method
di: Tondji, Lionel, et al.
Pubblicazione: (2023)

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

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

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

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

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

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

A constraint-based approach to function interpolation, with application to performance estimation for weakly convex optimisation
di: Rubbens, Anne, et al.
Pubblicazione: (2024)

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

Interpolation Conditions for Linear Operators and Applications to Performance Estimation Problems
di: Bousselmi, Nizar, et al.
Pubblicazione: (2023)

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