Solving Malfatti's high dimensional problem by global optimization

DOI10.3934/naco.2016005zbMath1350.49048OpenAlexW2468860914MaRDI QIDQ317131

Rentsen Enkhbat, Maria V. Barkova, Alexander S. Strekalovsky

Publication date: 30 September 2016

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

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

zbMATH Keywords

global optimizationoptimality conditionsnumerical algorithmgeneralized Malfatti problem

Mathematics Subject Classification ID

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

Related Items (5)

Global optimization reduction of generalized Malfatti's problem ⋮ Application of survival theory in taxation ⋮ Maximizing the sum of radii of balls inscribed in a polyhedral set ⋮ Convex maximization formulation of general sphere packing problem ⋮ Generalized Nash equilibrium problem based on Malfatti's problem

Cites Work

• Global optimization approach to Malfatti's problem
• The problem of Malfatti: Two centuries of debate
• An algorithm for maximizing a convex function over a simple set
• A Generalization of Radon's Theorem
• On the Original Malfatti Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

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