Skip to Main content Skip to Navigation
Journal articles

Minimizing within convex bodies using a convex hull method

Abstract : We present numerical methods to solve optimization problems on the space of convex functions or among convex bodies. Hence convexity is a constraint on the admissible objects, whereas the functionals are not required to be convex.To deal with, our method mix geometrical and numerical algorithms. We give several applications arising from classical problems in geometry and analysis: Alexandrov's problem of finding a convex body of prescribed surface function; Cheeger's problem of a subdomain minimizing the ratio surface area on volume; Newton's problem of the body of minimal resistance. In particular for the latter application, the minimizers are still unknown, except in some particular classes. We give approximate solutions better than the theoretical known ones, hence demonstrating that the minimizers do not belong to these classes.
Document type :
Journal articles
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00385109
Contributor : Edouard Oudet Connect in order to contact the contributor
Submitted on : Monday, May 18, 2009 - 1:57:20 PM
Last modification on : Wednesday, July 28, 2021 - 4:00:42 AM
Long-term archiving on: : Thursday, June 10, 2010 - 9:29:47 PM

File

convexhull.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00385109, version 1

Collections

Citation

Thomas Lachand-Robert, Edouard Oudet. Minimizing within convex bodies using a convex hull method. SIAM Journal on Optimization, Society for Industrial and Applied Mathematics, 2005, 16 (2), pp.368--379. ⟨hal-00385109⟩

Share

Metrics

Record views

290

Files downloads

989