Convex Analysis and Minimization Algorithms I

Více o knize

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.