Nondifferentiable Optimization and Polynomial Problems
Author:   N.Z. Shor
Publisher:   Springer-Verlag New York Inc.
Edition:   Softcover reprint of the original 1st ed. 1998
Volume:   24
ISBN:  

9781441947925


Pages:   396
Publication Date:   09 October 2011
Format:   Paperback
Availability:   Out of stock   Availability explained
The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available.

Our Price $604.56 Quantity:  
Add to Cart

Share |

Nondifferentiable Optimization and Polynomial Problems


Add your own review!

Overview

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.

Full Product Details

Author:   N.Z. Shor
Publisher:   Springer-Verlag New York Inc.
Imprint:   Springer-Verlag New York Inc.
Edition:   Softcover reprint of the original 1st ed. 1998
Volume:   24
Dimensions:   Width: 15.50cm , Height: 2.10cm , Length: 23.50cm
Weight:   0.635kg
ISBN:  

9781441947925


ISBN 10:   1441947922
Pages:   396
Publication Date:   09 October 2011
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Out of stock   Availability explained
The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available.

Table of Contents

1 Elements of Convex Analysis, Linear Algebra, and Graph Theory.- 2 Subgradient and ?-Subgradient Methods.- 3 Subgradient-Type Methods with Space Dilation.- 4 Elements of Information and Numerical Complexity of Polynomial Extremal Problems.- 5 Decomposition Methods Based on Nonsmooth Optimization.- 6 Algorithms for Constructing Optimal on Volume Ellipsoids and Semidefinite Programming.- 7 The Role of Ellipsoid Method for Complexity Analysis of Combinatorial Problems.- 8 Semidefinite Programming Bounds for Extremal Graph Problems.- 9 Global Minimization of Polynomial Functions and 17-th Hilbert Problem.- References.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
 Shopping cart
Mailing List

 

Sign up now