Recent Advances in Global Optimization | Agenda Bookshop Skip to content
A01=Christodoulos A. Floudas
A01=Panos M. Pardalos
Accuracy and precision
Age Group_Uncategorized
Age Group_Uncategorized
Algorithm
Algorithmic efficiency
Approximation algorithm
Author_Christodoulos A. Floudas
Author_Panos M. Pardalos
automatic-update
Bifurcation theory
Big O notation
Calculation
Category1=Non-Fiction
Category=PBU
Category=PBUD
Central limit theorem
Combinatorial optimization
Complex plane
Computation
Computational complexity theory
Conjugate gradient method
Constrained optimization
COP=United States
Covering problems
Decision problem
Delivery_Pre-order
Deterministic global optimization
Direction vector
Duality (optimization)
Dynamic programming
eq_isMigrated=2
Equation
Exponential function
Exponential growth
Extreme point
Feasible region
Function problem
Global optimization
Homotopy
Iteration
Iterative method
Lagrange multiplier
Language_English
Linear complementarity problem
Linear programming
Linearization
Lipschitz continuity
Local optimum
Local search (optimization)
Loss function
Mathematical optimization
Maxima and minima
Maximum likelihood estimation
Newton's method
NP-hardness
Optimal control
Optimal design
Optimization problem
Order of accuracy
PA=Temporarily unavailable
Pareto efficiency
Polynomial
Portfolio optimization
Price_€100 and above
Priority queue
PS=Active
Quadratic function
Quadratic programming
Ranking (information retrieval)
Rate of convergence
Result
Robustness (computer science)
Root-finding algorithm
Search algorithm
Search problem
Simplex algorithm
softlaunch
Special case
Speedup
Stochastic programming
Summation
Theorem
Time complexity
Trust region
Upper and lower bounds
Variable (computer science)

Recent Advances in Global Optimization

This book will present the papers delivered at the first U.S. conference devoted exclusively to global optimization and will thus provide valuable insights into the significant research on the topic that has been emerging during recent years. Held at Princeton University in May 1991, the conference brought together an interdisciplinary group of the most active developers of algorithms for global optimization in order to focus the attention of the mathematical programming community on the unsolved problems and diverse applications of this field. The main subjects addressed at the conference were advances in deterministic and stochastic methods for global optimization, parallel algorithms for global optimization problems, and applications of global optimization. Although global optimization is primarily a mathematical problem, it is relevant to several other disciplines, including computer science, applied mathematics, physical chemistry, molecular biology, statistics, physics, engineering, operations research, communication theory, and economics. Global optimization problems originate from a wide variety of mathematical models of real-world systems. Some of its applications are allocation and location problems and VLSI and data-base design problems. Originally published in 1991. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905. See more
€372.00
A01=Christodoulos A. FloudasA01=Panos M. PardalosAccuracy and precisionAge Group_UncategorizedAlgorithmAlgorithmic efficiencyApproximation algorithmAuthor_Christodoulos A. FloudasAuthor_Panos M. Pardalosautomatic-updateBifurcation theoryBig O notationCalculationCategory1=Non-FictionCategory=PBUCategory=PBUDCentral limit theoremCombinatorial optimizationComplex planeComputationComputational complexity theoryConjugate gradient methodConstrained optimizationCOP=United StatesCovering problemsDecision problemDelivery_Pre-orderDeterministic global optimizationDirection vectorDuality (optimization)Dynamic programmingeq_isMigrated=2EquationExponential functionExponential growthExtreme pointFeasible regionFunction problemGlobal optimizationHomotopyIterationIterative methodLagrange multiplierLanguage_EnglishLinear complementarity problemLinear programmingLinearizationLipschitz continuityLocal optimumLocal search (optimization)Loss functionMathematical optimizationMaxima and minimaMaximum likelihood estimationNewton's methodNP-hardnessOptimal controlOptimal designOptimization problemOrder of accuracyPA=Temporarily unavailablePareto efficiencyPolynomialPortfolio optimizationPrice_€100 and abovePriority queuePS=ActiveQuadratic functionQuadratic programmingRanking (information retrieval)Rate of convergenceResultRobustness (computer science)Root-finding algorithmSearch algorithmSearch problemSimplex algorithmsoftlaunchSpecial caseSpeedupStochastic programmingSummationTheoremTime complexityTrust regionUpper and lower boundsVariable (computer science)

Will deliver when available.

Product Details
  • Weight: 1049g
  • Dimensions: 152 x 229mm
  • Publication Date: 19 Apr 2016
  • Publisher: Princeton University Press
  • Publication City/Country: US
  • Language: English
  • ISBN13: 9780691631875

Customer Reviews

Be the first to write a review
0%
(0)
0%
(0)
0%
(0)
0%
(0)
0%
(0)
We use cookies to ensure that we give you the best experience on our website. If you continue we'll assume that you are understand this. Learn more
Accept