Large Scale Optimization: State of the Art
Editat de William W. Hager, D.W. Hearn, Panos M. Pardalosen Limba Engleză Hardback – 31 mai 1994
Preț: 1183.54 lei
Preț vechi: 1443.34 lei
-18%
Puncte Express: 1775
Carte tipărită la comandă
Livrare economică 08-22 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit pentru acest produs Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9780792327981
ISBN-10: 0792327985
Pagini: 456
Ilustrații: XIV, 456 p.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.84 kg
Ediția:1994
Editura: Springer Us
Colecția Springer
Locul publicării:New York, NY, United States
ISBN-10: 0792327985
Pagini: 456
Ilustrații: XIV, 456 p.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.84 kg
Ediția:1994
Editura: Springer Us
Colecția Springer
Locul publicării:New York, NY, United States
Public țintă
ResearchCuprins
Restarting Strategies for the DQA Algorithm.- Mathematical Equivalence of the Auction Algorithm for Assignment and the ?-Relaxation (Preflow-Push) Method for Min Cost Flow.- Preliminary Computational Experience with Modified Log-Barrier Functions for Large-Scale Nonlinear Programming.- A New Stochastic/Perturbation Method for Large-Scale Global Optimization and its Application to Water Cluster Problems.- Improving the Decomposition of Partially Separable Functions in the Context of Large-Scale Optimization: a First Approach.- Gradient-Related Constrained Minimization Algorithms in Function Spaces: Convergence Properties and Computational Implications.- Some Reformulations and Applications of the Alternating Direction Method of Multipliers.- Experience with a Primal Presolve Algorithm.- A Trust Region Method for Constrained Nonsmooth Equations.- On the Complexity of a Column Generation Algorithm for Convex or Quasiconvex Feasibility Problems.- Identification of the Support of Nonsmoothness.- On Very Large Scale Assignment Problems.- Numerical Solution of Parabolic State Constrained Control Problems using SQP- and Interior-Point-Methods.- A Global Optimization Method For Weber’s Problem With Attraction and Repulsion.- Large-Scale Diversity Minimization via Parallel Genetic Algorithms.- A Numerical Comparison of Barrier and Modified Barrier Methods for Large-Scale Bound-Constrained Optimization.- A Numerical Study of Some Data Association Problems Arising in Multitarget Tracking.- Identifying the Optimal Face of a Network Linear Program with a Globally Convergent Interior Point Method.- Solution of Large Scale Stochastic Programs with Stochastic Decomposition Algorithms.- A Simple, Quadratically Convergent Interior Point Algorithm for Linear Programming and ConvexQuadratic Programming.- On Two Algorithms for Nonconvex Nonsmooth Optimization Problems in Structural Mechanics.