zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
The concentration-compactness principle in the calculus of variations. The locally compact case. I. (English) Zbl 0541.49009
This paper presents a general method - called concentration-compactness method - for solving certain minimization problems on unbounded domains. This method applies to problems with some form of local compactness. For minimization problems with constraints, sub-additivity inequalities are obtained for the infimum of the problem considered as a function of the value of the constraint. The concentration-compactness method states that ”all minimizing sequences are relatively compact if and only if the sub- additivity inequalities are strict.” This principle is applied to various examples - rotating stars problem, Choquard-Pekar problem, and nonlinear fields equations.
Reviewer: S.Lenhart

MSC:
49J45Optimal control problems involving semicontinuity and convergence; relaxation
54D45Local compactness, σ-compactness
49S05Variational principles of physics
35J65Nonlinear boundary value problems for linear elliptic equations
49J20Optimal control problems with PDE (existence)
47J05Equations involving nonlinear operators (general)
58E30Variational principles on infinite-dimensional spaces
81Q05Closed and approximate solutions to quantum-mechanical equations