Solving Malfatti's high dimensional problem by global optimization
DOI10.3934/NACO.2016005zbMATH Open1350.49048OpenAlexW2468860914MaRDI QIDQ317131FDOQ317131
R. Enkhbat, Maria Barkova, A. S. Strekalovskiĭ
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
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical methods based on nonlinear programming (49M37) Optimality conditions for problems involving relations other than differential equations (49K21) History of calculus of variations and optimal control (49-03)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An algorithm for maximizing a convex function over a simple set
- Global optimization approach to Malfatti's problem
- The problem of Malfatti: Two centuries of debate
- On the Original Malfatti Problem
- A Generalization of Radon's Theorem
Cited In (8)
- Convex maximization formulation of general sphere packing problem
- The problem of Malfatti: Two centuries of debate
- Global optimization reduction of generalized Malfatti's problem
- Maximizing the sum of radii of balls inscribed in a polyhedral set
- Multi-objective Optimization Approach to Malfatti's Problem
- Generalized Nash equilibrium problem based on Malfatti's problem
- Application of survival theory in taxation
- 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)
