Approximation algorithms for homogeneous polynomial optimization with quadratic constraints (Q607501)

From MaRDI portal
Revision as of 11:26, 21 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q888302)
scientific article
Language Label Description Also known as
English
Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
scientific article

    Statements

    Approximation algorithms for homogeneous polynomial optimization with quadratic constraints (English)
    0 references
    0 references
    0 references
    22 November 2010
    0 references
    Constrained maximization of a generic polynomial function \(F(x^1,\dots, x^d)\), \(x^k\in\mathbb{R}^{n(k)}\) for all \(k=1,\dots, d,\) is studied. Two types of constraints are considered: (1) Euclidean spherical constraints of the form \(\| x^k\|= 1\), for all \(k= 1,\dots, d\); (2) general ellipsoidal constraints of the form \((x^k)^TQ^k_{i_k}\,x^k\leq 1\), \(k= 1,\dots, d\), \(i_k= 1,\dots, m_k\). Algorithms for solving the optimization problems are described, a comparison with related papers in the literature is presented. Numerical results are reported illustrating the effectiveness of the proposed approximation algorithms.
    0 references
    multi-linear tensor form
    0 references
    polynomial function optimization
    0 references
    approximation algorithm
    0 references

    Identifiers