Approximation hierarchies for copositive cone over symmetric cone and their comparison
From MaRDI portal
Publication:6122328
DOI10.1007/s10898-023-01319-3arXiv2211.12753MaRDI QIDQ6122328
Mitsuhiro Nishijima, Kazuhide Nakata
Publication date: 5 April 2024
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.12753
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On conic QPCCs, conic QCQPs and completely positive programs
- Mixed integer second-order cone programming formulations for variable selection in linear regression
- SOS tensor decomposition: theory and applications
- Moment approximations for set-semidefinite polynomials
- Symmetric nonnegative tensors and copositive tensors
- An improved algorithm to test copositivity
- On the computational complexity of membership problems for the completely positive cone and its dual
- Geometry of the copositive and completely positive cones
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
- Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Uniform denominators in Hilbert's seventeenth problem
- A block coordinate descent method for sensor network localization
- A hierarchy of semidefinite relaxations for completely positive tensor optimization problems
- Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices
- Completely positive reformulations for polynomial optimization
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates
- Weighted LCPs and interior point systems for copositive linear transformations on Euclidean Jordan algebras
- Quadratic optimization over one first-order cone
- New approximations for the cone of copositive matrices and its dual
- Solving polynomial least squares problems via semidefinite programming relaxations
- How to Integrate a Polynomial over a Sphere
- Approximation of the Stability Number of a Graph via Copositive Programming
- An Introduction to Formally Real Jordan Algebras and Their Applications in Optimization
- Semidefinite Characterization of Sum-of-Squares Cones in Algebras
- Symmetric Tensor Approximation Hierarchies for the Completely Positive Cone
- On the accuracy of uniform polyhedral approximations of the copositive cone
- Sums of even powers of real linear forms
- Invariant Integration Formulas for the n-Simplex by Combinatorial Methods
- A Sum-of-Squares Approach to Fixed-Order H∞-Synthesis
- A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems
- Geometry of the Copositive Tensor Cone and its Dual
- An Adaptive Linear Approximation Algorithm for Copositive Programs
- Copositive and Completely Positive Matrices
- Nonnegative Tensor Factorization, Completely Positive Tensors, and a Hierarchical Elimination Algorithm
- Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
- Tensor Analysis
- DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- LMI Approximations for Cones of Positive Semidefinite Forms
- On Cones of Nonnegative Quadratic Functions
- On the irreducibility, self-duality an non-homogeneity of completely positive cones
- On copositive programming and standard quadratic optimization problems
- A new bound for Pólya's theorem with applications to polynomials positive on polyhedra.
