Mathematical Theory of Optimization
Our rough guess is there are 68,250 words in this book.
At a pace averaging 250 words per minute, this book will take 4 hours and 33 minutes to read. With a half hour per day, this will take 9 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Author
Contributions
- Pardalos, Panos M. - Contributor
- Wu, Weili - Contributor
Publication
2001 - Springer US, Boston, MA, United States
Language
English
Word Count
68,250 words, Guess
Page Count
273 pages
Physical Format
[electronic resource] /
Identifiers
- Open LibraryOL27073330M
- ISBN-139781441952028
- ISBN-101441952020
- OCLC Control Number851837090
- OCLC Control Numbermathematicaltheo00dudi
Classifications
- DDC519.6
- LCCQA402.5-402.6
Description
This book provides an introduction to the mathematical theory of optimization. It emphasizes the convergence theory of nonlinear optimization algorithms and applications of nonlinear optimization to combinatorial optimization. It includes recent developments in global convergence, the Powell conjecture, semidefinite programming, and relaxation techniques for designs of approximation solutions of combinatorial optimization problems. Audience: The book can be a textbook or useful reference for undergraduate and graduate students in applied mathematics, operations research, and computer science.
Subjects
Series Statement
- Nonconvex Optimization and Its Applications -- 56
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!