home libri books Fumetti ebook dvd top ten sconti 0 Carrello


Torna Indietro

zaslavski alexander j. - the projected subgradient algorithm in convex optimization

The Projected Subgradient Algorithm in Convex Optimization




Disponibilità: Normalmente disponibile in 15 giorni


PREZZO
54,98 €
NICEPRICE
52,23 €
SCONTO
5%



Questo prodotto usufruisce delle SPEDIZIONI GRATIS
selezionando l'opzione Corriere Veloce in fase di ordine.


Pagabile anche con Carta della cultura giovani e del merito, 18App Bonus Cultura e Carta del Docente


Facebook Twitter Aggiungi commento


Spese Gratis

Dettagli

Genere:Libro
Lingua: Inglese
Editore:

Springer

Pubblicazione: 11/2020
Edizione: 1st ed. 2020





Trama

This focused monograph presents a study of subgradient algorithms for constrained minimization problems in a Hilbert space. The book is of interest for experts in applications of optimization  to engineering and economics. The goal is to obtain a good approximate solution of the problem in the presence of computational errors. The discussion takes into consideration the fact that for every algorithm its iteration consists of several steps and that computational errors for di?erent steps are di?erent, in general.  The book is especially useful for the reader because it contains solutions to a number of difficult and interesting problems in the numerical optimization.  The subgradient  projection algorithm is one of the most important tools in optimization theory and its applications. An optimization  problem is described by an objective function and a set of feasible points. For this algorithm each iteration consists of two steps. The first step requires a calculation of a subgradient of the objective function; the second requires a calculation of a projection on the feasible set. The computational errors in each of these two steps are different.  This book shows that the algorithm discussed, generates a good approximate solution, if all the computational errors are bounded from above by a small positive constant. Moreover, if computational errors for the two steps of the algorithm are known, one discovers an approximate solution and how many iterations one needs for this.  In addition to their mathematical interest, the generalizations considered in this book have a significant practical meaning.





Sommario

1. Introduction.- 2. Nonsmooth Convex Optimization.- 3. Extensions.-  4. Zero-sum Games with Two Players.- 5. Quasiconvex Optimization.- References.




Autore

Alexander J. Zaslavski is professor in the Department of Mathematics, Technion-Israel Institute of Technology, Haifa, Israel.










Altre Informazioni

ISBN:

9783030602994

Condizione: Nuovo
Collana: SpringerBriefs in Optimization
Dimensioni: 235 x 155 mm Ø 454 gr
Formato: Brossura
Illustration Notes:VI, 146 p.
Pagine Arabe: 146
Pagine Romane: vi


Dicono di noi