Jump to content

Infinite-dimensional optimization

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Oleg Alexandrov (talk | contribs) at 03:18, 20 December 2004 (Initiated article. To be continued.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In certain optimization problems the unknown optimal solution can be not a number or a vector, but rather a continuous quantity, for example a function or the shape of a body. Such a problem is an infinite dimensional optimization problem, because, a continuous quantity cannot be determined by a finite number of degrees of freedom.

Examples

  • Find the shortest path between two points in a plane. The answer to this is of course the line segment joining the points.
  • Given two points in a landscape with lots of hills an valleys, find a road joining them which has the shortest length. This problem is a generalization of the above, and the answer to it is clearly non-trivial.