Copertina

A more efficient reformulation of complex SDP as real SDP

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Wang, Jie
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Optimization and Control 90C22, 90C23
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A Low-rank Augmented Lagrangian Method for Polyhedral-SDP and Moment-SOS Relaxations of Polynomial Optimization
di: Hou, Di, et al.
Pubblicazione: (2025)

Benchmarking of quantum and classical SDP relaxations for QUBO formulations of real-world logistics problems
di: Ostermann, Birte, et al.
Pubblicazione: (2025)

Separable QCQPs and Their Exact SDP Relaxations
di: Kojima, Masakazu, et al.
Pubblicazione: (2026)

On exactness of SDP relaxation for the maximum cut problem
di: Bhardwaj, Avinash, et al.
Pubblicazione: (2025)

Constructing QCQP Instances Equivalent to Their SDP Relaxations
di: Kojima, Masakazu, et al.
Pubblicazione: (2025)

SDP Approach to Quadratic Vertex-Disjoint Paths Problem
di: Xu, Mingming, et al.
Pubblicazione: (2026)

Edge expansion of a graph: SDP-based computational strategies
di: Gupte, Akshay, et al.
Pubblicazione: (2024)

SDP bounds on the stability number via ADMM and intermediate levels of the Lasserre hierarchy
di: Sinjorgo, Lennart, et al.
Pubblicazione: (2025)

A Moment-QSOS Hierarchy for a Class of Quaternion Polynomial Optimization Problems
di: Liu, Yanqing, et al.
Pubblicazione: (2026)

Strong SDP based bounds on the cutwidth of a graph
di: Gaar, Elisabeth, et al.
Pubblicazione: (2023)

Exact SDP relaxations for a class of quadratic programs with finite and infinite quadratic constraints
di: Arima, Naohiko, et al.
Pubblicazione: (2024)

Weighted Geometric Mean, Minimum Mediated Set, and Optimal Simple Second-Order Cone Representation
di: Wang, Jie
Pubblicazione: (2022)

Exploiting Sign Symmetries in Minimizing Sums of Rational Functions
di: Guo, Feng, et al.
Pubblicazione: (2024)

Relaxations of KKT Conditions do not Strengthen Finite RLT and SDP-RLT Bounds for Nonconvex Quadratic Programs
di: Yildirim, E. Alper
Pubblicazione: (2025)

A Moment-SOS Hierarchy for Robust Polynomial Matrix Inequality Optimization with SOS-Convexity
di: Guo, Feng, et al.
Pubblicazione: (2023)

A Computational Search for Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
di: Au, Yu Hin, et al.
Pubblicazione: (2025)

Sparse Polynomial Matrix Optimization
di: Miller, Jared, et al.
Pubblicazione: (2024)

A Bilevel Hierarchy of Strengthened Complex Moment Relaxations for Complex Polynomial Optimization
di: Wang, Jie
Pubblicazione: (2024)

Sparse Polynomial Optimization with Unbounded Sets
di: Huang, Lei, et al.
Pubblicazione: (2024)

Duality attainment and strict feasibility of the generalized moment problem and its relaxations
di: Halaseh, Sami, et al.
Pubblicazione: (2026)

The link between $1$-norm approximation and effective Positivstellensatze for the hypercube
di: de Klerk, Etienne, et al.
Pubblicazione: (2024)

An Overview of Convergence Rates for Sum of Squares Hierarchies in Polynomial Optimization
di: Laurent, Monique, et al.
Pubblicazione: (2024)

A parameter-free approach for solving SOS-convex semi-algebraic fractional programs
di: Yang, Chengmiao, et al.
Pubblicazione: (2024)

A Dual Riemannian ADMM Algorithm for Low-Rank SDPs with Unit Diagonal
di: Wang, Jie, et al.
Pubblicazione: (2025)

Solving Low-Rank Semidefinite Programs via Manifold Optimization
di: Wang, Jie, et al.
Pubblicazione: (2023)

Nonconvergence of a sum-of-squares hierarchy for global polynomial optimization based on push-forward measures
di: Slot, Lucas, et al.
Pubblicazione: (2024)

Sum-of-squares hierarchies for polynomial optimization and the Christoffel-Darboux kernel
di: Slot, Lucas
Pubblicazione: (2021)

Sum-of-squares certificates for symmetric polynomials on the hypercube: a counterexample to a conjecture of De Klerk and Laurent
di: Polak, Sven
Pubblicazione: (2026)

Stable Set Polytopes with Rank $|V(G)|/3$ for the Lovász--Schrijver SDP Operator
di: Au, Yu Hin, et al.
Pubblicazione: (2025)

Computational complexity of sum-of-squares bounds for copositive programs
di: Palomba, Marilena, et al.
Pubblicazione: (2025)

Sparse convex relaxations in polynomial optimization
di: Averkov, Gennadiy, et al.
Pubblicazione: (2024)

Moment-sos and spectral hierarchies for polynomial optimization on the sphere and quantum de Finetti theorems
di: Blomenhofer, Alexander Taveira, et al.
Pubblicazione: (2024)

Exploiting Sparsity in Complex Polynomial Optimization
di: Wang, Jie, et al.
Pubblicazione: (2021)

Semidefinite approximations for bicliques and biindependent pairs
di: Laurent, Monique, et al.
Pubblicazione: (2023)

Dual certificates of primal cone membership
di: Lee, Joonyeob, et al.
Pubblicazione: (2025)

Solving clustered low-rank semidefinite programs arising from polynomial optimization
di: Leijenhorst, Nando, et al.
Pubblicazione: (2022)

Semidefinite hierarchies for diagonal unitary invariant bipartite quantum states
di: Britz, Jonas, et al.
Pubblicazione: (2025)

Tighter yet more tractable relaxations and nontrivial instance generation for sparse standard quadratic optimization
di: Bomze, Immanuel, et al.
Pubblicazione: (2024)

Comparative Evaluation of SDP, SOCP, and QC Convex Relaxations for Large-Scale Market-Based AC Optimal Power Flow
di: Keskin, Ata
Pubblicazione: (2026)

Feature selection in linear SVMs via a hard cardinality constraint: a scalable SDP decomposition approach
di: Bomze, Immanuel, et al.
Pubblicazione: (2024)