Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
From MaRDI portal
Publication:3586136
Recommendations
- On solving biquadratic optimization via semidefinite relaxation
- A new relaxation bound for a biquadratic optimization problem with unit spheres
- Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
- Semidefinite relaxation approximation for multivariate bi-quadratic optimization with quadratic constraints.
- Quadratic maximization and semidefinite relaxation
- Bi-parametric convex quadratic optimization
- A computational study for bilevel quadratic programs using semidefinite relaxations
- On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations
- On approximating complex quadratic optimization problems via semidefinite programming relaxations
- Complex Quadratic Optimization and Semidefinite Programming
Cited in
(77)- Sparse model uncertainties in compressed sensing with application to convolutions and sporadic communication
- Constrained best Euclidean distance embedding on a sphere: a matrix optimization approach
- Approximation methods for complex polynomial optimization
- Criteria for the strong ellipticity condition of a partially symmetric tensor
- Bounds of M-eigenvalues and strong ellipticity conditions for elasticity tensors
- Jacobi-type algorithms for homogeneous polynomial optimization on Stiefel manifolds with applications to tensor approximations
- A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure
- Identifying strong ellipticity via bounds on the minimum \(M\)-eigenvalue of elasticity \(Z\)-tensors
- scientific article; zbMATH DE number 7125122 (Why is no real title available?)
- Standard bi-quadratic optimization problems and unconstrained polynomial reformulations
- Non-Markovian dynamics of open quantum systems: stochastic equations and their perturbative solutions
- Shifted inverse power method for computing the smallest M-eigenvalue of a fourth-order partially symmetric tensor
- A direct method for calculating M-eigenvalues of an elasticity tensor
- Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
- Discriminants and nonnegative polynomials
- Positive definiteness of paired symmetric tensors and elasticity tensors
- An alternating shifted inverse power method for the extremal eigenvalues of fourth-order partially symmetric tensors
- Conditions of strong ellipticity and calculations of M-eigenvalues for a partially symmetric tensor
- Convergence analysis of a block improvement method for polynomial optimization over unit spheres.
- Concepts and techniques of optimization on the sphere
- A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
- DC decomposition of nonconvex polynomials with algebraic techniques
- Inhomogeneous polynomial optimization over a convex set: an approximation approach
- Approximation algorithms for nonnegative polynomial optimization problems over unit spheres
- Partially symmetric nonnegative rectangular tensors and copositive rectangular tensors
- An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization
- A successive approximation method for quantum separability
- A practical method for computing the largest \(M\)-eigenvalue of a fourth-order partially symmetric tensor
- Lower bounds for cubic optimization over the sphere
- Global optimization with orthogonality constraints via stochastic diffusion on manifold
- Convergence of an algorithm for the largest singular value of a nonnegative rectangular tensor
- Bi-parametric convex quadratic optimization
- Quaternion matrix decomposition and its theoretical implications
- Singular values of a real rectangular tensor
- NP-hardness of deciding convexity of quartic polynomials and related problems
- Further results of \(\mathrm{M}\)-eigenvalue localization theorem for fourth-order partially symmetric tensors and their applications
- Tighter bound estimation for efficient biquadratic optimization over unit spheres
- On solving biquadratic optimization via semidefinite relaxation
- Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems
- A new relaxation bound for a biquadratic optimization problem with unit spheres
- Bi-block positive semidefiniteness of bi-block symmetric tensors
- Biquadratic tensors, biquadratic decompositions, and norms of biquadratic tensors
- New M-eigenvalue inclusion sets for fourth-order partially symmetric tensors with applications
- New S-type inclusion theorems for the M-eigenvalues of a 4th-order partially symmetric tensor with applications
- Programmable sufficient conditions for the strong ellipticity of partially symmetric tensors
- M-eigenvalue intervals and checkable sufficient conditions for the strong ellipticity
- M-eigenvalues-based sufficient conditions for the positive definiteness of fourth-order partially symmetric tensors
- M-eigenvalue inclusion intervals for a fourth-order partially symmetric tensor
- A note on semidefinite programming relaxations for polynomial optimization over a single sphere
- Parameterized S-type M-eigenvalue inclusion intervals for fourth-order partially symmetric tensors and its applications
- A survey on the spectral theory of nonnegative tensors.
- Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints
- Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
- Alternating direction method for bi-quadratic programming
- Positive maps and separable matrices
- Theorems of the alternative for inequality systems of real polynomials
- The cubic spherical optimization problems
- Epsilon-net method for optimizations over separable states
- An efficient alternating minimization method for fourth degree polynomial optimization
- A note on approximating quadratic programming with rank constraint
- Maximization of homogeneous polynomials over the simplex and the sphere: structure, stability, and generic behavior
- Estimating heterogeneous agent preferences by inverse optimization in a randomized nonatomic game
- Polynomial norms
- Best nonnegative rank-one approximations of tensors
- On the spherical convexity of quadratic functions
- The partially symmetric rank-1 approximation of fourth-order partially symmetric tensors
- scientific article; zbMATH DE number 7592819 (Why is no real title available?)
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Sharp bounds on the minimum \(M\)-eigenvalue and strong ellipticity condition of elasticity \(Z\)-tensors-tensors
- Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
- Semidefinite relaxation approximation for multivariate bi-quadratic optimization with quadratic constraints.
- Finding the extreme \(Z\)-eigenvalues of tensors via a sequential semidefinite programming method.
- Hardness and Approximation Results for Lp-Ball Constrained Homogeneous Polynomial Optimization Problems
- On cones of nonnegative quartic forms
- \(l^{k,s}\)-singular values and spectral radius of partially symmetric rectangular tensors
This page was built for publication: Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586136)
