Normal view MARC view ISBD view

Nonlinear optimization : complexity issues / Stephen A. Vavasis

Main Author Vavasis, Stephen A. Country Estados Unidos. Publication New York : Oxford University Press, 1991 Description X, 165 p. ; 25 cm Series International series of monographs on computer science , 8 ISBN 0-19-507208-1 CDU 519.853
Tags from this library: No tags from this library for this title. Log in to add tags.
    average rating: 0.0 (0 votes)
Item type Current location Call number Status Date due Barcode Item holds
Monografia Biblioteca Geral da Universidade do Minho
BGUM1 519.853 - V Mau estado | Damage 130040
Total holds: 0

Enhanced descriptions from Syndetics:

The fields of computer science and optimization greatly influence each other, and this book is about one important connection between the two: complexity theory. Complexity theory underlies computer algorithms and is used to address such questions as the efficiency of algorithms and the
possibility of algorithmic solutions for particular problems. Furthermore, as optimization problems increase in size with hardware capacity, complexity theory plays a steadily growing role in the exploration of optimization algorithms. As larger and more complicated problems are addressed, it is
more important than ever to understand the asymptotic complexity issues. This book describes some of the key developments in the complexity aspects of optimization during the last decade. It will be a valuable source of information for computer scientists and computational mathematicians.

Table of contents provided by Syndetics

  • 1 Optimization and Convexity
  • 2 Complexity Theory
  • 3 Convex Quadratic Programming
  • 4 Nonconvex Quadratic Programming
  • 5 Local Optimization
  • 6 Complexity in the Black-Box Model

There are no comments for this item.

Log in to your account to post a comment.