Global optimization approach to Malfatti's problem.

We examine Malfatti's problem which dates back to 200 years ago from the view point of global optimization. The problem has been formulated as the convex maximization problem over a nonconvex set. Global optimality condition by Strekalovsky (Sov Math Dokl 292(5):1062-1066, ) has been applied to this problem. For solving numerically Malfatti's problem, we propose the algorithm in Enkhbat (J Glob Optim 8:379-391, ) which converges globally. Some computational results are provided. [ABSTRACT FROM AUTHOR]