null
Loading…
Skip to main content Skip to buy box

Holiday gifts by Fri, Dec 18? Order by Thu, Dec 3. Plan gifts Gifts by Dec 18? Order by Dec 3. Plan

Free shipping on most orders over $95 in the contiguous US

Specialists Mon–Fri, 8:30 am–5 pm PTSpecialists Mon–Fri, 8:30–5 PT866-522-6657

Printed to order
Algorithms for Sparsity-Constrained Optimization (Springer Theses #261) book cover by Sohail Bahmani
Hardcover

Algorithms for Sparsity-Constrained Optimization (Springer Theses #261)

by Sohail Bahmani

From $149.59 / copy at 25+ copies; lower per-copy prices at higher quantities (see Volume pricing) As low as $146.19 at 100+

Total $3,739.75

Hardcover · 107 pages Springer International Publishing · 2013

Format

Hardcover
Volume pricing

The more copies, the less each one costs

Applied automatically in your cart. No code needed.

About the book

Algorithms for Sparsity-Constrained Optimization (Springer Theses #261)

This thesis demonstrates techniques that provide faster and more accurate solutions to a variety of problems in machine learning and signal processing. The author proposes a "greedy" algorithm, deriving sparse solutions with guarantees of optimality. The use of this algorithm removes many of the inaccuracies that occurred with the use of previous models.

Details

Publisher
Springer International Publishing
Author
Sohail Bahmani
Format
Hardcover
Published
Oct 18, 2013
ISBN-13
9783319018805
Pages
107
Printing
Printed on demand
Buying for a group

Algorithms for Sparsity-Constrained Optimization (Springer Theses #261) for groups: pricing

Volume pricing applies automatically in your cart. No codes, no account needed.

CopiesPrice per copyYou save
25 – 49 $149.59 12% off list
50 – 99 $147.89 13% off list
100+ $146.19 14% off list
Ways groups use it

Popular for

1
Course and classroom adoption

A copy for every student in the class or section.

2
Faculty and staff book studies

Shared reading for professional development.

3
Orientation and campus events

Common reads and first-year programs.

Where can I buy 100 copies of Algorithms for Sparsity-Constrained Optimization?

BookPal sells Algorithms for Sparsity-Constrained Optimization in quantity. At 100 copies the price is $146.19 a copy, against a list price of $169.99, and the cart applies the volume tier automatically. Free shipping on most orders over $95 in the contiguous US. A specialist can quote a larger or mixed order.

  • New books only, straight from the publisher
  • Volume prices apply automatically in the cart, with no code needed
  • Order at least 10 business days before you need the books (11 from mid-November through December)

Ask a specialist about a larger or mixed order

What does Algorithms for Sparsity-Constrained Optimization (Springer Theses #261) cost when I buy for a group?

Volume pricing applies automatically in your cart, with no code needed. Price per copy: 25 to 49 copies, $149.59 (12% off list); 50 to 99 copies, $147.89 (13% off list); 100+ copies, $146.19 (14% off list). Need a different quantity, or a quote to forward for approval? Ask a specialist and we will confirm pricing before you pay.

How fast can I get copies of Algorithms for Sparsity-Constrained Optimization (Springer Theses #261)?

This title is printed on demand, so it needs production time before it ships. Need them by a specific date? Request a quote and we'll confirm timing before you pay.

Can you ship to several locations or people's homes?

Yes. We ship group orders to one address, to multiple sites, or to individual recipients, in the US and internationally. See fulfillment options.

Can I get a formal quote for approval before ordering?

Yes. Request a quote and we'll send a PDF you can forward for approval.

Do you accept purchase orders and tax-exempt orders?

Yes. We accept purchase orders upon approval, as well as cards, PayPal, ACH, wire transfers and checks. BookPal is a tax-exempt supplier in all 50 states. See purchase orders and sales tax exemption.

What if I find a lower price?

Send us the link. We match prices from other booksellers and distributors on a new copy in the same edition, available to ship in the quantity you need. Clearance sales and pricing errors are the exception, and we'll tell you quickly if that's the case. Start a price match.

Send for approval

Get a yes from your approver

Algorithms for Sparsity-Constrained Optimization (Springer Theses #261)
Email it to my approver

Your approver gets a link to this page with the quantity set and an "Approve and order" button. Nothing is sent until you press send in your email app.

Log In
Review Your Cart
Your cart is empty Your cart is empty Your cart is empty

Menu

Recently Viewed Recently Viewed
Back to top Back to top