Nondifferentiable Optimization and Polynomial Problems

Capa
Springer Science & Business Media, 31/03/1998 - 396 páginas
Polynomial extremal problems (PEP) constitute one of the most important subclasses of nonlinear programming models. Their distinctive feature is that an objective function and constraints can be expressed by polynomial functions in one or several variables. Let :e = {:e 1, ... , :en} be the vector in n-dimensional real linear space Rn; n PO(:e), PI (:e), ... , Pm (:e) are polynomial functions in R with real coefficients. In general, a PEP can be formulated in the following form: (0.1) find r = inf Po(:e) subject to constraints (0.2) Pi (:e) =0, i=l, ... ,m (a constraint in the form of inequality can be written in the form of equality by introducing a new variable: for example, P( x) ~ 0 is equivalent to P(:e) + y2 = 0). Boolean and mixed polynomial problems can be written in usual form by adding for each boolean variable z the equality: Z2 - Z = O. Let a = {al, ... ,a } be integer vector with nonnegative entries {a;}f=l. n Denote by R[a](:e) monomial in n variables of the form: n R[a](:e) = IT :ef'; ;=1 d(a) = 2:7=1 ai is the total degree of monomial R[a]. Each polynomial in n variables can be written as sum of monomials with nonzero coefficients: P(:e) = L caR[a](:e), aEA{P) IX x Nondifferentiable optimization and polynomial problems where A(P) is the set of monomials contained in polynomial P.
 

Índice

II
1
V
8
VI
19
VII
22
VIII
25
IX
30
X
35
XI
37
XXXVI
169
XXXVII
178
XXXIX
187
XL
193
XLI
196
XLII
200
XLIII
210
XLIV
220

XII
51
XIII
57
XIV
68
XV
71
XVII
74
XVIII
88
XIX
100
XX
113
XXV
118
XXVI
121
XXVII
133
XXVIII
141
XXXII
145
XXXIII
147
XXXIV
152
XLV
227
L
232
LI
239
LII
254
LIII
257
LV
265
LVI
279
LVII
293
LVIII
299
LXIII
308
LXIV
320
LXV
330
LXVI
335
Direitos de autor

Outras edições - Ver tudo

Palavras e frases frequentes

Passagens conhecidas

Página 360 - JL GOFFIN, Convergence results in a class of variable metric subgradient methods, in Nonlinear Programming 4, Editors: OL Mangasarian, RR Meyer and SM Robinson, pp.

Informação bibliográfica