Explore the latest books of this year!
Bookbot

Convex Analysis and Minimization Algorithms I

Fundamentals

Parameters

  • 440 pages
  • 16 hours of reading

More about the book

The book presents convex analysis as an advanced extension of standard calculus, emphasizing inequalities over equalities, making it suitable for graduate studies. It highlights minimization algorithms tailored for non-differentiable functions, showcasing applications in optimization and operations research. The work is divided into two parts: the first serves as an introductory textbook for courses or self-study, while the second delves into advanced topics for specialists, compiling previously unpublished results.

Book purchase

Convex Analysis and Minimization Algorithms I, Jean-Baptiste Hiriart-Urruty, Claude Lemarechal

Language
Released
2011
product-detail.submit-box.info.binding
(Paperback)
We’ll email you as soon as we track it down.

Payment methods

No one has rated yet.Add rating