On Nesterov's approach to semi-infinite programming (Q1862263)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1879602
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Nesterov's approach to semi-infinite programming |
scientific article; zbMATH DE number 1879602 |
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
0.7792579531669617
0 references
0.7783657908439636
0 references
0.7783653736114502
0 references
