Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations

DOI10.1137/080729104zbMATH Open1221.90074OpenAlexW2128762995MaRDI QIDQ3586136FDOQ3586136

Authors: Chen Ling, Jiawang Nie, Liqun Qi, Yinyu Ye 

Publication date: 6 September 2010

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10397/4766

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

zbMATH Keywords

semidefinite programmingapproximate solutionsum of squarespolynomial time approximation schemebiquadratic optimization

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26) Semidefinite programming (90C22)

Cited In (74)

• 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
• Standard bi-quadratic optimization problems and unconstrained polynomial reformulations
• Non-Markovian dynamics of open quantum systems: stochastic equations and their perturbative solutions
• Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors
• Positive definiteness of paired symmetric tensors and elasticity tensors
• Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
• Discriminants and nonnegative polynomials
• Finding the extreme Z-eigenvalues of tensors via a sequential semidefinite programming method
• Concepts and techniques of optimization on the sphere
• DC decomposition of nonconvex polynomials with algebraic techniques
• Partially symmetric nonnegative rectangular tensors and copositive rectangular tensors
• Polynomial Norms
• Approximation algorithms for nonnegative polynomial optimization problems over unit spheres
• A successive approximation method for quantum separability
• Sparse Model Uncertainties in Compressed Sensing with Application to Convolutions and Sporadic Communication
• Global optimization with orthogonality constraints via stochastic diffusion on manifold
• Quaternion matrix decomposition and its theoretical implications
• Convergence of an algorithm for the largest singular value of a nonnegative rectangular tensor
• Bi-parametric convex quadratic optimization
• Best Nonnegative Rank-One Approximations of Tensors
• Singular values of a real rectangular tensor
• Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems
• NP-hardness of deciding convexity of quartic polynomials and related problems
• On solving biquadratic optimization via semidefinite relaxation
• 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
• Semidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraints
• 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
• Parameterized S-type M-eigenvalue inclusion intervals for fourth-order partially symmetric tensors and its applications
• Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints
• A practical method for computing the largestM-eigenvalue of a fourth-order partially symmetric tensor
• Constrained Best Euclidean Distance Embedding on a Sphere: A Matrix Optimization Approach
• Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
• Positive maps and separable matrices
• Alternating direction method for bi-quadratic programming
• Theorems of the alternative for inequality systems of real polynomials
• The cubic spherical optimization problems
• A note on approximating quadratic programming with rank constraint
• An efficient alternating minimization method for fourth degree polynomial optimization
• Maximization of homogeneous polynomials over the simplex and the sphere: structure, stability, and generic behavior
• Epsilon-net method for optimizations over separable states
• Estimating heterogeneous agent preferences by inverse optimization in a randomized nonatomic game
• Title not available (Why is that?)
• On the spherical convexity of quadratic functions
• 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
• A survey on the spectral theory of nonnegative tensors
• Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces
• Hardness and Approximation Results for L_p-Ball Constrained Homogeneous Polynomial Optimization Problems
• Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
• Convergence analysis of a block improvement method for polynomial optimization over unit spheres
• Inhomogeneous polynomial optimization over a convex set: An approximation approach
• On cones of nonnegative quartic forms
• \(l^{k,s}\)-singular values and spectral radius of partially symmetric rectangular tensors
• Identifying strong ellipticity via bounds on the minimum \(M\)-eigenvalue of elasticity \(Z\)-tensors
• Title not available (Why is that?)
• 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
• 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
• A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
• An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization
• 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
• The partially symmetric rank-1 approximation of fourth-order partially symmetric 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)