Developments in Global Optimization
Editat de Immanuel M Bomze, Tibor Csendes, R. Horst, Panos M Pardalosen Limba Engleză Hardback – 31 ian 1997
Audience: All researchers and students working in mathematical programming.
Preț: 956.64 lei
Preț vechi: 1195.80 lei
-20%
Puncte Express: 1435
Preț estimativ în valută:
169.07€ • 198.91$ • 147.59£
169.07€ • 198.91$ • 147.59£
Carte tipărită la comandă
Livrare economică 06-20 aprilie
Specificații
ISBN-13: 9780792343516
ISBN-10: 0792343514
Pagini: 348
Ilustrații: XI, 348 p.
Dimensiuni: 160 x 241 x 25 mm
Greutate: 0.71 kg
Ediția:1997 edition
Editura: Springer Us
Locul publicării:New York, NY, United States
ISBN-10: 0792343514
Pagini: 348
Ilustrații: XI, 348 p.
Dimensiuni: 160 x 241 x 25 mm
Greutate: 0.71 kg
Ediția:1997 edition
Editura: Springer Us
Locul publicării:New York, NY, United States
Public țintă
ResearchCuprins
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.