Faybusovich, Leonid On Nesterov’s approach to semi-infinite programming. (English) Zbl 1027.90098 Acta Appl. Math. 74, No. 2, 195-215 (2002). The author generalizes the Nesterov’s construction for the reduction of various classes of optimization problems to the semidefinite programming form. The author shows that all Nesterov’s results can be generalized to ‘cones of squares’ generated by arbitrary bilinear maps between finite-dimensional vector spaces. Several examples are considered to illustrate the scheme for the construction. Reviewer: Francisco Guerra Vazquez (Puebla) Cited in 13 Documents MSC: 90C34 Semi-infinite programming 90C51 Interior-point methods 90C22 Semidefinite programming Keywords:interior-point algorithms; moment problems; semi-infinite programming; semidefinite programming; nonnegative polynomials Software:CRYPTIM PDFBibTeX XMLCite \textit{L. Faybusovich}, Acta Appl. Math. 74, No. 2, 195--215 (2002; Zbl 1027.90098) Full Text: DOI