Large-Scale Convex Optimization
No Customer Reviews
Starting from where a first course in convex optimization leaves off, this text presents a unified analysis of first-order optimization methods - including parallel-distributed algorithms - through the abstraction of monotone operators. With the increased computational power and availability of big data over the past decade, applied disciplines have demanded that larger and larger optimization problems be solved. This text covers the first-order convex optimization methods that are uniquely effective at solving these large-scale optimization problems. Readers will have the opportunity to construct and analyze many well-known classical and modern algorithms using monotone operators, and walk away with a solid understanding of the diverse optimization algorithms. Graduate students and researchers in mathematical optimization, operations research, electrical engineering, statistics, and computer science will appreciate this concise introduction to the theory of convex optimization algorithms.
Format:Hardcover
Language:English
ISBN:1009160850
ISBN13:9781009160858
Release Date:December 2022
Publisher:Cambridge University Press
Length:400 Pages
Weight:1.69 lbs.
Dimensions:0.8" x 7.0" x 10.0"
Customer Reviews
0 rating
Copyright © 2025 Thriftbooks.com
Terms of Use | Privacy Policy | Do Not Sell/Share My Personal Information | Cookie Policy | Cookie Preferences | Accessibility Statement
ThriftBooks ® and the ThriftBooks ® logo are registered trademarks of Thrift Books Global, LLC
ThriftBooks ® and the ThriftBooks ® logo are registered trademarks of Thrift Books Global, LLC
