Convex Optimization with Computational Errors, Hardcover/Alexander J. Zaslavski

Descriere YEO:

Convex Optimization with Computational Errors, - Disponibil la elefant.ro

Pe YEO găsești Convex Optimization with Computational Errors, de la Springer, în categoria Carte straina.

Indiferent de nevoile tale, Convex Optimization with Computational Errors, Hardcover/Alexander J. Zaslavski din categoria Carte straina îți poate aduce un echilibru perfect între calitate și preț, cu avantaje practice și moderne.

Caracteristici și Avantaje ale produsului Convex Optimization with Computational Errors,

• Departament: gaming-carti-birotica
• Ideal pentru pasionații de jocuri, birotică și distracție online.

Preț: 708 Lei

Caracteristicile produsului Convex Optimization with Computational Errors,

• Brand: Springer
• Categoria: Carte straina
• Magazin: elefant.ro
• Ultima actualizare: 23-04-2020 21:59:11

Comandă Convex Optimization with Computational Errors, Online, Simplu și Rapid

Prin intermediul platformei YEO, poți comanda Convex Optimization with Computational Errors, de la elefant.ro rapid și în siguranță. Bucură-te de o experiență de cumpărături online optimizată și descoperă cele mai bune oferte actualizate constant.

Descriere magazin:
The book is devoted to the study of approximate solutions of optimization problems in the presence of computational errors. It contains a number of results on the convergence behavior of algorithms in a Hilbert space, which are known as important tools for solving optimization problems. The research presented in the book is the continuation and the further development of the author\'s (c) 2016 book Numerical Optimization with Computational Errors, Springer 2016. Both books study the algorithms taking into account computational errors which are always present in practice. The main goal is, for a known computational error, to find out what an approximate solution can be obtained and how many iterates one needs for this. The main difference between this new book and the 2016 book is that in this present book the discussion takes into consideration the fact that for every algorithm, its iteration consists of several steps and that computational errors for different steps are generally, different. This fact, which was not taken into account in the previous book, is indeed important in practice. For example, the subgradient projection algorithm consists of two steps. The first step is a calculation of a subgradient of the objective function while in the second one we calculate a projection on the feasible set. In each of these two steps there is a computational error and these two computational errors are different in general. It may happen that the feasible set is simple and the objective function is complicated. As a result, the computational error, made when one calculates the projection, is essentially smaller than the computational error of the calculation of the subgradient. Clearly, an opposite case is possible too. Another feature of this book is a study of a number of important algorithms which appeared recently in the literature and which are not discussed in the previous book. This monograph contains 12 chapters. Chapter 1 is an introduction. In Chapter 2 we stu