Imagen de Portada

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

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Zhang, Anderson Ye
Formato:	Preprint
Publicado:	2025
Materias:	Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Burer-Monteiro factorizability of nuclear norm regularized optimization
por: Ouyang, Wenqing, et al.
Publicado: (2025)

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

Preconditioned Gradient Descent for Overparameterized Nonconvex Burer--Monteiro Factorization with Global Optimality Certification
por: Zhang, Gavin, et al.
Publicado: (2022)

Tight SDP relaxations for cardinality-constrained problems
por: Wiegele, Angelika, et al.
Publicado: (2021)

Accelerating nuclear-norm regularized low-rank matrix optimization through Burer-Monteiro decomposition
por: Lee, Ching-pei, et al.
Publicado: (2022)

Benign landscape for Burer-Monteiro factorizations of MaxCut-type semidefinite programs
por: Endor, Faniriana Rakoto, et al.
Publicado: (2024)

A Tight SDP Relaxation for the Cubic-Quartic Regularization Problem
por: Zhou, Jinling, et al.
Publicado: (2025)

Time-Varying Semidefinite Programming: Path Following a Burer-Monteiro Factorization
por: Bellon, Antonio, et al.
Publicado: (2022)

On the strength of Burer's lifted convex relaxation to quadratic programming with ball constraints
por: Kılınç-Karzan, Fatma, et al.
Publicado: (2024)

Approximating Dispatchable Regions in Three-Phase Radial Networks with Conditions for Exact SDP Relaxation
por: Fang, Bohang, et al.
Publicado: (2025)

A Scalable Bundle Method for Exact Reformulation of SDP in Three-Phase Power Flow Feasibility
por: Fang, Bohang, et al.
Publicado: (2026)

TinySDP: Real Time Semidefinite Optimization for Certifiable and Agile Edge Robotics
por: Mahajan, Ishaan, et al.
Publicado: (2026)

Connecting Max-entropy With Computational Geometry, LP And SDP
por: Lasserre, Jean B
Publicado: (2026)

Power System State Estimation by Phase Synchronization and Eigenvectors
por: Guzel, Iven, et al.
Publicado: (2024)

On the SDP Relaxation of Direct Torque Finite Control Set Model Predictive Control
por: Hartmann, Luca M., et al.
Publicado: (2024)

Tight Lower Bounds and Optimal Algorithms for Stochastic Nonconvex Optimization with Heavy-Tailed Noise
por: Fradin, Adrien, et al.
Publicado: (2025)

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

A more efficient reformulation of complex SDP as real SDP
por: Wang, Jie
Publicado: (2023)

Fast entropy-regularized SDP relaxations for permutation synchronization
por: Lindsey, Michael, et al.
Publicado: (2025)

An SDP Relaxation for the Sparse Integer Least Squares Problem
por: Del Pia, Alberto, et al.
Publicado: (2022)

Provable Exactness for Asymmetric Low-Rank SDP Learning
por: Hu, Enliang
Publicado: (2018)

Chordal Sparsity for SDP-based Neural Network Verification
por: Xue, Anton, et al.
Publicado: (2022)

Stable Set Polytopes with High Lift-and-Project Ranks for the Lovász-Schrijver SDP Operator
por: Au, Yu Hin, et al.
Publicado: (2023)

RiNNAL+: a Riemannian ALM Solver for SDP-RLT Relaxations of Mixed-Binary Quadratic Programs
por: Hou, Di, et al.
Publicado: (2025)

Stochastic Mirror Descent under Iterate-Dependent Markov Noise: Analysis in the Asymptotic and Finite Time Regimes
por: Paul, Anik Kumar, et al.
Publicado: (2026)

Improved Global Landscape Guarantees for Low-rank Factorization in Synchronization
por: Ling, Shuyang
Publicado: (2026)

A Randomized Algorithm for Sparse PCA based on the Basic SDP Relaxation
por: Del Pia, Alberto, et al.
Publicado: (2025)

Tight Finite Time Bounds of Two-Time-Scale Linear Stochastic Approximation with Markovian Noise
por: Haque, Shaan Ul, et al.
Publicado: (2023)

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

On the Exactness of SDP Relaxation for Quadratic Assignment Problem
por: Ling, Shuyang
Publicado: (2024)

On the Unification of Optimal Current Reference Theory for Wound Rotor Synchronous Machines
por: Parson-Scherban, Maxfield, et al.
Publicado: (2026)

A Characterization for Tightness of the Sparse Moment-SOS Hierarchy
por: Nie, Jiawang, et al.
Publicado: (2024)

Training Safe Neural Networks with Global SDP Bounds
por: Soletskyi, Roman, et al.
Publicado: (2024)

Infinite Horizon Linear Quadratic Mean Field Problems with Common Noise and Regime Switching via Conditional McKean-Vlasov FBSDEs
por: Wei, Qingmeng, et al.
Publicado: (2025)

Tight Big-Ms for Optimal Transmission Switching
por: Pineda, Salvador, et al.
Publicado: (2023)

Smoothing Meets Perturbation: Unified and Tight Analysis for Nonconvex-Concave Minimax Optimization
por: Li, Jiajin, et al.
Publicado: (2026)

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

New Results on the Polyak Stepsize: Tight Convergence Analysis and Universal Function Classes
por: He, Chang, et al.
Publicado: (2025)

On Rank-Monotone Graph Operations and Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
por: Au, Yu Hin, et al.
Publicado: (2024)

Tight Bounds on Polynomials and Its Application to Dynamic Optimization Problems
por: Vila, Eduardo M. G., et al.
Publicado: (2024)