BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Separable Programming : Theory and Methods

Separable Programming : Theory and Methods

Separable Programming : Theory and Methods Hardback - 2001 - 2001st Edition

by S.M. Stefanov

Add to wish list
  • New
  • Hardback
New

Description

Hardcover. New. New Book; Fast Shipping from UK; Not signed; Not First Edition; 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 prog
Ask the seller a question Add to wish list
A$199.61
A$15.50 Delivery to USA
Standard delivery: 7 to 12 days
More delivery options
Ships from Ria Christie Collections (Greater London, United Kingdom)
The BIBLIO Guarantee

Details

  • Title Separable Programming : Theory and Methods
  • Author S.M. Stefanov
  • Binding Hardback
  • Edition number 2001st
  • Edition 2001
  • Condition New
  • Pages 314
  • Volumes 1
  • Language ENG
  • Publisher Springer
  • Publication date 2001-05-31
  • Features Bibliography, Index
  • Bookseller's Inventory # ria9780792368823_inp
  • ISBN 9780792368823 / 0792368827
  • Weight 1.42 lbs (0.64 kg)
  • Dimensions 9.7 x 6.44 x 0.92 in (24.64 x 16.36 x 2.34 cm)
  • Category Mathematics
  • Library of Congress subjects Convex programming
  • Library of Congress Catalogue Number 2001029308
  • Dewey Decimal Code 519.76
  • Quantity available 880

About Ria Christie Collections Greater London, United Kingdom

Specialising in: Books, Calendars, Fiction Books, Non- Fiction Books, Textbooks
Biblio member since 2014

Hello We are professional online booksellers. We sell mostly new books and textbooks and we do our best to provide a competitive price. We are based in Greater London, UK. We pride ourselves by providing a good customer service throughout, shipping the items quickly and replying to customer queries promptly. Ria Christie Collections

Terms of Sale:

30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Ria Christie Collections

Reader reviews for Separable Programming : Theory and Methods

Write a review for this book

There are no reviews for this book yet. Be the first to write a review!

Your review will be anonymous unless you login or create an account first.

Overall rating
Remember: You’re rating the book as a work, not the seller or the condition of the specific copy you purchased!

Important Terms and Guidelines

  • Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
  • Reviews must be at least 140 characters in length.
  • Please do not reveal critical plot elements.
  • This is not a help line. Contact customer support if you need help.
Your review must not include:
  • Obscenities, discriminatory language, or other insulting language not suitable for public domain
  • Advertisements, “spam” content, or references to other products, offers or websites.
  • Email addresses, URLs, phone numbers, physical addresses or other contact information.
  • Overly critical comments about other reviews or reviewers
  • Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
  • Availability, price, or alternative ordering/shipping information

From the publisher

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.

First line

In this chapter, wo give some definitions and results connected with convex analysis, convex programming, and Lagrangian duality.

Please wait a moment while we load the requested page.

tracking-