Displaying 161 – 180 of 2516

Showing per page

A rough curvature-dimension condition for metric measure spaces

Anca-Iuliana Bonciocat (2014)

Open Mathematics

We introduce and study a rough (approximate) curvature-dimension condition for metric measure spaces, applicable especially in the framework of discrete spaces and graphs. This condition extends the one introduced by Karl-Theodor Sturm, in his 2006 article On the geometry of metric measure spaces II, to a larger class of (possibly non-geodesic) metric measure spaces. The rough curvature-dimension condition is stable under an appropriate notion of convergence, and stable under discretizations as...

A second order η -approximation method for constrained optimization problems involving second order invex functions

Tadeusz Antczak (2009)

Applications of Mathematics

A new approach for obtaining the second order sufficient conditions for nonlinear mathematical programming problems which makes use of second order derivative is presented. In the so-called second order η -approximation method, an optimization problem associated with the original nonlinear programming problem is constructed that involves a second order η -approximation of both the objective function and the constraint function constituting the original problem. The equivalence between the nonlinear...

A selection theorem of Helly type and its applications

Ehrhard Behrends, Kazimierz Nikodem (1995)

Studia Mathematica

We prove an abstract selection theorem for set-valued mappings with compact convex values in a normed space. Some special cases of this result as well as its applications to separation theory and Hyers-Ulam stability of affine functions are also given.

A sequential iteration algorithm with non-monotoneous behaviour in the method of projections onto convex sets

Gilbert Crombez (2006)

Czechoslovak Mathematical Journal

The method of projections onto convex sets to find a point in the intersection of a finite number of closed convex sets in a Euclidean space, may lead to slow convergence of the constructed sequence when that sequence enters some narrow “corridor” between two or more convex sets. A way to leave such corridor consists in taking a big step at different moments during the iteration, because in that way the monotoneous behaviour that is responsible for the slow convergence may be interrupted. In this...

A sharp isoperimetric inequality in the plane

Angelo Alvino, Vincenzo Ferone, Carlo Nitsch (2011)

Journal of the European Mathematical Society

We show that among all the convex bounded domain in m a t h b b R 2 having an assigned Fraenkel asymmetry index, there exists only one convex set (up to a similarity) which minimizes the isoperimetric deficit. We also show how to construct this set. The result can be read as a sharp improvement of the isoperimetric inequality for convex planar domain.

A short introduction to shadows of 4-manifolds

Francesco Costantino (2005)

Fundamenta Mathematicae

We give a self-contained introduction to the theory of shadows as a tool to study smooth 3-manifolds and 4-manifolds. The goal of the present paper is twofold: on the one hand, it is intended to be a shortcut to a basic use of the theory of shadows, on the other hand it gives a sketchy overview of some of the most recent results on shadows. No original result is proved here and most of the details of the proofs are left out.

Currently displaying 161 – 180 of 2516