Cantitate/Preț
Produs

Developments in Global Optimization: Nonconvex Optimization and Its Applications, cartea 18

Editat de Immanuel M. Bomze, Tibor Csendes, R. Horst, Panos M. Pardalos
en Limba Engleză Hardback – 31 ian 1997
In recent years global optimization has found applications in many interesting areas of science and technology including molecular biology, chemical equilibrium problems, medical imaging and networks. The collection of papers in this book indicates the diverse applicability of global optimization. Furthermore, various algorithmic, theoretical developments and computational studies are presented.
Audience: All researchers and students working in mathematical programming.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 99030 lei  6-8 săpt.
  Springer Us – 6 dec 2010 99030 lei  6-8 săpt.
Hardback (1) 99672 lei  6-8 săpt.
  Springer Us – 31 ian 1997 99672 lei  6-8 săpt.

Din seria Nonconvex Optimization and Its Applications

Preț: 99672 lei

Preț vechi: 124591 lei
-20% Nou

Puncte Express: 1495

Preț estimativ în valută:
19075 19679$ 16144£

Carte tipărită la comandă

Livrare economică 04-18 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780792343516
ISBN-10: 0792343514
Pagini: 364
Ilustrații: XI, 348 p.
Dimensiuni: 156 x 234 x 25 mm
Greutate: 0.69 kg
Ediția:1997
Editura: Springer Us
Colecția Springer
Seria Nonconvex Optimization and Its Applications

Locul publicării:New York, NY, United States

Public țintă

Research

Cuprins

NOP — A Compact Input Format for Nonlinear Optimization Problems.- GLOPT — A Program for Constrained Global Optimization.- Global Optimization for Imprecise Problems.- New Results on Gap-Treating Techniques in Extended Interval Newton Gauss-Seidel Steps for Global Optimization.- Quadratic Programming with Box Constraints.- Evolutionary Approach to the Maximum Clique Problem: Empirical Evidence on a Larger Scale.- Interval and Bounding Hessians.- On Global Search for Non-Convex Optimal Control Problems.- A Multistart Linkage Algorithm Using First Derivatives.- Convergence Speed of an Integral Method for Computing the Essential Supremum.- Complexity Analysis Integrating Pure Adaptive Search (PAS) and Pure Random Search (PRS).- LGO — A Program System for Continuous and Lipschitz Global Optimization.- A Method Using Local Tuning for Minimizing Functions with Lipschitz Derivatives.- Molecular Structure Prediction by Global Optimization.- Optimal Renewal Policy for Slowly Degrading Systems.- Numerical Prediction of Crystal Structures by Simulated Annealing.- Multidimensional Optimization in Image Reconstruction from Projections.- Greedy Randomized Adaptive Search for a Location Problem with Economies of Scale.- An Algorithm for Improving the Bounding Procedure in Solving Process Network Synthesis by a B&B Method.