Convex Optimization: Algorithms and Complexity 在线电子书 pdf 下载 txt下载 epub 下载 mobi 下载 2024

☆☆☆☆☆
简体网页||繁体网页

Sébastien Bubeck 作者

Now Publishers Inc

译者

2015 出版日期

142 页数

0 价格

Foundations and Trends® in Machine Learning 丛书系列

9781601988607 图书编码

Convex Optimization: Algorithms and Complexity 在线电子书图书标签: 凸优化 Optimization Machine_Learning 数学

喜欢 Convex Optimization: Algorithms and Complexity 在线电子书的读者还喜欢

下载链接在页面底部

点击这里下载

想要找书就要到图书目录大全

book.wenda123.org

立刻按 ctrl+D收藏本页

你会得到大惊喜!!

发表于2024-11-24

facebook linkedin mastodon messenger pinterest reddit telegram twitter viber vkontakte whatsapp 复制链接

Convex Optimization: Algorithms and Complexity 在线电子书 epub 下载 mobi 下载 pdf 下载 txt 下载 2024

Convex Optimization: Algorithms and Complexity 在线电子书 pdf 下载 txt下载 epub 下载 mobi 下载 2024

Convex Optimization: Algorithms and Complexity 在线电子书用户评价

评分☆☆☆☆☆

Très bien

评分☆☆☆☆☆

Très bien

评分☆☆☆☆☆

Très bien

评分☆☆☆☆☆

Très bien

评分☆☆☆☆☆

Très bien

Convex Optimization: Algorithms and Complexity 在线电子书著者简介

Convex Optimization: Algorithms and Complexity 在线电子书图书目录

Convex Optimization: Algorithms and Complexity 在线电子书 pdf 下载 txt下载 epub 下载 mobi 在线电子书下载

Convex Optimization: Algorithms and Complexity 在线电子书图书描述

This monograph presents the main complexity theorems in convex optimization and their corresponding algorithms. It begins with the fundamental theory of black-box optimization and proceeds to guide the reader through recent advances in structural optimization and stochastic optimization. The presentation of black-box optimization, strongly influenced by the seminal book by Nesterov, includes the analysis of cutting plane methods, as well as (accelerated) gradient descent schemes. Special attention is also given to non-Euclidean settings (relevant algorithms include Frank-Wolfe, mirror descent, and dual averaging), and discussing their relevance in machine learning. The text provides a gentle introduction to structural optimization with FISTA (to optimize a sum of a smooth and a simple non-smooth term), saddle-point mirror prox (Nemirovski's alternative to Nesterov's smoothing), and a concise description of interior point methods. In stochastic optimization it discusses stochastic gradient descent, mini-batches, random coordinate descent, and sublinear algorithms. It also briefly touches upon convex relaxation of combinatorial problems and the use of randomness to round solutions, as well as random walks based methods.

Convex Optimization: Algorithms and Complexity 在线电子书下载 mobi epub pdf txt 在线电子书下载

想要找书就要到图书目录大全

book.wenda123.org

立刻按 ctrl+D收藏本页

你会得到大惊喜!!