Introduction to Global OptimizationSpringer Science & Business Media, 30 thg 6, 1995 - 320 trang Global optimization concerns the computation and characterization of global optima of nonlinear functions. Such problems are widespread in the mathematical modelling of real systems in a very wide range of applications and the last 30 years have seen the development of many new theoretical, algorithmic and computational contributions which have helped to solve globally multiextreme problems in important practical applications. Most of the existing books on optimization focus on the problem of computing locally optimal solutions. Introduction to Global Optimization, however, is a comprehensive textbook on constrained global optimization that covers the fundamentals of the subject, presenting much new material, including algorithms, applications and complexity results for quadratic programming, concave minimization, DC and Lipschitz problems, and nonlinear network flow. Each chapter contains illustrative examples and ends with carefully selected exercises, designed to help students grasp the material and enhance their knowledge of the methods involved. Audience: Students of mathematical programming, and all scientists, from whatever discipline, who need global optimization methods in such diverse areas as economic modelling, fixed charges, finance, networks and transportation, databases, chip design, image processing, nuclear and mechanical design, chemical engineering design and control, molecular biology, and environmental engineering. |
Nội dung
II | 1 |
III | 10 |
IV | 16 |
V | 20 |
VI | 25 |
VII | 26 |
VIII | 32 |
IX | 34 |
XLIX | 159 |
L | 161 |
LI | 167 |
LII | 173 |
LIII | 177 |
LIV | 178 |
LV | 184 |
LVI | 191 |
X | 35 |
XI | 39 |
XII | 47 |
XIII | 49 |
XIV | 50 |
XV | 54 |
XVI | 60 |
XVII | 69 |
XVIII | 72 |
XIX | 77 |
XX | 81 |
XXI | 84 |
XXII | 85 |
XXIII | 86 |
XXIV | 89 |
XXV | 91 |
XXVI | 95 |
XXVII | 99 |
XXVIII | 105 |
XXIX | 106 |
XXXI | 108 |
XXXII | 114 |
XXXIV | 115 |
XXXV | 118 |
XXXVI | 119 |
XXXVII | 125 |
XXXVIII | 129 |
XXXIX | 131 |
XL | 132 |
XLI | 134 |
XLII | 138 |
XLIII | 143 |
XLIV | 145 |
XLV | 150 |
XLVI | 153 |
XLVII | 155 |
XLVIII | 158 |
LVII | 192 |
LVIII | 197 |
LXI | 198 |
LXII | 199 |
LXIII | 200 |
LXIV | 202 |
LXVI | 203 |
LXVII | 206 |
LXVIII | 211 |
LXIX | 219 |
LXX | 228 |
LXXI | 231 |
LXXII | 234 |
LXXIII | 235 |
LXXIV | 236 |
LXXV | 237 |
LXXVI | 241 |
LXXVII | 242 |
LXXVIII | 247 |
LXXIX | 249 |
LXXX | 253 |
LXXXII | 254 |
LXXXIII | 258 |
LXXXIV | 261 |
LXXXV | 264 |
LXXXVI | 265 |
LXXXVII | 267 |
LXXXVIII | 268 |
LXXXIX | 269 |
XC | 270 |
XCII | 272 |
XCIII | 279 |
XCIV | 282 |
XCV | 285 |
308 | |
314 | |
Ấn bản in khác - Xem tất cả
Introduction to Global Optimization R. Horst,Panos M. Pardalos,Nguyen Van Thoai Xem trước bị giới hạn - 2000 |
Introduction to Global Optimization R. Horst,Panos M. Pardalos,Nguyen Van Thoai Xem trước bị giới hạn - 1995 |
Thuật ngữ và cụm từ thông dụng
affine function assume bisection bound algorithm branch and bound Compute concave function concave minimization problem cone Consider constraints convex envelope convex functions convex set corresponding d.c. functions d.c. program defined denote edge equivalent example feasible domain feasible point feasible set fi(x finite number formulation function f(x given global minimum global optimization hence hyperplane H implies inequality integer intersection iteration Kuhn-Tucker linear program Lipschitz constant Lipschitzian lower bound matrix maximum clique maximum clique problem MCCFP min{f(x n-simplex node nonempty nonlinear NP-complete NP-hard objective function objective function value obtain optimal solution optimal value optimization problem partition sets piecewise linear polyhedron polynomial polytope problem min f(x programming problem Proof Proposition quadratic programming rectangle satisfying Section sequence simplex solving subdivision subproblem Theorem upper bound variables vector vertex set vertices y-extension zero-one
Đoạn trích phổ biến
Trang 309 - EISNER, MJ; AND SEVERANCE, D. G. "Mathematical techniques for efficient record segmentation in large shared data bases,
Trang 310 - Modification, Implementation and Comparison of Three Algorithms for Globally Solving Linearly Constrained Concave Minimization Problems, Computing 42, 271-289.
Trang 313 - A Design Centering Algorithm for Nonconvex Regions of Acceptability, IEEE Transactions on Computer- Aided- Design of Integrated Circuits and Systems CAD-1, 13-24.
Trang 308 - Balas, E. and Burdet, CA, Maximizing a Convex Quadratic Function subject to Linear Constraints, Management Science Research Report No.
Trang 312 - H., DC Optimization: Theory, Methods and Algorithms, in: Horst, R. and Pardalos, PM, editors, Handbook of Global Optimization, Kluwer, Dordrecht (1994).
Trang 308 - Concave Minimization: Theory, Applications and Algorithms, in: Horst, R. and Pardalos, PM (Eds.), Handbook of Global Optimization, Kluwer, Dordrecht (1994).