Pages that link to "Item:Q1935575"
From MaRDI portal
The following pages link to On solving biquadratic optimization via semidefinite relaxation (Q1935575):
Displaying 11 items.
- Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints (Q625653) (← links)
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems (Q1777422) (← links)
- An efficient alternating minimization method for fourth degree polynomial optimization (Q2070363) (← links)
- Finding the global optimum of a class of quartic minimization problem (Q2114839) (← links)
- Probabilistic Analysis of Semidefinite Relaxation for Binary Quadratic Minimization (Q3058514) (← links)
- Bi-parametric convex quadratic optimization (Q3562397) (← links)
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations (Q3586136) (← links)
- Hardness and Approximation Results for <i>L<sub>p</sub></i>-Ball Constrained Homogeneous Polynomial Optimization Problems (Q5247613) (← links)
- Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems (Q5737720) (← links)
- Exact SDP relaxations for quadratic programs with bipartite graph structures (Q6173960) (← links)
- Tighter bound estimation for efficient biquadratic optimization over unit spheres (Q6618145) (← links)