A new relaxation bound for a biquadratic optimization problem with unit spheres

zbMATH Open1299.90274MaRDI QIDQ5166151FDOQ5166151

Authors: Xiaoming Zhao, Qingzhi Yang 

Publication date: 30 June 2014

Recommendations

• Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
• Convergence analysis of a block improvement method for polynomial optimization over unit spheres.
• Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
• On solving biquadratic optimization via semidefinite relaxation
• Semidefinite relaxation approximation for multivariate bi-quadratic optimization with quadratic constraints.

zbMATH Keywords

biquadratic optimizationapproximation solutionpartially symmetric strongly positive definite tensor

Mathematics Subject Classification ID

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

Cited In (3)

• Convergence analysis of a block improvement method for polynomial optimization over unit spheres.
• Tighter bound estimation for efficient biquadratic optimization over unit spheres
• Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations

This page was built for publication: A new relaxation bound for a biquadratic optimization problem with unit spheres

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166151)