Imagen de Portada

Copositivity for a class of fourth order symmetric tensors given by scalar dark matter

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Song, Yisheng, Li, Xudong
Formato:	Preprint
Publicado:	2021
Materias:	Mathematical Physics 90C23
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Copositivity criteria of a class of fourth order 3-dimensional symmetric tensors
por: Song, Yisheng, et al.
Publicado: (2023)

Strict Copositivity for a Class of 3rd Order Symmetric Tensors
por: Li, Min, et al.
Publicado: (2024)

Co-positivity of tensors and bounded from below conditions of CP conserving two-Higgs-doublet potential
por: Song, Yisheng
Publicado: (2022)

Positive Definiteness of $4$th Order $3$-Dimensional Symmetric Tensors with entries $-1$, $0$, $1$
por: Ye, Li, et al.
Publicado: (2025)

Interval B-Tensors and Interval Double B-Tensors
por: Ye, Li, et al.
Publicado: (2026)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

On Computing the Copositive Minimum and its Representatives
por: Oertel, Alexander, et al.
Publicado: (2025)

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

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

Sparse Polynomial Matrix Optimization
por: Miller, Jared, et al.
Publicado: (2024)

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

Copositive Matrices with Ordered Off-Diagonal Entries
por: Blekherman, Grigoriy, et al.
Publicado: (2026)

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

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

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

An ODE approach to multiple choice polynomial programming
por: Shao, Sihong, et al.
Publicado: (2022)

Copositive and completely positive cones over symmetric cones of rank at least 5
por: Nishijima, Mitsuhiro
Publicado: (2026)

Finite convergence and minimizer extraction in moment relaxations with correlative sparsity
por: Fantuzzi, Giovanni, et al.
Publicado: (2025)

Degree Bounds for Positivstellensätze of general semialgebraic sets
por: Heijmans-Kuryatnikova, Olga, et al.
Publicado: (2026)

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

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

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

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

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