Global Optimization with Non-Convex Constraints: Sequential and Parallel Algorithms: Nonconvex Optimization and Its Applications, cartea 45
Autor Roman G. Strongin, Yaroslav D. Sergeyeven Limba Engleză Paperback – 10 noi 2013
Din seria Nonconvex Optimization and Its Applications
- 18%
Preț: 912.85 lei -
Preț: 383.21 lei - 18%
Preț: 1165.24 lei - 18%
Preț: 899.46 lei - 18%
Preț: 1738.02 lei - 18%
Preț: 1177.32 lei - 18%
Preț: 908.18 lei - 18%
Preț: 1481.05 lei - 20%
Preț: 943.92 lei - 18%
Preț: 1169.11 lei - 24%
Preț: 3083.61 lei - 18%
Preț: 1170.20 lei - 20%
Preț: 948.10 lei - 18%
Preț: 913.32 lei - 20%
Preț: 953.05 lei - 15%
Preț: 618.66 lei - 18%
Preț: 905.46 lei - 18%
Preț: 905.59 lei - 18%
Preț: 1160.77 lei - 18%
Preț: 1743.51 lei - 18%
Preț: 1274.76 lei - 18%
Preț: 914.52 lei - 18%
Preț: 1172.23 lei - 15%
Preț: 618.47 lei - 15%
Preț: 618.66 lei - 18%
Preț: 1756.71 lei - 18%
Preț: 908.71 lei - 20%
Preț: 949.44 lei - 20%
Preț: 943.49 lei - 18%
Preț: 1178.72 lei - 18%
Preț: 1173.68 lei
Preț: 927.56 lei
Preț vechi: 1131.17 lei
-18%
Puncte Express: 1391
Preț estimativ în valută:
164.05€ • 189.58$ • 141.58£
164.05€ • 189.58$ • 141.58£
Carte tipărită la comandă
Livrare economică 25 aprilie-09 mai
Specificații
ISBN-13: 9781461371175
ISBN-10: 1461371171
Pagini: 732
Ilustrații: XXVIII, 704 p. 1 illus.
Dimensiuni: 155 x 235 x 38 mm
Greutate: 1.01 kg
Ediția:2000
Editura: Springer Us
Colecția Springer
Seria Nonconvex Optimization and Its Applications
Locul publicării:New York, NY, United States
ISBN-10: 1461371171
Pagini: 732
Ilustrații: XXVIII, 704 p. 1 illus.
Dimensiuni: 155 x 235 x 38 mm
Greutate: 1.01 kg
Ediția:2000
Editura: Springer Us
Colecția Springer
Seria Nonconvex Optimization and Its Applications
Locul publicării:New York, NY, United States
Public țintă
ResearchCuprins
Preface. Acknowledgements. Part One: Global Optimization Algorithms as Decision Procedures. Theoretical Background and Core Univariate Case. 1. Introduction. 2. Global Optimization Algorithms as Statistical Decision Procedures - The Information Approach. 3. Core Global Search Algorithm and Convergence Study. 4. Global Optimization Methods as Bounding Procedures - The Geometric Approach. Part Two: Generalizations for Parallel Computing, Constrained and Multiple Criteria Problems. 5. Parallel Global Optimization Algorithms and Evaluation of the Efficiency of Parallelism. 6. Global Optimization under Non-Convex Constraints - The Index Approach. 7. Algorithms for Multiple Criteria Multiextremal Problems. Part Three: Global Optimization in Many Dimensions. Generalizations through Peano Curves. 8. Peano-Type Space-Filling Curves as Means for Multivariate Problems. 9. Multidimensional Parallel Algorithms. 10. Multiple Peano Scannings and Multidimensional Problems. References. List of Algorithms. List of Figures. List of Tables. Index.