Cover Image

On the Exactness of SDP Relaxation for Quadratic Assignment Problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Ling, Shuyang
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Information Theory Statistics Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Uncertainty Quantification of Spectral Estimator and MLE for Orthogonal Group Synchronization
by: Zhong, Ziliang Samuel, et al.
Published: (2024)

Generalized Orthogonal Procrustes Problem under Arbitrary Adversaries
by: Ling, Shuyang
Published: (2021)

Local Geometry Determines Global Landscape in Low-rank Factorization for Synchronization
by: Ling, Shuyang
Published: (2023)

Randomstrasse101: Open Problems of 2024
by: Bandeira, Afonso S., et al.
Published: (2025)

Randomstrasse101: Open Problems of 2025
by: Bandeira, Afonso S., et al.
Published: (2026)

Theory and applications of the Sum-Of-Squares technique
by: Bach, Francis, et al.
Published: (2023)

SDP bounds on quantum codes
by: Munné, Gerard Anglès, et al.
Published: (2024)

To spike or not to spike: the whims of the Wonham filter in the strong noise regime
by: Bernardin, Cédric, et al.
Published: (2022)

An Oracle Gradient Regularized Newton Method for Quadratic Measurements Regression
by: Fan, Jun, et al.
Published: (2022)

Long-time dynamics and universality of nonconvex gradient descent
by: Han, Qiyang
Published: (2025)

Optimal transport natural gradient for statistical manifolds with continuous sample space
by: Chen, Yifan, et al.
Published: (2018)

High-probability sample complexities for policy evaluation with linear function approximation
by: Li, Gen, et al.
Published: (2023)

Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
by: Li, Gen, et al.
Published: (2021)

Mixing Time of the Proximal Sampler in Relative Fisher Information via Strong Data Processing Inequality
by: Wibisono, Andre
Published: (2025)

Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model
by: Li, Gen, et al.
Published: (2020)

Theory of Compression Channels for Postselected Quantum Metrology
by: Yang, Jing
Published: (2023)

Exactness Conditions for Semidefinite Relaxations of the Quadratic Assignment Problem
by: Chen, Junyu, et al.
Published: (2024)

On the Effectiveness of Classical Regression Methods for Optimal Switching Problems
by: Andersson, Martin, et al.
Published: (2025)

Non-convex matrix sensing: Breaking the quadratic rank barrier in the sample complexity
by: Stöger, Dominik, et al.
Published: (2024)

Gradient descent inference in empirical risk minimization
by: Han, Qiyang, et al.
Published: (2024)

Ensemble-Conditional Gaussian Processes (Ens-CGP): Representation, Geometry, and Inference
by: Ravela, Sai, et al.
Published: (2026)

Optimal Experimental Design for Large-Scale Inverse Problems via Multi-PDE-constrained Optimization
by: Petrocchi, Andrea, et al.
Published: (2024)

Geometric Approach and Closed Exact Formulae for the Lasso
by: Dragović, Vladimir, et al.
Published: (2024)

Online Inference of Constrained Optimization: Primal-Dual Optimality and Sequential Quadratic Programming
by: Gao, Yihang, et al.
Published: (2025)

Quickest Change Detection with Confusing Change
by: Chen, Yu-Zhen Janice, et al.
Published: (2024)

On the relationship between MESP and 0/1 D-Opt and their upper bounds
by: Ponte, Gabriel, et al.
Published: (2025)

The Local Landscape of Phase Retrieval Under Limited Samples
by: Liu, Kaizhao, et al.
Published: (2023)

Gap-Free Clustering: Sensitivity and Robustness of SDP
by: Zurek, Matthew, et al.
Published: (2023)

The High Line: Exact Risk and Learning Rate Curves of Stochastic Adaptive Learning Rate Algorithms
by: Collins-Woodfin, Elizabeth, et al.
Published: (2024)

Exactly or Approximately Wasserstein Distributionally Robust Estimation According to Wasserstein Radii Being Small or Large
by: Ding, Xiao, et al.
Published: (2025)

Phasebook: A Survey of Selected Open Problems in Phase Retrieval
by: Allain, Marc, et al.
Published: (2025)

Convex relaxation for the generalized maximum-entropy sampling problem
by: Ponte, Gabriel, et al.
Published: (2024)

Multifractal Analysis of the Sinkhorn Algorithm: Unveiling the Intricate Structure of Optimal Transport Maps
by: Mena, Jose Rafael Espinosa
Published: (2024)

Approximate D-optimal design and equilibrium measure
by: Henrion, Didier, et al.
Published: (2024)

Optimization via Strategic Law of Large Numbers
by: Chen, Xiaohong, et al.
Published: (2024)

A Christoffel-like function for high-dimensional support inference in graphical models
by: Lasserre, Jean-Bernard, et al.
Published: (2024)

Linear shrinkage for optimization in high dimensions
by: Huang, Naqi, et al.
Published: (2024)

Adaptive discretization algorithms for locally optimal experimental design
by: Schmid, Jochen, et al.
Published: (2024)

Gaussian mixtures closest to a given measure via optimal transport
by: Lasserre, Jean-Bernard
Published: (2024)

Nonconvex landscapes for $\mathbf{Z}_2$ synchronization and graph clustering are benign near exact recovery thresholds
by: McRae, Andrew D., et al.
Published: (2024)