stefanov s m (12 Ergebnisse)

Zustand: New.

Zustand: New. In.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Hardcover. Zustand: Like New. Like New. book.

Paperback. Zustand: Brand New. 336 pages. 9.25x6.10x0.77 inches. In Stock.

paperback. Zustand: New. Paperback. Pub Date :2014-02-01 Pages: 154 Language: Chinese Publisher: China Electric Power Press to engage today's Web work. whether you are going for the client. server. or mobile users to build applications. JavaScript knowledge is must have. and your experience will allow you to have aspects of PHP head start advantage. This book will help you quickly become familiar with JavaScript. once you start writing code that can be used as a convenient reference book. The main contents of this bo.

paperback. Zustand: New. Paperback. Language: Chinese. In Publisher: China Electric Power Press.

Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 dynami.

Buch. Zustand: Neu. Separable Programming | Theory and Methods | S. M. Stefanov | Buch | xix | Englisch | 2001 | Springer US | EAN 9780792368823 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.

Buch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 340 pp. Englisch.

Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 dynami.

Buch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 340 pp. Englisch.