Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Global search method for solving Malfatti's four-circle problem

From MaRDI portal
Publication:326276
Jump to:navigation, search

zbMath1348.90526MaRDI QIDQ326276

Rentsen Enkhbat, Maria V. Barkova

Publication date: 12 October 2016

Published in: Izvestiya Irkutskogo Gosudarstvennogo Universiteta. Seriya Matematika (Search for Journal in Brave)

Full work available at URL: http://isu.ru/journal/downloadArticle?article=_377e72cddf9c4ca6a3d9409838c653d4&lang=eng


zbMATH Keywords

circlealgorithmglobal optimizationoptimality conditionsMalfatti's problemtriangle set


Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10)


Related Items (2)

Maximizing the sum of radii of balls inscribed in a polyhedral set ⋮ Convex maximization formulation of general sphere packing problem




Cites Work

  • Unnamed Item
  • The problem of Malfatti: Two centuries of debate
  • An algorithm for maximizing a convex function over a simple set
  • On the Original Malfatti Problem




This page was built for publication: Global search method for solving Malfatti's four-circle problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:326276&oldid=12202319"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 02:30.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki