Algorithms for Convex Optimization
eBook - PDF

Algorithms for Convex Optimization

  1. English
  2. PDF
  3. Available on iOS & Android
eBook - PDF

Algorithms for Convex Optimization

About this book

In the last few years, Algorithms for Convex Optimization have revolutionized algorithm design, both for discrete and continuous optimization problems. For problems like maximum flow, maximum matching, and submodular function minimization, the fastest algorithms involve essential methods such as gradient descent, mirror descent, interior point methods, and ellipsoid methods. The goal of this self-contained book is to enable researchers and professionals in computer science, data science, and machine learning to gain an in-depth understanding of these algorithms. The text emphasizes how to derive key algorithms for convex optimization from first principles and how to establish precise running time bounds. This modern text explains the success of these algorithms in problems of discrete optimization, as well as how these methods have significantly pushed the state of the art of convex optimization itself.

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
No, books cannot be downloaded as external files, such as PDFs, for use outside of Perlego. However, you can download books within the Perlego app for offline reading on mobile or tablet. Learn more here.
Perlego offers two plans: Essential and Complete
  • Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
  • Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Both plans are available with monthly, semester, or annual billing cycles.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes! You can use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Yes, you can access Algorithms for Convex Optimization by Nisheeth K. Vishnoi in PDF and/or ePUB format, as well as other popular books in Computer Science & Computer Science General. We have over one million books available in our catalogue for you to explore.

Table of contents

  1. Cover
  2. Half-title
  3. Title page
  4. Copyright information
  5. Dedication
  6. Contents
  7. Preface
  8. Acknowledgments
  9. Notation
  10. 1 Bridging Continuous and Discrete Optimization
  11. 2 Preliminaries
  12. 3 Convexity
  13. 4 Convex Optimization and Efficiency
  14. 5 Duality and Optimality
  15. 6 Gradient Descent
  16. 7 Mirror Descent and the Multiplicative Weights Update
  17. 8 Accelerated Gradient Descent
  18. 9 Newton's Method
  19. 10 An Interior Point Method for Linear Programming
  20. 11 Variants of Interior Point Method and Self-Concordance
  21. 12 Ellipsoid Method for Linear Programming
  22. 13 Ellipsoid Method for Convex Optimization
  23. Bibliography
  24. Index