Convex Analysis and Minimization Algorithms II / Najlacnejšie knihy
Convex Analysis and Minimization Algorithms II

Code: 01653209

Convex Analysis and Minimization Algorithms II

by Jean-Baptiste Hiriart-Urruty, Claude Lemarechal

From the reviews: "The account is quite detailed and is written in a manner that will appeal to analysts and numerical practitioners alike...they contain everything from rigorous proofs to tables of numerical calculations.... one ... more

144.31

RRP: 156.40 €

You save 12.09 €


In stock at our supplier
Shipping in 5 - 8 days
Add to wishlist

You might also like

Give this book as a present today
  1. Order book and choose Gift Order.
  2. We will send you book gift voucher at once. You can give it out to anyone.
  3. Book will be send to donee, nothing more to care about.

Book gift voucher sampleRead more

More about Convex Analysis and Minimization Algorithms II

You get 349 loyalty points

Book synopsis

From the reviews: "The account is quite detailed and is written in a manner that will appeal to analysts and numerical practitioners alike...they contain everything from rigorous proofs to tables of numerical calculations.... one of the strong features of these books...that they are designed not for the expert, but for those who whish to learn the subject matter starting from little or no background...there are numerous examples, and counter-examples, to back up the theory...To my knowledge, no other authors have given such a clear geometric account of convex analysis." "This innovative text is well written, copiously illustrated, and accessible to a wide audience"

Book details

Book category Books in English Mathematics & science Mathematics Calculus & mathematical analysis

144.31

Trending among others



Collection points Bratislava a 12836 dalších

Copyright ©2008-26 najlacnejsie-knihy.sk All rights reservedPrivacyCookies


Account: Log in
Všetky knihy sveta na jednom mieste. Navyše za skvelé ceny.

Shopping cart ( Empty )

For free shipping
shop for 59,99 € and more

You are here: