Kontakt
Ako nakupovať
Doručenie
Nákupný poradca
Angličtina
293 b
30 dní na vrátenie tovaru
Zákazníci tiež kúpili
/
Brožovaná
7.48
€
/
Brožovaná
16.07
€
/
Brožovaná
26.09
€
/
Brožovaná
9.80
€
/
Brožovaná
8.28
€
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.
Informácie o knihe
Angličtina
Kategórie
Darujte túto knihu ešte dnes
Je to jednoduché
1 Pridajte knihu do košíka a vyberte možnosť doručiť ako darček 2 Obratom Vám zašleme poukaz 3 Knihu zašleme na adresu obdarovanéhoMohlo by vás tiež zaujímať
/
Karty
16.18
€
Ahoj! Som Libroamiko, tvoj knižný radca.
Ako ti môžem pomôcť?