menu
{ "item_title" : "Large-Scale Convex Optimization", "item_author" : [" Ernest K. Ryu", "Wotao Yin "], "item_description" : "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.", "item_img_path" : "https://covers3.booksamillion.com/covers/bam/1/00/916/085/1009160850_b.jpg", "price_data" : { "retail_price" : "83.00", "online_price" : "83.00", "our_price" : "83.00", "club_price" : "83.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Large-Scale Convex Optimization|Ernest K. Ryu

Large-Scale Convex Optimization : Algorithms & Analyses Via Monotone Operators

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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.

This item is Non-Returnable

Details

  • ISBN-13: 9781009160858
  • ISBN-10: 1009160850
  • Publisher: Cambridge University Press
  • Publish Date: December 2022
  • Dimensions: 10 x 7 x 0.75 inches
  • Shipping Weight: 1.69 pounds
  • Page Count: 318

Related Categories

You May Also Like...

    1

BAM Customer Reviews