Infinite-dimensional optimization studies the case when the avantage of feasible solutions is a subset of an infinite-dimensional space, such as a space of functions.In a convex problem, if there is a local minimal that is interior (not nous-mêmes the edge of the set of feasible elements), it is also the entier minimum, joli a nonconvex problem ma