Items related to Nondifferentiable Optimization and Polynomial Problems:...

Nondifferentiable Optimization and Polynomial Problems: 24 (Nonconvex Optimization and Its Applications, 24) - Hardcover

 
9780792349976: Nondifferentiable Optimization and Polynomial Problems: 24 (Nonconvex Optimization and Its Applications, 24)

Synopsis

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.

"synopsis" may belong to another edition of this title.

Synopsis

The book is devoted to investigation of polynomial optimization problems, including Boolean problems which are the most important part of mathematical programming. It is shown that the methods of nondifferentiable optimization can be used for finding solutions of many classes of polynomial problems and for obtaining good dual estimates for optimal objective value in these problems.

"About this title" may belong to another edition of this title.

  • PublisherSpringer
  • Publication date1998
  • ISBN 10 0792349970
  • ISBN 13 9780792349976
  • BindingHardcover
  • LanguageEnglish
  • Number of pages413

Buy Used

Condition: Fine
Zustand: Sehr gut - Gepflegter,...
View this item

£ 38.39 shipping from Germany to U.S.A.

Destination, rates & speeds

Other Popular Editions of the Same Title

9781441947925: Nondifferentiable Optimization and Polynomial Problems: 24 (Nonconvex Optimization and Its Applications, 24)

Featured Edition

ISBN 10:  1441947922 ISBN 13:  9781441947925
Publisher: Springer, 2011
Softcover

Search results for Nondifferentiable Optimization and Polynomial Problems:...

Stock Image

Shor, N.Z.
Published by Springer, 1998
ISBN 10: 0792349970 ISBN 13: 9780792349976
New Hardcover

Seller: Lucky's Textbooks, Dallas, TX, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. Seller Inventory # ABLIING23Feb2416190182810

Contact seller

Buy New

£ 138.91
Convert currency
Shipping: £ 3.01
Within U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Stock Image

N. Z. Shor
Published by SPRINGER NATURE, 1998
ISBN 10: 0792349970 ISBN 13: 9780792349976
Used Hardcover

Seller: Buchpark, Trebbin, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: Sehr gut. Zustand: Sehr gut - Gepflegter, sauberer Zustand. Aus der Auflösung einer renommierten Bibliothek. Kann Stempel beinhalten. | Seiten: 396 | Sprache: Englisch | Produktart: Bücher. Seller Inventory # 3032816/202

Contact seller

Buy Used

£ 110.07
Convert currency
Shipping: £ 38.39
From Germany to U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

Shor, N.Z.
Published by Springer, 1998
ISBN 10: 0792349970 ISBN 13: 9780792349976
New Hardcover

Seller: Ria Christie Collections, Uxbridge, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. In. Seller Inventory # ria9780792349976_new

Contact seller

Buy New

£ 139.22
Convert currency
Shipping: £ 11.98
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Seller Image

N.Z. Shor
Published by Springer US, 1998
ISBN 10: 0792349970 ISBN 13: 9780792349976
New Hardcover

Seller: moluna, Greven, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Gebunden. Condition: New. 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. Seller Inventory # 458439982

Contact seller

Buy New

£ 156.54
Convert currency
Shipping: £ 41.80
From Germany to U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Seller Image

N Z Shor
Published by Springer Us Mär 1998, 1998
ISBN 10: 0792349970 ISBN 13: 9780792349976
New Hardcover

Seller: AHA-BUCH GmbH, Einbeck, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Buch. Condition: Neu. Neuware - 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. Seller Inventory # 9780792349976

Contact seller

Buy New

£ 217.88
Convert currency
Shipping: £ 27.11
From Germany to U.S.A.
Destination, rates & speeds

Quantity: 2 available

Add to basket