Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints (Q625653): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-010-9545-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2149049779 / rank
 
Normal rank

Revision as of 20:29, 19 March 2024

scientific article
Language Label Description Also known as
English
Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
scientific article

    Statements

    Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints (English)
    0 references
    0 references
    0 references
    0 references
    25 February 2011
    0 references
    The paper focuses on bi-quadratic optimization, a difficult nonconvex optimization problem with potential applications in quantum physics (entanglement problem) or signal and image processing (tensor approximation). The authors study bounds derived from semidefinite programming (SDP) relaxations. First they relax the bi-quadratic problem into bi-linear SDP problems which are themselves difficult to solve. Second they use classical linear SDP relaxations of the bi-linear problems to derive bounds for the original bi-quadratic problem.
    0 references
    nonconvex quadratic programming
    0 references
    semidefinite programming relaxations
    0 references

    Identifiers