Algorithm to find a convex polyhedron with maximum size inscribed in other polyhedron

The article discusses problem of finding the polyhedrons given shape inside another polyhedrons. It is proposed method for finding the inscribed polyhedrons, based on the reduction of the problem to a nonlinear programming problem and its solutions with ready-made software resources. Also it is proposed possible optimizations to speed up the algorithm.