Image de couverture de livre

Tightness of SDP and Burer-Monteiro Factorization for Phase Synchronization in High-Noise Regime

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Zhang, Anderson Ye
Format:	Preprint
Publié:	2025
Sujets:	Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Burer-Monteiro factorizability of nuclear norm regularized optimization
par: Ouyang, Wenqing, et autres
Publié: (2025)

Improved Global Guarantees for the Nonconvex Burer--Monteiro Factorization via Rank Overparameterization
par: Zhang, Richard Y.
Publié: (2022)

Preconditioned Gradient Descent for Overparameterized Nonconvex Burer--Monteiro Factorization with Global Optimality Certification
par: Zhang, Gavin, et autres
Publié: (2022)

Tight SDP relaxations for cardinality-constrained problems
par: Wiegele, Angelika, et autres
Publié: (2021)

Accelerating nuclear-norm regularized low-rank matrix optimization through Burer-Monteiro decomposition
par: Lee, Ching-pei, et autres
Publié: (2022)

Benign landscape for Burer-Monteiro factorizations of MaxCut-type semidefinite programs
par: Endor, Faniriana Rakoto, et autres
Publié: (2024)

A Tight SDP Relaxation for the Cubic-Quartic Regularization Problem
par: Zhou, Jinling, et autres
Publié: (2025)

Time-Varying Semidefinite Programming: Path Following a Burer-Monteiro Factorization
par: Bellon, Antonio, et autres
Publié: (2022)

On the strength of Burer's lifted convex relaxation to quadratic programming with ball constraints
par: Kılınç-Karzan, Fatma, et autres
Publié: (2024)

Approximating Dispatchable Regions in Three-Phase Radial Networks with Conditions for Exact SDP Relaxation
par: Fang, Bohang, et autres
Publié: (2025)

A Scalable Bundle Method for Exact Reformulation of SDP in Three-Phase Power Flow Feasibility
par: Fang, Bohang, et autres
Publié: (2026)

TinySDP: Real Time Semidefinite Optimization for Certifiable and Agile Edge Robotics
par: Mahajan, Ishaan, et autres
Publié: (2026)

Connecting Max-entropy With Computational Geometry, LP And SDP
par: Lasserre, Jean B
Publié: (2026)

Power System State Estimation by Phase Synchronization and Eigenvectors
par: Guzel, Iven, et autres
Publié: (2024)

On the SDP Relaxation of Direct Torque Finite Control Set Model Predictive Control
par: Hartmann, Luca M., et autres
Publié: (2024)

Tight Lower Bounds and Optimal Algorithms for Stochastic Nonconvex Optimization with Heavy-Tailed Noise
par: Fradin, Adrien, et autres
Publié: (2025)

SDP bounds on quantum codes
par: Munné, Gerard Anglès, et autres
Publié: (2024)

A more efficient reformulation of complex SDP as real SDP
par: Wang, Jie
Publié: (2023)

Fast entropy-regularized SDP relaxations for permutation synchronization
par: Lindsey, Michael, et autres
Publié: (2025)

An SDP Relaxation for the Sparse Integer Least Squares Problem
par: Del Pia, Alberto, et autres
Publié: (2022)

Provable Exactness for Asymmetric Low-Rank SDP Learning
par: Hu, Enliang
Publié: (2018)

Chordal Sparsity for SDP-based Neural Network Verification
par: Xue, Anton, et autres
Publié: (2022)

Stable Set Polytopes with High Lift-and-Project Ranks for the Lovász-Schrijver SDP Operator
par: Au, Yu Hin, et autres
Publié: (2023)

RiNNAL+: a Riemannian ALM Solver for SDP-RLT Relaxations of Mixed-Binary Quadratic Programs
par: Hou, Di, et autres
Publié: (2025)

Stochastic Mirror Descent under Iterate-Dependent Markov Noise: Analysis in the Asymptotic and Finite Time Regimes
par: Paul, Anik Kumar, et autres
Publié: (2026)

Improved Global Landscape Guarantees for Low-rank Factorization in Synchronization
par: Ling, Shuyang
Publié: (2026)

A Randomized Algorithm for Sparse PCA based on the Basic SDP Relaxation
par: Del Pia, Alberto, et autres
Publié: (2025)

Tight Finite Time Bounds of Two-Time-Scale Linear Stochastic Approximation with Markovian Noise
par: Haque, Shaan Ul, et autres
Publié: (2023)

Interwoven SDP in Primal-Dual Proximal Splitting Methods for Adjustable Robust Convex Optimisation with SOS-Convex Polynomial Constraints
par: Dizon, Neil D., et autres
Publié: (2026)

On the Exactness of SDP Relaxation for Quadratic Assignment Problem
par: Ling, Shuyang
Publié: (2024)

On the Unification of Optimal Current Reference Theory for Wound Rotor Synchronous Machines
par: Parson-Scherban, Maxfield, et autres
Publié: (2026)

A Characterization for Tightness of the Sparse Moment-SOS Hierarchy
par: Nie, Jiawang, et autres
Publié: (2024)

Training Safe Neural Networks with Global SDP Bounds
par: Soletskyi, Roman, et autres
Publié: (2024)

Infinite Horizon Linear Quadratic Mean Field Problems with Common Noise and Regime Switching via Conditional McKean-Vlasov FBSDEs
par: Wei, Qingmeng, et autres
Publié: (2025)

Tight Big-Ms for Optimal Transmission Switching
par: Pineda, Salvador, et autres
Publié: (2023)

Smoothing Meets Perturbation: Unified and Tight Analysis for Nonconvex-Concave Minimax Optimization
par: Li, Jiajin, et autres
Publié: (2026)

Local convergence of primal-dual interior point methods for nonlinear semidefinite optimization using the Monteiro-Tsuchiya family of search directions
par: Okuno, Takayuki
Publié: (2020)

New Results on the Polyak Stepsize: Tight Convergence Analysis and Universal Function Classes
par: He, Chang, et autres
Publié: (2025)

On Rank-Monotone Graph Operations and Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
par: Au, Yu Hin, et autres
Publié: (2024)

Tight Bounds on Polynomials and Its Application to Dynamic Optimization Problems
par: Vila, Eduardo M. G., et autres
Publié: (2024)