We investigate the minima of functionals of the form ¿gWƒ(u), where O 2 is a bounded domain and ƒ a smooth function. The admissible functions are convex and satisfy on O, where and are fixed functions on O. An important example is the problem of the body of least resistance formulated by Newton (see [2]). If ƒ is convex or concave, we show that the minimum is attained by either or if these functions are equal on ¿O. In the case where ƒ is nonconvex, we prove that any minimizer u has a special structure in the region where it is different from and : in any open set where u is differentiable, u is not strictly convex. Convex functions with this property are ‘rare’ in the sense of Baire (see [8]). A consequence of this result is that the radia...
Consiglio Nazionale delle Ricerche - Biblioteca Centrale - P.le Aldo Moro, 7, Rome / CNR - Consiglio...
In this paper we derive necessary and sufficient conditions for some problems of global minimization...
7 pages; 1 figureInternational audienceWe consider the convex optimization problem P: min { f(x): x ...
We investigate the minima of functionals of the form ¿gWƒ(u), where O 2 is a bounded domain and ƒ a ...
ABSTRACT. – We study the minima of the functional f (∇u). The function f is not convex, the set is...
We study the minima of the functional $int_Omega f(nabla u)$. The function $f$ is not convex, the s...
We consider the following problem: minimize the functional f (∇u(x)) dx in the class of concave func...
Isoperimetric problems as well as free minimum problems for non-coercive, one-dimensional functional...
AbstractWe consider the minimization problemminv∈W1,10(BnR,Rm)∫BnRf∇vx+hvxdx,where BnR is the ball o...
G. Alberti, G. Bouchitte and G. Dal Maso [The calibration method for the Mumford-Shah functional, C....
In this paper we consider Newton’s problem of finding a convex body of least resistance. This proble...
International audienceWe prove the existence of minimizers for functionals defined over the class of...
We study the flat region of stationary points of the functional∫ Ω F (|∇u(x)|)dx under the constrain...
We describe an algorithm to approximate the minimizer of an elliptic functional in the form R Ω j(x...
We consider the convex optimization problem P: minx{f(x): x ∈ K} where f is convex continuously diff...
Consiglio Nazionale delle Ricerche - Biblioteca Centrale - P.le Aldo Moro, 7, Rome / CNR - Consiglio...
In this paper we derive necessary and sufficient conditions for some problems of global minimization...
7 pages; 1 figureInternational audienceWe consider the convex optimization problem P: min { f(x): x ...
We investigate the minima of functionals of the form ¿gWƒ(u), where O 2 is a bounded domain and ƒ a ...
ABSTRACT. – We study the minima of the functional f (∇u). The function f is not convex, the set is...
We study the minima of the functional $int_Omega f(nabla u)$. The function $f$ is not convex, the s...
We consider the following problem: minimize the functional f (∇u(x)) dx in the class of concave func...
Isoperimetric problems as well as free minimum problems for non-coercive, one-dimensional functional...
AbstractWe consider the minimization problemminv∈W1,10(BnR,Rm)∫BnRf∇vx+hvxdx,where BnR is the ball o...
G. Alberti, G. Bouchitte and G. Dal Maso [The calibration method for the Mumford-Shah functional, C....
In this paper we consider Newton’s problem of finding a convex body of least resistance. This proble...
International audienceWe prove the existence of minimizers for functionals defined over the class of...
We study the flat region of stationary points of the functional∫ Ω F (|∇u(x)|)dx under the constrain...
We describe an algorithm to approximate the minimizer of an elliptic functional in the form R Ω j(x...
We consider the convex optimization problem P: minx{f(x): x ∈ K} where f is convex continuously diff...
Consiglio Nazionale delle Ricerche - Biblioteca Centrale - P.le Aldo Moro, 7, Rome / CNR - Consiglio...
In this paper we derive necessary and sufficient conditions for some problems of global minimization...
7 pages; 1 figureInternational audienceWe consider the convex optimization problem P: min { f(x): x ...