Abstract
In this study, we propose an inner approximation method for solving a Lipschitz optimization problem. In order to execute the algorithm, we consider the projection of the feasible set on a ball. The algorithm utilizes an approximation of the ball by a sequence of polytopes from inside.