Contacto
Como comprar
Entrega
Guia de compras
Inglês
264 b
Política de devolução de 30 dias
Os clientes também compraram
/
Capa mole
6.67
€
/
Capa mole
13.26
€
/
Capa mole
23.28
€
/
Capa mole
8.80
€
/
Capa mole
7.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.
Sobre o livro
Inglês
Categorias
Ofereça este livro hoje
É fácil
1 Adicione ao carrinho e escolha Entregar como presente ao finalizar a compra 2 Receberá um vale 3 O livro chegará ao endereço do destinatárioTambém pode estar interessado em
/
Cartões
14.07
€
