IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-0-8176-4536-6_2.html
   My bibliography  Save this book chapter

Critical Points Via Minimization

In: An Invitation to Variational Methods in Differential Equations

Author

Listed:
  • David G. Costa

    (University of Nevada, Las Vegas, Department of Mathematical Sciences)

Abstract

One of the most basic minimization problems one can pose is the following: Given a functional ϕ: E → ℝ on a Hilbert space E and a closed, convex subset C ⊂ E on which ϕ is bounded from below, find u 0 ∈ C such that $$ \phi \left( {u_0 } \right) = \mathop {\inf }\limits_{u \in C} \phi \left( u \right). $$ Of course, the problem as stated is much too general and one should be careful and make additional hypotheses! Nowadays, any good calculus student is aware of the fact that a function ϕ: ℝ → ℝ which is bounded from below on a closed interval C ⊂ ℝ does not necessarily attain its infimum in C. In fact, in learning the classic Weierstrass theorem, the student might have discovered that this delicate question of attaining the infimum is intimately connected to “continuity” of the functional ϕ and “compactness” of the set C! More precisely, the result that follows is well known and standard in a first course on Topology. For that, we recall that a functional ϕ: X → ℝ on a topological space X is lowersemicontinuous (l.s.c.) if ϕ−1(a, ∞) is open in X for any a ∈ ℝ (that is, ϕ−1(− ∞, a] is closed in X for any a ∈ ℝ). And if X satisfies the first countability axiom (for example, if X is a metric space), then ϕ: X → ℝ is l.s.c. if and only if ϕ(û) ≤ lim inf ϕ(un) for any û ∈ X and sequence u n converging to û.

Suggested Citation

  • David G. Costa, 2007. "Critical Points Via Minimization," Springer Books, in: An Invitation to Variational Methods in Differential Equations, chapter 2, pages 7-18, Springer.
  • Handle: RePEc:spr:sprchp:978-0-8176-4536-6_2
    DOI: 10.1007/978-0-8176-4536-6_2
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-0-8176-4536-6_2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.