Constrained Global Optimization: Algorithms and Applications
Global optimization is concerned with the characterization and computation of global minima or maxima of nonlinear functions. Such problems are widespread in mathematical modeling of real world systems for a very broad range of applications. The applications include economies of scale, fixed charges...
| Main Authors: | , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg
Springer Berlin Heidelberg
1987, 1987
|
| Edition: | 1st ed. 1987 |
| Series: | Lecture Notes in Computer Science
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- Convex sets and functions
- Optimality conditions in nonlinear programming
- Combinatorial optimization problems that can be formulated as nonconvex quadratic problems
- Enumerative methods in nonconvex programming
- Cutting plane methods
- Branch and bound methods
- Bilinear programming methods for nonconvex quadratic problems
- Large scale problems
- Global minimization of indefinite quadratic problems
- Test problems for global nonconvex quadratic programming algorithms