Deterministic Global Optimization: Theory, Methods and ApplicationsSpringer Science & Business Media, 2013. gada 9. marts - 742 lappuses The vast majority of important applications in science, engineering and applied science are characterized by the existence of multiple minima and maxima, as well as first, second and higher order saddle points. The area of Deterministic Global Optimization introduces theoretical, algorithmic and computational ad vances that (i) address the computation and characterization of global minima and maxima, (ii) determine valid lower and upper bounds on the global minima and maxima, and (iii) address the enclosure of all solutions of nonlinear con strained systems of equations. Global optimization applications are widespread in all disciplines and they range from atomistic or molecular level to process and product level representations. The primary goal of this book is three fold : first, to introduce the reader to the basics of deterministic global optimization; second, to present important theoretical and algorithmic advances for several classes of mathematical prob lems that include biconvex and bilinear; problems, signomial problems, general twice differentiable nonlinear problems, mixed integer nonlinear problems, and the enclosure of all solutions of nonlinear constrained systems of equations; and third, to tie the theory and methods together with a variety of important applications. |
No grāmatas satura
1.–5. rezultāts no 56.
ix. lappuse
... Eigenvalue Analysis 409 14.4 Mathematical Model 418 14.5 Algorithmic Procedure 423 14.6 Small Cluster Examples 425 14.7 A Relaxation of the Global Optimization Approach 426 14.8 Discussion on Magic Numbers and Interatomic Spacing 431 ...
... Eigenvalue Analysis 409 14.4 Mathematical Model 418 14.5 Algorithmic Procedure 423 14.6 Small Cluster Examples 425 14.7 A Relaxation of the Global Optimization Approach 426 14.8 Discussion on Magic Numbers and Interatomic Spacing 431 ...
22. lappuse
... eigenvalue is NP - hard . ( v ) The quadratic knapsack problem : is NP - hard . n min Σ bix i + cix2 x i = 1 s.t. a1x1 + ... + an xn = t li ≤ xi ≤ ui , i = 1 , ... , n ( vi ) The quadratic programming problem posed as the 22 ...
... eigenvalue is NP - hard . ( v ) The quadratic knapsack problem : is NP - hard . n min Σ bix i + cix2 x i = 1 s.t. a1x1 + ... + an xn = t li ≤ xi ≤ ui , i = 1 , ... , n ( vi ) The quadratic programming problem posed as the 22 ...
28. lappuse
... eigen- value for general twice differentiable problems . Staus et al . ( 1996 ) formulated the combined adaptive controller design and estimation problem as a nonconvex problem with convex objective and bilinear constraints , and ...
... eigen- value for general twice differentiable problems . Staus et al . ( 1996 ) formulated the combined adaptive controller design and estimation problem as a nonconvex problem with convex objective and bilinear constraints , and ...
42. lappuse
... eigenvalues of the Hessian . If all eigenvalues are greater than or equal to zero for all x Є S , then the Hessian is PSD and hence the function f ( x ) is convex . If all eigenvalues are less or equal than zero for all x Є S then the ...
... eigenvalues of the Hessian . If all eigenvalues are greater than or equal to zero for all x Є S , then the Hessian is PSD and hence the function f ( x ) is convex . If all eigenvalues are less or equal than zero for all x Є S then the ...
44. lappuse
... eigenvalue at every Є S. Remark 2.3.4 From property ( ii ) we observe that the generalization of con- cavity to quasi - concavity is equivalent to allowing the existence of at most one positive eigenvalue of the Hessian . 2.3.4 Pseudo ...
... eigenvalue at every Є S. Remark 2.3.4 From property ( ii ) we observe that the generalization of con- cavity to quasi - concavity is equivalent to allowing the existence of at most one positive eigenvalue of the Hessian . 2.3.4 Pseudo ...
Saturs
1 | |
THE GOP APPROACH IMPLEMENTATION AND COMPUTATIONAL STUDIES | 141 |
THE GOP APPROACH IN BILEVEL LINEAR AND QUADRATIC PROBLEMS | 173 |
DISTRIBUTED IMPLEMENTATION | 243 |
Signomial Problems | 257 |
COMPUTATIONAL STUDIES | 289 |
FROM BICONVEX TO GENERAL TWICE DIFFERENTIABLE NLPS | 309 |
THEORY315 | 315 |
THE ABB APPROACH IN PEPTIDE DOCKING | 481 |
THE ABB APPROACH IN BATCH DESIGN UNDER UNCERTAINTY | 507 |
THE aBB APPROACH IN PARAMETER ESTIMATION | 543 |
Nonlinear and MixedInteger Optimization | 571 |
THE SMINαBB APPROACH THEORY AND COMPUTATIONS | 587 |
THE GMINaBB APPROACH THEORY AND COMPUTATIONS | 617 |
Nonlinear Constrained Systems of Equations | 641 |
LOCATING ALL HOMOGENEOUS AZEOTROPES | 667 |
THE aBB FOR CONSTRAINED TWICE DIFFERENTIABLE NLPS THEORY | 333 |
COMPUTATIONAL STUDIES OF THE ABB APPROACH | 377 |
GLOBAL OPTIMIZATION IN MICROCLUSTERS | 403 |
THE ABB APPROACH IN MOLECULAR STRUCTURE PREDICTION | 435 |
References | 699 |
xiii | 736 |
Citi izdevumi - Skatīt visu
Deterministic Global Optimization: Theory, Methods and Applications Christodoulos A. Floudas Priekšskatījums nav pieejams - 2010 |
Bieži izmantoti vārdi un frāzes
Adjiman azeotropes bilinear terms binary variables bound updates bounding function branch and bound Chapter concave function connected variables convergence convex envelope convex functions convex lower bounding convex relaxation convex set convex underestimators corresponding defined dihedral angles eigenvalue equation Figure formulation fractional function f(x Gibbs free energy global minimum global optimization algorithm global optimization approach global solution GMIN-aBB GOP algorithm Hessian matrix integer interval iteration Lagrange function linear Maranas and Floudas maximum separation methods MILP minimization MINLP node nonconvex terms nonlinear number of iterations objective function obtained optimization problem parameters peptide potential energy primal problem programming problem properties quadratic qualifying constraints relaxed dual problem relaxed dual subproblems shift matrix solved Table tangent plane Theorem total number upper bound variable bounds vector