:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Heilman, Steven
Format:	Preprint
Published:	2026
Subjects:	Functional Analysis Data Structures and Algorithms 15A60, 15A45, 90C27, 90C22, 42C10, 68Q17
Online Access:	https://arxiv.org/abs/2603.22616
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Interlacing Polynomial Method for the Column Subset Selection Problem
by: Cai, Jian-Feng, et al.
Published: (2023)

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

The Complexity Landscape of Two-Stage Robust Selection Problems with Budgeted Uncertainty
by: Goerigk, Marc, et al.
Published: (2026)

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

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

Spectral Shadows: When Communication Complexity Meets Linear Invariance Testing
by: Datta, Swarnalipa, et al.
Published: (2026)

Commutation principles for optimization problems involving strictly Schur-convex functions in Euclidean Jordan algebras
by: Massey, Pedro G., et al.
Published: (2025)

The Subspace Flatness Conjecture and Faster Integer Programming
by: Reis, Victor, et al.
Published: (2023)

Interlacing Polynomial Method for Matrix Approximation via Generalized Column and Row Selection
by: Cai, Jian-Feng, et al.
Published: (2023)

Modern column generation for estimating single- and multi-purchase ranked list choice models
by: Costa, Luciano, et al.
Published: (2026)

Information-theoretic coordinate subset and partition selection of multivariate Markov chains via submodular optimization
by: Lai, Zheyuan, et al.
Published: (2025)

From approximate to exact integer programming
by: Dadush, Daniel, et al.
Published: (2022)

New Theoretical Insights and Algorithmic Solutions for Reconstructing Score Sequences from Tournament Score Sets
by: Liu, Bowen
Published: (2025)

Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree
by: Komusiewicz, Christian, et al.
Published: (2023)

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)

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

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

Optimal Online Bipartite Matching in Degree-2 Graphs
by: Bhangale, Amey, et al.
Published: (2025)

The Competition Complexity of Prophet Inequalities
by: Brustle, Johannes, et al.
Published: (2024)

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)

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

Centrality measures and opinion dynamics in two-layer networks with replica nodes
by: Zhao, Chi, et al.
Published: (2024)

Optimising two-block averaging kernels to speed up Markov chains
by: Lim, Ryan J. Y., et al.
Published: (2026)

On additive averaging kernels for finite Markov chains
by: Lim, Ryan J. Y., et al.
Published: (2026)

Probabilistic frames and Wasserstein distances
by: Chen, Dongwei, et al.
Published: (2025)

Solving Hard Instances from Knapsack and Bounded Knapsack Problems: A new state-of-the-art solver
by: da Silva, Renan F. F., et al.
Published: (2026)

Polyhedral approach to weighted connected matchings in general graphs
by: Samer, Phillippe, et al.
Published: (2023)

Generalized Interlacing Families: New Error Bounds for CUR Matrix Decompositions
by: Cai, Jian-Feng, et al.
Published: (2025)

On the Complexity of the Bilevel Shortest Path Problem
by: Henke, Dorothee, et al.
Published: (2024)

Totally $Δ$-Modular Tree Decompositions of Graphic Matrices for Integer Programming
by: McFarland, Caleb
Published: (2026)

A simple Path-based LP Relaxation for Directed Steiner Tree
by: Pashkovich, Kanstantsin, et al.
Published: (2026)

Improved semidefinite programming bounds for the maximum $k$-colorable subgraph problem
by: Barkel, Mathijs, et al.
Published: (2026)

Perturbation Method in Musielak-Orlicz Sequence Spaces
by: Georgiev, Pando, et al.
Published: (2026)

Perturbation Method in Orlicz Sequence Spaces
by: Topalova, Hristina, et al.
Published: (2023)

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

Finding Short Paths on Simple Polytopes
by: Black, Alexander E., et al.
Published: (2026)

Reinforcement-learning-based Algorithms for Optimization Problems and Applications to Inverse Problems
by: Xu, Chen, et al.
Published: (2023)

The global convergence time of stochastic gradient descent in non-convex landscapes: Sharp estimates via large deviations
by: Azizian, Waïss, et al.
Published: (2025)

Approximation algorithms for the prize-collecting rural postman problem
by: Li, Hong, et al.
Published: (2026)