Global optimization approach to Malfatti’s problem

Rentsen Enkhbat ()
Additional contact information
Rentsen Enkhbat: Institute of Mathematics of National University of Mongolia

Journal of Global Optimization, 2016, vol. 65, issue 1, No 4, 33-39

Abstract: Abstract 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, 1987) has been applied to this problem. For solving numerically Malfatti’s problem, we propose the algorithm in Enkhbat (J Glob Optim 8:379–391, 1996) which converges globally. Some computational results are provided.

Keywords: Malfatti’s problem; Triangle set; Circle; Global optimization; Algorithm; Global optimality conditions (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10898-015-0372-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:65:y:2016:i:1:d:10.1007_s10898-015-0372-6

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-015-0372-6

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().