Nondifferentiable Optimization and Polynomial ProblemsSpringer Science & Business Media, 31 thg 3, 1998 - 396 trang 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. |
Nội dung
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 |
Ấn bản in khác - Xem tất cả
Thuật ngữ và cụm từ thông dụng
approximation arbitrary calculate clique coefficients complexity computational Consider constraints convergence convex programming convex programming problem convex set corresponding decomposition denote descent direction dual bound edges eigenvalues eigenvectors ellipsoid method fi(x fo(x formula function f gf(x global minimum gradient graph G hyperplane inscribed ellipsoids integer interior point methods iteration Kibernetika Kiev Lagrange function Lagrange multipliers linear programming LP problem Math matrix max-cut max-cut problem maximal maximum minimization minimum point n x n n-dimensional N.Z. SHOR nodes nonempty nonlinear nonnegative nonsmooth objective function obtain operations optimal solution optimization problems orthogonal P.M. PARDALOS parameter penalty function perfect graphs polytope positive definite Proof quadratic function r-algorithm semidefinite programming sequence solving space dilation step subgradient method subgradient-type subset sum of squares symmetric matrices Theorem theory upper bound variables vector vertex weight ΕΙ
Đoạn trích phổ biến
Trang 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.