1. CMB Online first
 Haase, Christian; Hofmann, Jan

Convexnormal (pairs of) polytopes
In 2012 Gubeladze (Adv. Math. 2012)
introduced the notion of $k$convexnormal polytopes to show
that
integral polytopes all of whose edges are longer than $4d(d+1)$
have
the integer decomposition property.
In the first part of this paper we show that for lattice polytopes
there is no difference between $k$ and $(k+1)$convexnormality
(for
$k\geq 3 $) and improve the bound to $2d(d+1)$. In the second
part we
extend the definition to pairs of polytopes. Given two rational
polytopes $P$ and $Q$, where the normal fan of $P$ is a refinement
of
the normal fan of $Q$.
If every edge $e_P$ of $P$ is at least $d$ times as long as the
corresponding face (edge or vertex) $e_Q$ of $Q$, then $(P+Q)\cap
\mathbb{Z}^d
= (P\cap \mathbb{Z}^d ) + (Q \cap \mathbb{Z}^d)$.
Keywords:integer decomposition property, integrally closed, projectively normal, lattice polytopes Categories:52B20, 14M25, 90C10 

2. CMB 2011 (vol 55 pp. 697)
 Borwein, Jonathan M.; Vanderwerff, Jon

Constructions of Uniformly Convex Functions
We give precise conditions under which the composition
of a norm with a convex function yields a
uniformly convex function on a Banach space.
Various applications are given to functions of power type.
The results are dualized to study uniform smoothness
and several examples are provided.
Keywords:convex function, uniformly convex function, uniformly smooth function, power type, Fenchel conjugate, composition, norm Categories:52A41, 46G05, 46N10, 49J50, 90C25 

3. CMB 2003 (vol 46 pp. 575)
 Marshall, M.

Optimization of Polynomial Functions
This paper develops a refinement of Lasserre's algorithm for
optimizing a polynomial on a basic closed semialgebraic set via
semidefinite programming and addresses an open question concerning the
duality gap. It is shown that, under certain natural stability
assumptions, the problem of optimization on a basic closed set reduces
to the compact case.
Categories:14P10, 46L05, 90C22 

4. CMB 2000 (vol 43 pp. 25)
 Bounkhel, M.; Thibault, L.

Subdifferential Regularity of Directionally Lipschitzian Functions
Formulas for the Clarke subdifferential are always expressed in the
form of inclusion. The equality form in these formulas generally
requires the functions to be directionally regular. This paper
studies the directional regularity of the general class of
extendedrealvalued functions that are directionally Lipschitzian.
Connections with the concept of subdifferential regularity are also
established.
Keywords:subdifferential regularity, directional regularity, directionally Lipschitzian functions Categories:49J52, 58C20, 49J50, 90C26 
