Contatto
Come acquistare
Consegna
Guida all'acquisto
Inglese
323 b
30 giorni per il reso
I clienti hanno acquistato anche
/
In brossura
8.19
€
/
In brossura
16.49
€
/
In brossura
27.29
€
/
In brossura
10.69
€
/
In brossura
8.59
€
In this book, the author considers separable programming and, in particular, one of its important cases - convex separable programming. Some general results are presented, techniques of approximating the separable problem by linear programming and dynamic programming are considered. §Convex separable programs subject to inequality/ equality constraint(s) and bounds on variables are also studied and iterative algorithms of polynomial complexity are proposed. §As an application, these algorithms are used in the implementation of stochastic quasigradient methods to some separable stochastic programs. Numerical approximation with respect to I 1 and I 4 norms, as a convex separable nonsmooth unconstrained minimization problem, is considered as well. §Audience: Advanced undergraduate and graduate students, mathematical programming/ operations research specialists.
Informazioni sul libro
Inglese
Categorie
Regala questo libro oggi stesso
È facile
1 Aggiungi il libro al carrello e scegli la consegna come regalo 2 Ti invieremo subito il buono 3 Il libro arriverà all'indirizzo del destinatarioPotrebbe interessarti anche
/
Carte
18.09
€
Ciao! Sono Libroamiko, il tuo consulente di libri.
Come posso aiutarti?