Solving Malfatti's high dimensional problem by global optimization

DOI10.3934/NACO.2016005MaRDI QIDQ317131zbMATH OpenOpenAlexFDO

Authors R. Enkhbat, A. S. Strekalovskiĭ, Maria Barkova

Publication date 30 September 2016

Published in Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3934/naco.2016005

zbMATH Keywords

generalized Malfatti problemglobal optimizationnumerical algorithmoptimality conditions

Mathematics Subject Classification ID

History of calculus of variations and optimal control (49-03) Optimality conditions for problems involving relations other than differential equations (49K21) Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)

Review text

The authors consider Malfatti's problem, which was formulated ca. 200 years ago, and survey the history of attempts to solve it. The problem consists in packing three non-overlapping circles of maximum total area in a given triangle. The authors generalize the problem to the high dimensional case and formulate it as a maximization problem with concave objective function and non-convex compact feasible set. Conditions of global optimality by Strekalovsky are applied to the problem and an algorithm for its approximate solution is proposed. The algorithm generates a maximizing sequence for the problem. The authors show that each accumulation point of the sequence is a global solution of the generalized Malfatti problem. Experiences with solving some numerical examples are reported in the concluding part of the paper.

Recommendations

• Global optimization approach to Malfatti's problem
• Global optimization reduction of generalized Malfatti's problem
• Global search method for solving Malfatti's four-circle problem
• Multi-objective Optimization Approach to Malfatti's Problem
• Convex maximization formulation of general sphere packing problem

Cites work

• A Generalization of Radon's Theorem
• An algorithm for maximizing a convex function over a simple set
• Global optimization approach to Malfatti's problem
• scientific article; zbMATH DE number 4009675 (Why is no real title available?)
• scientific article; zbMATH DE number 609933 (Why is no real title available?)
• scientific article; zbMATH DE number 609934 (Why is no real title available?)
• On the Original Malfatti Problem
• The problem of Malfatti: Two centuries of debate

Cited in

(10)

• Generalized Nash equilibrium problem based on Malfatti's problem
• Maximizing the sum of radii of balls inscribed in a polyhedral set
• Convex maximization formulation of general sphere packing problem
• Global optimization reduction of generalized Malfatti's problem
• Application of survival theory in taxation
• Global optimization approach to Malfatti's problem
• Global search method for solving Malfatti's four-circle problem
• The problem of Malfatti: Two centuries of debate
• Multi-objective Optimization Approach to Malfatti's Problem
• Optimal control sphere packing problem

This page was built for publication: Solving Malfatti's high dimensional problem by global optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q317131)