Nonlinear optimization : complexity issues
Author(s)
Bibliographic Information
Nonlinear optimization : complexity issues
(International series of monographs on computer science, 8)
Oxford University Press, 1991
Available at 20 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
"Based on the notes for a one-semester graduate course taught at Cornell University in the spring of 1990"--Pref
Includes bibliographical references (p. 157-162) and index
Description and Table of Contents
Description
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.
Table of Contents
- Optimization and convexity
- complexity theory
- convex quadratic programming
- non-convex quadratic programming
- local optimization
- complexity in the black-box model.
by "Nielsen BookData"