Abstract
We generalize Malfatti's problem which dates back to 200 years ago as a global optimization problem in a high dimensional space. The problem has been formulated as the convex maximization problem over a nonconvex set. Global optimality condition by Strekalovsky [11] has been applied to this problem. For solving numerically Malfatti's problem, we propose the algorithm in [3] which converges globally. Some computational results are provided.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
