On Nesterov's approach to semi-infinite programming
type: Item
instance of: scholarly article
title: On Nesterov's approach to semi-infinite programming
zbMATH Open document ID: 1027.90098
DOI: 10.1023/A:1020643711475
author: L. Faybusovich
published in: Acta Applicandae Mathematicae
publication date: 2003-03-11T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90C34
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 1879602
zbMATH Keywords: interior-point algorithms
zbMATH Keywords: moment problems
zbMATH Keywords: semi-infinite programming
zbMATH Keywords: semidefinite programming
zbMATH Keywords: nonnegative polynomials
reviewed by: Francisco Guerra Vazquez
describes a project that uses: CRYPTIM
MaRDI profile type: Publication
full work available at URL: a:1020643711475
OpenAlex ID: W168152063
description: scientific article; zbMATH DE number 1879602