Andere Kunden interessierten sich auch für
![(Hyper)-Graphs Inference through Convex Relaxations and Move Making Algorithms]( "(Hyper)-Graphs Inference through Convex Relaxations and Move Making Algorithms")
(Hyper)-Graphs Inference through Convex Relaxations and Move Making Algorithms90,99 €![Distributed Optimization and Statistical Learning Via the Alternating Direction Method of Multipliers]( "Distributed Optimization and Statistical Learning Via the Alternating Direction Method of Multipliers")
Distributed Optimization and Statistical Learning Via the Alternating Direction Method of Multipliers96,99 €![Convergence Rate of Distributed Averaging Dynamics and Optimization in Networks]( "Convergence Rate of Distributed Averaging Dynamics and Optimization in Networks")
Convergence Rate of Distributed Averaging Dynamics and Optimization in Networks90,99 €![Tutorial on Amortized Optimization]( "Tutorial on Amortized Optimization")
Tutorial on Amortized Optimization114,99 €![Optimization with Sparsity-Inducing Penalties]( "Optimization with Sparsity-Inducing Penalties")
Optimization with Sparsity-Inducing Penalties90,99 €![Tensor Networks for Dimensionality Reduction and Large-scale Optimization]( "Tensor Networks for Dimensionality Reduction and Large-scale Optimization")
Tensor Networks for Dimensionality Reduction and Large-scale Optimization125,99 €![A Pragmatic Introduction to Secure Multi-Party Computation]( "A Pragmatic Introduction to Secure Multi-Party Computation")
A Pragmatic Introduction to Secure Multi-Party Computation109,99 €
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.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.