Books > Business & Economics > Business & management > Management & management techniques > Operational research
|
Buy Now
Convex Analysis and Minimization Algorithms I - Fundamentals (Paperback, Softcover reprint of hardcover 1st ed. 1993)
Loot Price: R4,031
Discovery Miles 40 310
|
|
Convex Analysis and Minimization Algorithms I - Fundamentals (Paperback, Softcover reprint of hardcover 1st ed. 1993)
Series: Grundlehren der mathematischen Wissenschaften, 305
Expected to ship within 10 - 15 working days
|
Convex Analysis may be considered as a refinement of standard
calculus, with equalities and approximations replaced by
inequalities. As such, it can easily be integrated into a graduate
study curriculum. Minimization algorithms, more specifically those
adapted to non-differentiable functions, provide an immediate
application of convex analysis to various fields related to
optimization and operations research. These two topics making up
the title of the book, reflect the two origins of the authors, who
belong respectively to the academic world and to that of
applications. Part I can be used as an introductory textbook (as a
basis for courses, or for self-study); Part II continues this at a
higher technical level and is addressed more to specialists,
collecting results that so far have not appeared in books.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
|
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.