# subdifferential

## The External Estimate of the Compact Set by Lebesgue Set of the Convex Function

The finite-dimensional problem of embedding a given compact D ⊂ R p into the lower Lebesgue set G(α) = {y ∈ R p : f(y) 6 α} of the convex function f(·) with the smallest value of α due to the offset of D is considered. Its mathematical formalization leads to the problem of minimizing the function φ(x) = max y∈D f(y − x) on R p . The properties of the function φ(x) are researched, necessary and sufficient conditions and conditions for the uniqueness of the problem solution are obtained.

## On an Approach to Approximate Solving of the Problem for the Best Approximation for Compact Body by a Ball of Fixed Radius

In this paper, we consider the problem of the best approximation of a compact body by a fixed radius ball with respect to an arbitrary norm in the Hausdorff metric. This problem is reduced to a linear programming problem in the case, when compact body and ball of the norm are polytops.

## On Equivalence of the Method of Steepest Descent and the Method of Hypodifferential Descent in Some Constrained Optimization Problems

The method of exact penalty functions is widely used for the study of constrained optimization problems. The approach based on exact penalization was successfully applied to the study of optimal control problems and various problems of the calculus of variations, computational geometry and mathematical diagnostics. It is worth mentioning that even if the constrained optimization problem under consideration is smooth, the equivalent unconstrained optimization problems constructed via exact penalization technique is essentially nonsmooth.

## On a Approximate Solution of the Problem of Aspherical Convex Compact Set

We examine a finite-dimensional problem of minimizing the ratio radius of the ball given a compact convex set (in an arbitrary norm) to the radius of the inscribed sphere through the choice of a common center of these balls. The article offers an approach to building the numerical method of its solution. At each step of the iterative process it is required to solve the problem of convex programming, target function of which is the difference between the radius of a circumscribed sphere, and scalable, with some positive factor, the radius of the inscribed sphere.