On Nesterov's approach to semi-infinite programming (Q1862263)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Nesterov's approach to semi-infinite programming |
scientific article |
Statements
On Nesterov's approach to semi-infinite programming (English)
0 references
11 March 2003
0 references
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.
0 references
interior-point algorithms
0 references
moment problems
0 references
semi-infinite programming
0 references
semidefinite programming
0 references
nonnegative polynomials
0 references
