This course discusses basic convex analysis (convex sets, functions, and optimization problems), optimization theory (linear, quadratic, semidefinite, and geometric programming; optimality conditions ...

Transactions of the American Mathematical Society, Vol. 327, No. 2 (Oct., 1991), pp. 795-813 (19 pages) Let Γ(X) denote the proper, lower semicontinuous, convex functions on a Banach space X, equipped ...

Convex geometry and combinatorial optimisation form a vibrant nexus of research that bridges theoretical mathematics with practical algorithm design. The study of convex sets and their structural ...

Convex geometry and point set configurations form a pivotal area of research in computational geometry, where the primary focus is the study of convex sets and the intricate arrangements of points in ...

Optimization without calculus; geometric programming; convex sets and convex functions; review of linear algebra; linear programming and the simplex method; convex programming; iterative ...

American Journal of Mathematics, Vol. 138, No. 2 (April 2016), pp. 499-527 (29 pages) This paper deals with some geometrical properties of solutions of some semilinear elliptic equations in bounded ...

The goal of this course is to investigate in-depth and to develop expert knowledge in the theory and algorithms for convex optimization. This course will provide a rigorous introduction to the rich ...

Inhalt: In this course we will study some basic concepts of Convex and Integral Geometry and at the end we will get in touch with a few classical results from Stochastic geometry. In the first part of ...