Separable Programming
S.M. Stefanov
ISBN 10: 0792368827 ISBN 13: 9780792368823
Editorial: Kluwer Academic Publishers, US, 2001
Nuevos
Hardback
Librería:
Rarewaves.com UK, London, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Vendedor de AbeBooks desde 11 de junio de 2025
Este artículo en concreto ya no está disponible.
Descripción
Descripción:
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 I1 and I4 norms, as a convex separable nonsmooth unconstrained minimization problem, is considered as well. N° de ref. del artículo LU-9780792368823
Sinopsis:
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 I1 and I4 norms, as a convex separable nonsmooth unconstrained minimization problem, is considered as well.
Audience: Advanced undergraduate and graduate students, mathematical programming/ operations research specialists.
Reseña del editor:
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 I1 and I4 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 este título" puede pertenecer a otra edición de este libro.
Detalles bibliográficos
Título: Separable Programming
Editorial: Kluwer Academic Publishers, US
Año de publicación: 2001
Encuadernación: Hardback
Condición: New
Edición: 2001 ed.