{"product_id":"separable-programming-theory-and-methods-9780792368823","title":"Separable Programming: Theory and Methods","description":"\u003cp\u003e • Author(s): S. M. Stefanov\u003cbr\u003e • Publisher: Springer\u003cbr\u003e • Publisher Imprint: Springer\u003cbr\u003e • BISAC: Linear \u0026amp; Nonlinear Programming\u003c\/p\u003e\u003cp\u003eIn 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. \u003cbr\u003e Convex separable programs subject to inequality\/ equality constraint(s) and bounds on variables are also studied and iterative algorithms of polynomial complexity are proposed. \u003cbr\u003e 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\u003csub\u003e1\u003c\/sub\u003e and I\u003csub\u003e4\u003c\/sub\u003e norms, as a convex separable nonsmooth unconstrained minimization problem, is considered as well. \u003cbr\u003e \u003cem\u003eAudience: \u003c\/em\u003e Advanced undergraduate and graduate students, mathematical programming\/ operations research specialists.\u003c\/p\u003e","brand":"Springer","offers":[{"title":"Hardcover","offer_id":45283798548631,"sku":"9780792368823","price":7028.0,"currency_code":"INR","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0666\/3471\/1191\/files\/9780792368823.webp?v=1769305937","url":"https:\/\/atlanticbooks.com\/products\/separable-programming-theory-and-methods-9780792368823","provider":"Atlantic Books","version":"1.0","type":"link"}