Convex Analysis and Minimization Algorithms I: Fundamentals (Grundlehren der mathematischen Wissenschaften Book 305)
Our rough guess is there are 104,500 words in this book.
At a pace averaging 250 words per minute, this book will take 6 hours and 58 minutes to read. With a half hour per day, this will take 14 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.
Publication
2011-05-26 - Springer
Word Count
104,500 words, Guess
Page Count
418 pages
Identifiers
- Open LibraryOL26744529M
- ISBN-139783662027967
- ISBN-103662027968
Classifications
- LCCQA402.5-402.6
Description
Convex Analysis may be considered as a refinement of standard calculus, with equalities and approximations replaced by inequalities. As such, it can easily be integrated into a graduate study curriculum. Minimization algorithms, more specifically those adapted to non-differentiable functions, provide an immediate application of convex analysis to various fields related to optimization and operations research. These two topics making up the title of the book, reflect the two origins of the authors, who belong respectively to the academic world and to that of applications. Part I can be used as an introductory textbook (as a basis for courses, or for self-study); Part II continues this at a higher technical level and is addressed more to specialists, collecting results that so far have not appeared in books.
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!