Cover Image

A Moment-QSOS Hierarchy for a Class of Quaternion Polynomial Optimization Problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Liu, Yanqing, Wang, Jie
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control 90C22, 90C23
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

Sparse Polynomial Matrix Optimization
by: Miller, Jared, et al.
Published: (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Outer Approximation Scheme for Weakly Convex Constrained Optimization Problems
by: Bednarczuk, Ewa M., et al.
Published: (2024)

Piecewise SOS-Convex Moment Optimization and Applications via Exact Semi-Definite Programs
by: Huang, Queenie Yingkun, et al.
Published: (2024)

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

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

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

Getting to the Root of the Problem: Sums of Squares for Limits of Trees
by: Brosch, Daniel, et al.
Published: (2024)

On different Versions of the Exact Subgraph Hierarchy for the Stable Set Problem
by: Gaar, Elisabeth
Published: (2020)

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

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

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

An Exceptionally Difficult Binary Quadratic Optimization Problem with Symmetry: a Challenge for The Largest Unsolved QAP Instance Tai256c
by: Fujii, Koichi, et al.
Published: (2023)

Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems
by: Arima, Naohiko, et al.
Published: (2023)

NewVEM: A Newton Vertex Exchange Method for a Class of Constrained Self-Concordant Minimization Problems
by: Liang, Ling, et al.
Published: (2024)

Exactness and Effective Degree Bound of Lasserre's Relaxation for Polynomial Optimization over Finite Variety
by: Hua, Zheng, et al.
Published: (2021)

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

Spectral Outer-Approximation Algorithms for Binary Semidefinite Problems
by: de Roux, Daniel, et al.
Published: (2025)

Superlinear Convergence of an Interior Point Algorithm on Linear Semi-definite Feasibility Problems
by: Sim, Chee-Khian
Published: (2022)

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

Interior-point algorithms with full Newton steps for nonsymmetric convex conic optimization
by: Papp, Dávid, et al.
Published: (2025)

An extension of an RLT-based solver to MINLP polynomial problems
by: González-Díaz, Julio, et al.
Published: (2024)

Bound tightening in lifted formulations: (sub)solver-dependent impact on performance in RLT-based algorithms
by: González-Díaz, Julio, et al.
Published: (2025)