Separable Programming: Theory and Methods

· Applied Optimization Buku 53 · Springer Science & Business Media
e-Buku
314
Halaman
Rating dan ulasan tidak disahkan  Ketahui Lebih Lanjut

Perihal e-buku ini

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.

Berikan rating untuk e-Buku ini

Beritahu kami pendapat anda.

Maklumat pembacaan

Telefon pintar dan tablet
Pasang apl Google Play Books untuk Android dan iPad/iPhone. Apl ini menyegerak secara automatik dengan akaun anda dan membenarkan anda membaca di dalam atau luar talian, walau di mana jua anda berada.
Komputer riba dan komputer
Anda boleh mendengar buku audio yang dibeli di Google Play menggunakan penyemak imbas web komputer anda.
eReader dan peranti lain
Untuk membaca pada peranti e-dakwat seperti Kobo eReaders, anda perlu memuat turun fail dan memindahkan fail itu ke peranti anda. Sila ikut arahan Pusat Bantuan yang terperinci untuk memindahkan fail ke e-Pembaca yang disokong.