Bookbot

Convex Analysis and Minimization Algorithms I

Fundamentals

Parametry

  • 440 stron
  • 16 godzin czytania

Więcej o książce

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.

Zakup książki

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

Język
Rok wydania
2011
Oprawa
(miękka)
Jak tylko się pojawi, wyślemy Ci wiadomość e-mail.

Metody płatności

Nikt jeszcze nie ocenił.Oceń

Tytuł
Convex Analysis and Minimization Algorithms I
Podtytuł
Fundamentals
Język
angielski
Rok wydania
2011
Oprawa
miękka
Liczba stron
440
ISBN13
9783642081613
Seria
Tagi
Biznes
Opis
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.