On Nesterov's approach to semi-infinite programming
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.
scientific article; zbMATH DE number 1879602