Baratchart, L.; Berthod, M.; Pottier, L. Optimization of positive generalized polynomials under \(l^p\) constraints. (English) Zbl 0914.90237 J. Convex Anal. 5, No. 2, 353-379 (1998). Summary: The problem of maximizing a nonnegative generalized polynomial of degree at most \(p\) on the \(l_p\)-sphere is shown to be equivalent to a concave one. Arguments where the maximum is attained are characterized in connection with the irreducible decomposition of the polynomial, and an application to the labelling problem is presented where these results are used to select the initial guess of a continuation method. Cited in 6 Documents MSC: 90C30 Nonlinear programming 90C25 Convex programming Keywords:constrained optimization; convex optimization; combinatorial optimization; subhomogeneous functions; labelling; nonnegative generalized polynomial; \(l_p\)-sphere PDFBibTeX XMLCite \textit{L. Baratchart} et al., J. Convex Anal. 5, No. 2, 353--379 (1998; Zbl 0914.90237) Full Text: EuDML