Nonlinear Optimization : Complexity Issues
The areas of optimization and computer science have their origins in the late 1940s and have grown together in the ensuing time. These fields greatly influence each other and this book is about one important connection: complexity theory. Complexity theory is the theory underlying computer algorithms. How efficient is an algorithm? Does an efficient algorithm exist for a certain problem? These are the types of questions that complexity theory addresses. Even though optimization and computing date back to the 1940s, complexity theory origninated in the 1960s and is connected to many important computation problems, including optimization.
- Hardback | 178 pages
- 160.27 x 241.3 x 19.05mm | 408.23g
- 01 Oct 1991
- Oxford University Press Inc
- New York, United States
- line drawings
Other books in this series
Table of contents
Optimization and convexity; complexity theory; convex quadratic programming; non-convex quadratic programming; local optimization; complexity in the black-box model.