Convex Analysis and Nonlinear Optimization
Theory and Examples (CMS Books in Mathematics)
Our rough guess is there are 77,500 words in this book.
At a pace averaging 250 words per minute, this book will take 5 hours and 10 minutes to read. With a half hour per day, this will take 11 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.
Word Count
77,500 words, Guess
Page Count
310 pages
Identifiers
- Internet Archiveconvexanalysisno00borw_812
- Internet Archiveconvexanalysisno00borw_328
- Internet Archiveconvexanalysisno00borw_854
- Internet Archiveconvexanalysisno00borw_827
- ISBN-100387295704
and 6 more
- ISBN-139780387295701
- LibraryThing1617780
- Library of Congress Control Number2005934031
- OCLC Control Number63166869
- Better World Books9780387295701
- Open LibraryOL7445187M
Classifications
- LCCQA299.6-433QA402.5-4
- LCCQA331.5 .B65 2006
Description
A cornerstone of modern optimization and analysis, convexity pervades applications ranging through engineering and computation to finance. This concise introduction to convex analysis and its extensions aims at first year graduate students, and includes many guided exercises. The corrected Second Edition adds a chapter emphasizing concrete models. New topics include monotone operator theory, Rademacher's theorem, proximal normal geometry, Chebyshev sets, and amenability. The final material on "partial smoothness" won a 2005 SIAM Outstanding Paper Prize. Jonathan M. Borwein, FRSC is Canada Research Chair in Collaborative Technology at Dalhousie University. A Fellow of the AAAS and a foreign member of the Bulgarian Academy of Science, he received his Doctorate from Oxford in 1974 as a Rhodes Scholar and has worked at Waterloo, Carnegie Mellon and Simon Fraser Universities. Recognition for his extensive publications in optimization, analysis and computational mathematics includes the 1993 Chauvenet prize. Adrian S. Lewis is a Professor in the School of Operations Research and Industrial Engineering at Cornell. Following his 1987 Doctorate from Cambridge, he has worked at Waterloo and Simon Fraser Universities. He received the 1995 Aisenstadt Prize, from the University of Montreal, and the 2003 Lagrange Prize for Continuous Optimization, from SIAM and the Mathematical Programming Society. About the First Edition: "...a very rewarding book, and I highly recommend it... " - M.J. Todd, in the International Journal of Robust and Nonlinear Control "...a beautifully written book... highly recommended..." - L. Qi, in the Australian Mathematical Society Gazette "This book represents a tour de force for introducing so many topics of present interest in such a small space and with such clarity and elegance." - J.-P. Penot, in Canadian Mathematical Society Notes "There is a fascinating interweaving of theory and applications..." - J.R. Giles, in Mathematical Reviews "...an ideal introductory teaching text..." - S. Cobzas, in Studia Universitatis Babes-Bolyai Mathematica
Subjects
Other Editions
- Convex Analysis and Nonlinear Optimization: Theory and Examples (CMS Books in Mathematics)
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!